Article ID: | iaor20021406 |
Country: | Netherlands |
Volume: | 132 |
Issue: | 1 |
Start Page Number: | 22 |
End Page Number: | 38 |
Publication Date: | Jul 2001 |
Journal: | European Journal of Operational Research |
Authors: | Fernndez Elena, Daz Juan A. |
Keywords: | heuristics |
This paper considers the generalized assignment problem (GAP). It is a well-known NP-hard combinatorial optimization problem that is interesting in itself and also appears as a subproblem in other problems of practical importance. A Tabu search heuristic for the GAP is proposed. The algorithm uses recent and medium-term memory to dynamically adjust the weight of the penalty incurred for violating feasibility. The most distinctive features of the proposed algorithm are its simplicity and its flexibility. These two characteristics result in an algorithm that, compared to other well-known heuristic procedures, provides good quality solutions in competitive computational times. Computational experiments have been performed in order to evaluate the behavior of the proposed algorithm.