Adaptive memory programming: A unified view of metaheuristics

  • Taillard É
  • Gambardella L
  • Gendreau M
 et al. 
  • 93

    Readers

    Mendeley users who have this article in their library.
  • 127

    Citations

    Citations of this article.

Abstract

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. © 2001 Elsevier Science B.V. All rights reserved.

Author-supplied keywords

  • Evolutionary computations
  • Genetic algorithms
  • Metaheuristics
  • Multi-agent systems
  • Quadratic assignment
  • Taboo search
  • Vehicle routing

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free