Abstract
The adaptive memory algorithm (AMA) is a population-based metaheuristics initially developed in 1995 by Rochat and Taillard. AMA relies on a central memory M and consists in three steps: generate a new solution s from M with a recombination operator, improve s with a local search operator, and use s to update M with a memory update operator. In 1999, Galinier and Hao proposed the GPX recombination operator for the graph coloring problem. In this paper, AMC, a general type of evolutionary algorithm, is formalized and called Adaptive Memory Algorithm with the Covering Recombination Operator. It relies on a specific formulation of the considered problem and on a generalization of the GPX recombination operator. It will be showed that AMC has obtained promising results in various domains, such as graph coloring, satellite range scheduling and project management.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barbulescu, L., Watson, J.-P., Whitley, L.D., Howe, A.E.: Scheduling space-ground communications for the air force satellite control network. Journal of Scheduling 7(1), 7–34 (2004)
Galinier, P., Hao, J.K.: Hybrid evolutionary algorithms for graph coloring. Journal of Combinatorial Optimization 3(4), 379–397 (1999)
Galinier, P., Hertz, A., Zufferey, N.: An adaptive memory algorithm for the graph coloring problem. Discrete Applied Mathematics 156, 267–279 (2008)
Gendreau, M., Potvin, J.-Y.: Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol. 146. Springer (2010)
Globus, A., Crawford, J., Lohn, J., Pryor, A.: A comparison of techniques for scheduling earth observing satellites. In: Proceedings of the Sixteenth Innovative Applications of Artificial Intelligence Conference (IAAI 2004), San Jose (2004)
Hertz, A., Schindl, D., Zufferey, N.: A solution method for a car fleet management problem with maintenance constraints. Journal of Heuristics 15(5), 425–450 (2009)
Lu, Z., Hao, J.-K.: A memetic algorithm for graph coloring. European Journal of Operational Research 203, 241–250 (2010)
Malaguti, E., Toth, P.: A survey on vertex coloring problems. International Transactions in Operational Research 17(1), 1–34 (2010)
Nemhauser, G., Wolsey, L.: Integer and Combinatorial Optimization. John Wiley & Sons (1988)
Parish, D.A.: A genetic algorithm approach to automating satellite range scheduling. Master’s thesis, Air Force Institute of Technology, USA (1994)
Rochat, Y., Taillard, E.: Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics 1, 147–167 (1995)
Zufferey, N.: Metaheuristics: some Principles for an Efficient Design. Computer Technology and Applications 3(6), 446–462 (2012)
Zufferey, N., Amstutz, P., Giaccari, P.: Graph colouring approaches for a satellite range scheduling problem. Journal of Scheduling 11(4), 263–277 (2008)
Zufferey, N., Labarthe, O., Schindl, D.: Heuristics for a project management problem with incompatibility and assignment costs. Computational Optimization and Applications 51, 1231–1252 (2012)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Zufferey, N. (2015). Adaptive Memory Algorithm with the Covering Recombination Operator. In: Le Thi, H., Pham Dinh, T., Nguyen, N. (eds) Modelling, Computation and Optimization in Information Systems and Management Sciences. Advances in Intelligent Systems and Computing, vol 360. Springer, Cham. https://doi.org/10.1007/978-3-319-18167-7_14
Download citation
DOI: https://doi.org/10.1007/978-3-319-18167-7_14
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-18166-0
Online ISBN: 978-3-319-18167-7
eBook Packages: EngineeringEngineering (R0)