Two models for the generalized assignment problem in uncertain environment

The generalized assignment problem (GAP) is a unique extended form of the Knapsack problem, which is tremendously practical in optimization fields. For instance, resource allocation, sequencing, supply chain management, etc. This paper tackles the GAP in uncertain environment in which the assignment costs and capacity of agents are fuzzy numbers. Two models are presented for this problem and a novel hybrid algorithm is offered using simulated annealing (SA) method and max-min fuzzy in order to obtain near optimal solution. Computational experiments validate the efficiency of proposed method.