Adaptive approach heuristics for the generalized assignment problem
The Generalized Assignment Problem consists in assigning a set of tasks to a set of agents with minimum cost. Each agent has a limited amount of a single resource and each task must be assigned to one and only one agent, requiring a certain amount of the resource of the agent. We present new metaheuristics for the generalized assignment problem based on hybrid approaches. One metaheuristic is a MAX-MIN Ant System (MMAS), an improved version of the Ant System, which was recently proposed by Stutzle and Hoos to combinatorial optimization problems, and it can be seen has an adaptive sampling algorithm that takes in consideration the experience gathered in earlier iterations of the algorithm. Moreover, the latter heuristic is combined with local search and tabu search heuristics to improve the search. A greedy randomized adaptive search heuristic (GRASP) is also proposed. Several neighborhoods are studied, including one based on ejection chains that produces good moves without increasing the computational effort. We present computational results of the comparative performance, followed by concluding remarks and ideas on future research in generalized assignment related problems.
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Marshall L. Fisher & R. Jaikumar & Luk N. Van Wassenhove, 1986. "A Multiplier Adjustment Method for the Generalized Assignment Problem," Management Science, INFORMS, vol. 32(9), pages 1095-1103, September.
- Laguna, Manuel & Kelly, James P. & Gonzalez-Velarde, JoseLuis & Glover, Fred, 1995. "Tabu search for the multilevel generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 82(1), pages 176-189, April.
- Cattrysse, Dirk G. & Van Wassenhove, Luk N., 1992. "A survey of algorithms for the generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 60(3), pages 260-272, August.
- Cattrysse, Dirk. G. & Salomon, Marc & Van Wassenhove, Luk N., 1994. "A set partitioning heuristic for the generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 72(1), pages 167-174, January.
When requesting a correction, please mention this item's handle: RePEc:upf:upfgen:288. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: ()
If references are entirely missing, you can add them using this form.