An efficient solution to biobjective generalized assignment problem

摘要: Abstract The generalized assignment problem (GAP) has found applications in many real world problems. In this paper, we examine the GAP from a multiobjective point of view to accommodate some situations where more than one objective is involved. An efficient LP-based heuristic proposed solve biobjective (BiGAP). Extensive computational experiments are carried out evaluate performance method. results show that approach able generate good approximations nondominated frontier BiGAP efficiently, especially when ratio number items knapsacks large.