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

Full description

Saved in:

Bibliographic Details
Published in:	Advances in engineering software (1992) Vol. 38; no. 1; pp. 50 - 58
Main Authors:	Zhang, Cai Wen, Ong, Hoon Liong
Format:	Journal Article
Language:	English
Published:	Elsevier Ltd 2007
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	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