Tabu search for the multilevel generalized assignment problem

Tabu search for the multilevel generalized assignment problem

0.00 Avg rating0 Votes
Article ID: iaor19981366
Country: Netherlands
Volume: 82
Issue: 1
Start Page Number: 176
End Page Number: 189
Publication Date: Apr 1995
Journal: European Journal of Operational Research
Authors: , , ,
Keywords: programming: integer
Abstract:

The multilevel generalized assignment problem (MGAP) differs from the classical GAP in that agents can perform tasks at more than one efficiency level. Important manufacturing problems, such as lot sizing, can be formulated as MGAPs; however, the large number of variables in the related 0–1 integer program makes the use of commercial optimization packages impractical. In this paper, we present a heuristic approach to the solution of the MGAP, which consists of a novel application of tabu search (TS). Our TS method employs neighborhoods defined by ejection chains, that produce moves of greater power without significantly increasing the computational effort.

Reviews

Required fields are marked *. Your email address will not be published.