An efficient solution to biobjective generalized assignment problem

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Advances in engineering software (1992) Jg. 38; H. 1; S. 50 - 58
Hauptverfasser: Zhang, Cai Wen, Ong, Hoon Liong
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier Ltd 2007
Schlagworte:
Generalized assignment problem
LP-based heuristic
Multiobjective integer programming
ε-Nondominated solution
Generalized assignment problem
Multiobjective integer programming
ε-Nondominated solution
LP-based heuristic
ISSN:0965-9978
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0965-9978
DOI:10.1016/j.advengsoft.2006.06.003