An efficient Simulated Annealing approach for Elastic Generalized Assignment Problem

The elastic generalized assignment problem (EGAP) 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. In EGAP violating the resource constraints are allowed at a price and attempt is to minimize the overall costs of both assignment costs and violating prices. It has been proved that this problem is NP-Hard. Hence in this paper, the efficient Simulated Annealing (SA) approach is proposed to solve this class of problems for the first time. Finally, the SA parameters are analysed by simulation.

Keywords:

simulated annealing , elastic generalized assignment problem , resource allocation