Please use this identifier to cite or link to this item:
|Title:||An efficient solution to biobjective generalized assignment problem||Authors:||Zhang, C.W.
Generalized assignment problem
Multiobjective integer programming
|Issue Date:||Jan-2007||Citation:||Zhang, C.W., Ong, H.L. (2007-01). An efficient solution to biobjective generalized assignment problem. Advances in Engineering Software 38 (1) : 50-58. ScholarBank@NUS Repository. https://doi.org/10.1016/j.advengsoft.2006.06.003||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 real world situations where more than one objective is involved. An efficient LP-based heuristic is proposed to solve the biobjective generalized assignment problem (BiGAP). Extensive computational experiments are carried out to evaluate the performance of the proposed method. The results show that the proposed approach is able to generate good approximations to the nondominated frontier of the BiGAP efficiently, especially when the ratio of the number of items to the number of knapsacks is large. © 2006 Elsevier Ltd. All rights reserved.||Source Title:||Advances in Engineering Software||URI:||http://scholarbank.nus.edu.sg/handle/10635/63001||ISSN:||09659978||DOI:||10.1016/j.advengsoft.2006.06.003|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Sep 21, 2019
WEB OF SCIENCETM
checked on Sep 13, 2019
checked on Sep 8, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.