Adaptive memory programming: A unified view of metaheuristics

• Published in: European Journal of Operational Research Vol. 135; no. 1; pp. 1 - 16
• Main Authors: Taillard, Éric D, Gambardella, Luca M, Gendreau, Michel, Potvin, Jean-Yves
• Format: Book Review Journal Article
• Language: English
• Published: Elsevier B.V 16-11-2001; Elsevier
• Series: European Journal of Operational Research
• Subjects: Evolutionary computations; Genetic algorithms; Metaheuristics; Multi-agent systems; Quadratic assignment; Taboo search; Vehicle routing; Evolutionary computations; Metaheuristics; Vehicle routing; Quadratic assignment; Taboo search; Genetic algorithms; Multi-agent systems
• ISSN: 0377-2217; 1872-6860
• DOI: 10.1016/S0377-2217(00)00268-X

The paper analyses recent developments of a number of memory-based metaheuristics such as taboo search (TS), scatter search (SS), genetic algorithms (GA) 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.