Adaptive Memory Programming: A Unified View of Meta-Heuristics
Éric D. Taillard, Gambardella, Luca Maria, Gendreau, Michel, Potvin, Jean-Yves · 1998
The paper analyses recent developments of a number of memory-based metaheuristics such as taboo search, scatter search, genetic algorithms and ant colonies. It shows that the implementations of these general solving methods are more and more 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 adaptive memory programming 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. 1 Introduction Generic heuristic methods, also called metaheuristics or general local search methods are growing at a very fast, exploding rate: the most important conferences in operational research have one or many sessions entirely devoted to metaheuristics and there are also journals entirely devoted to th...