Article ID: | iaor20021929 |
Country: | Netherlands |
Volume: | 135 |
Issue: | 1 |
Start Page Number: | 1 |
End Page Number: | 16 |
Publication Date: | Nov 2001 |
Journal: | European Journal of Operational Research |
Authors: | Potvin Jean-Yves, Gendreau Michel, Taillard ric D., Gambardella Luca M. |
Keywords: | programming: assignment |
The paper analyses recent developments of a number of memory-based metaheuristics such as tabu search, scatter search, genetic algorithms and ant colonies. It shows that the implementations of these general solving methods are increasingly similar. So, a unified presentation is proposed under the name of adaptive memory programming (AMP). A number of methods recently developed for the quadratic assignment, vehicle routing and graph colouring problems are reviewed and presented under the AMP point of view. AMP presents a number of interesting aspects such as a high parallelization potential and the ability of dealing with real and dynamic applications.