IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v135y2001i1p1-16.html
   My bibliography  Save this article

Adaptive memory programming: A unified view of metaheuristics

Author

Listed:
  • Taillard, Eric D.
  • Gambardella, Luca M.
  • Gendreau, Michel
  • Potvin, Jean-Yves

Abstract

No abstract is available for this item.

Suggested Citation

  • Taillard, Eric D. & Gambardella, Luca M. & Gendreau, Michel & Potvin, Jean-Yves, 2001. "Adaptive memory programming: A unified view of metaheuristics," European Journal of Operational Research, Elsevier, vol. 135(1), pages 1-16, November.
  • Handle: RePEc:eee:ejores:v:135:y:2001:i:1:p:1-16
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(00)00268-X
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Michel Gendreau & François Guertin & Jean-Yves Potvin & Éric Taillard, 1999. "Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching," Transportation Science, INFORMS, vol. 33(4), pages 381-390, November.
    2. Michel Gendreau & Alain Hertz & Gilbert Laporte, 1994. "A Tabu Search Heuristic for the Vehicle Routing Problem," Management Science, INFORMS, vol. 40(10), pages 1276-1290, October.
    3. Fred Glover, 1989. "Tabu Search---Part I," INFORMS Journal on Computing, INFORMS, vol. 1(3), pages 190-206, August.
    4. Éric D. Taillard, 1994. "Parallel Taboo Search Techniques for the Job Shop Scheduling Problem," INFORMS Journal on Computing, INFORMS, vol. 6(2), pages 108-117, May.
    5. Wen-Chyuan Chiang & Robert A. Russell, 1997. "A Reactive Tabu Search Metaheuristic for the Vehicle Routing Problem with Time Windows," INFORMS Journal on Computing, INFORMS, vol. 9(4), pages 417-430, November.
    6. L M Gambardella & É D Taillard & M Dorigo, 1999. "Ant colonies for the quadratic assignment problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 50(2), pages 167-176, February.
    7. Jean-Yves Potvin & Tanguy Kervahut & Bruno-Laurent Garcia & Jean-Marc Rousseau, 1996. "The Vehicle Routing Problem with Time Windows Part I: Tabu Search," INFORMS Journal on Computing, INFORMS, vol. 8(2), pages 158-164, May.
    8. Éric Taillard & Philippe Badeau & Michel Gendreau & François Guertin & Jean-Yves Potvin, 1997. "A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows," Transportation Science, INFORMS, vol. 31(2), pages 170-186, May.
    9. Ulrich Faigle & Walter Kern, 1992. "Some Convergence Results for Probabilistic Tabu Search," INFORMS Journal on Computing, INFORMS, vol. 4(1), pages 32-37, February.
    10. Jiefeng Xu & James P. Kelly, 1996. "A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem," Transportation Science, INFORMS, vol. 30(4), pages 379-393, November.
    11. Roberto Battiti & Giampietro Tecchiolli, 1994. "The Reactive Tabu Search," INFORMS Journal on Computing, INFORMS, vol. 6(2), pages 126-140, May.
    12. Thomas E. Vollmann & Elwood S. Buffa, 1966. "The Facilities Layout Problem in Perspective," Management Science, INFORMS, vol. 12(10), pages 450-468, June.
    13. Bruce Hajek, 1988. "Cooling Schedules for Optimal Annealing," Mathematics of Operations Research, INFORMS, vol. 13(2), pages 311-329, May.
    14. Christophe Duhamel & Jean-Yves Potvin & Jean-Marc Rousseau, 1997. "A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows," Transportation Science, INFORMS, vol. 31(1), pages 49-59, February.
    15. Jean-Yves Potvin & Samy Bengio, 1996. "The Vehicle Routing Problem with Time Windows Part II: Genetic Search," INFORMS Journal on Computing, INFORMS, vol. 8(2), pages 165-172, May.
    16. Connolly, David T., 1990. "An improved annealing scheme for the QAP," European Journal of Operational Research, Elsevier, vol. 46(1), pages 93-100, May.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Michel Gendreau & Jean-Yves Potvin, 2005. "Metaheuristics in Combinatorial Optimization," Annals of Operations Research, Springer, vol. 140(1), pages 189-213, November.
    2. Jacek Blazewicz & Piotr Formanowicz & Pawel Kedziora & Pawel Marciniak & Przemyslaw Taront, 2011. "Adaptive memory programming: local search parallel algorithms for phylogenetic tree construction," Annals of Operations Research, Springer, vol. 183(1), pages 75-94, March.
    3. Burke, Edmund K. & Bykov, Yuri, 2017. "The late acceptance Hill-Climbing heuristic," European Journal of Operational Research, Elsevier, vol. 258(1), pages 70-78.
    4. Stefan Irnich & Daniel Villeneuve, 2006. "The Shortest-Path Problem with Resource Constraints and k -Cycle Elimination for k (ge) 3," INFORMS Journal on Computing, INFORMS, vol. 18(3), pages 391-406, August.
    5. El-Ghazali Talbi, 2016. "Combining metaheuristics with mathematical programming, constraint programming and machine learning," Annals of Operations Research, Springer, vol. 240(1), pages 171-215, May.
    6. Gianfranco Chicco & Andrea Mazza, 2020. "Metaheuristic Optimization of Power and Energy Systems: Underlying Principles and Main Issues of the ‘Rush to Heuristics’," Energies, MDPI, vol. 13(19), pages 1-38, September.
    7. E A Silver, 2004. "An overview of heuristic solution methods," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(9), pages 936-956, September.
    8. Martí, Rafael & Resende, Mauricio G.C. & Ribeiro, Celso C., 2013. "Multi-start methods for combinatorial optimization," European Journal of Operational Research, Elsevier, vol. 226(1), pages 1-8.
    9. Loiola, Eliane Maria & de Abreu, Nair Maria Maia & Boaventura-Netto, Paulo Oswaldo & Hahn, Peter & Querido, Tania, 2007. "A survey for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 176(2), pages 657-690, January.
    10. Michael Schneider & Michael Drexl, 2017. "A survey of the standard location-routing problem," Annals of Operations Research, Springer, vol. 259(1), pages 389-414, December.
    11. Bo Liu & Ling Wang & Ying Liu & Shouyang Wang, 2011. "A unified framework for population-based metaheuristics," Annals of Operations Research, Springer, vol. 186(1), pages 231-262, June.
    12. Pillac, Victor & Gendreau, Michel & Guéret, Christelle & Medaglia, Andrés L., 2013. "A review of dynamic vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 225(1), pages 1-11.
    13. N Wassan, 2007. "Reactive tabu adaptive memory programming search for the vehicle routing problem with backhauls," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(12), pages 1630-1641, December.
    14. Manuel Laguna & Francisco Gortázar & Micael Gallego & Abraham Duarte & Rafael Martí, 2014. "A black-box scatter search for optimization problems with integer variables," Journal of Global Optimization, Springer, vol. 58(3), pages 497-516, March.
    15. Debels, Dieter & De Reyck, Bert & Leus, Roel & Vanhoucke, Mario, 2006. "A hybrid scatter search/electromagnetism meta-heuristic for project scheduling," European Journal of Operational Research, Elsevier, vol. 169(2), pages 638-653, March.
    16. Abdel-Rahman Hedar & Wael Deabes & Hesham H. Amin & Majid Almaraashi & Masao Fukushima, 2022. "Global sensing search for nonlinear global optimization," Journal of Global Optimization, Springer, vol. 82(4), pages 753-802, April.
    17. Amalia I. Nikolopoulou & Panagiotis P. Repoussis & Christos D. Tarantilis & Emmanouil E. Zachariadis, 2019. "Adaptive memory programming for the many-to-many vehicle routing problem with cross-docking," Operational Research, Springer, vol. 19(1), pages 1-38, March.
    18. El-Bouri, A. & Azizi, N. & Zolfaghari, S., 2007. "A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: The case of job shop scheduling," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1894-1910, March.
    19. Hideki Hashimoto & Sylvain Boussier & Michel Vasquez & Christophe Wilbaut, 2011. "A GRASP-based approach for technicians and interventions scheduling for telecommunications," Annals of Operations Research, Springer, vol. 183(1), pages 143-161, March.
    20. Zvi Drezner & Peter Hahn & Éeric Taillard, 2005. "Recent Advances for the Quadratic Assignment Problem with Special Emphasis on Instances that are Difficult for Meta-Heuristic Methods," Annals of Operations Research, Springer, vol. 139(1), pages 65-94, October.
    21. Gendron, Bernard & Potvin, Jean-Yves & Soriano, Patrick, 2002. "Diversification strategies in local search for a nonbifurcated network loading problem," European Journal of Operational Research, Elsevier, vol. 142(2), pages 231-241, October.
    22. Dontas, Michael & Sideris, Georgios & Manousakis, Eleftherios G. & Zachariadis, Emmanouil E., 2023. "An adaptive memory matheuristic for the set orienteering problem," European Journal of Operational Research, Elsevier, vol. 309(3), pages 1010-1023.
    23. Francisco Casas & Claudio E. Torres & Ignacio Araya, 2022. "A heuristic search based on diversity for solving combinatorial problems," Journal of Heuristics, Springer, vol. 28(3), pages 287-328, June.
    24. Drexl, M. & Schneider, M., 2014. "A Survey of the Standard Location-Routing Problem," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 65940, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Olli Bräysy & Michel Gendreau, 2005. "Vehicle Routing Problem with Time Windows, Part II: Metaheuristics," Transportation Science, INFORMS, vol. 39(1), pages 119-139, February.
    2. Joaquín Pacheco & Rafael Caballero & Manuel Laguna & Julián Molina, 2013. "Bi-Objective Bus Routing: An Application to School Buses in Rural Areas," Transportation Science, INFORMS, vol. 47(3), pages 397-411, August.
    3. Olli Bräysy, 2003. "A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows," INFORMS Journal on Computing, INFORMS, vol. 15(4), pages 347-368, November.
    4. Baozhen Yao & Qianqian Yan & Mengjie Zhang & Yunong Yang, 2017. "Improved artificial bee colony algorithm for vehicle routing problem with time windows," PLOS ONE, Public Library of Science, vol. 12(9), pages 1-18, September.
    5. Sumanta Basu & Ghosh, Diptesh, 2008. "A review of the Tabu Search Literature on Traveling Salesman Problems," IIMA Working Papers WP2008-10-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
    6. Du, Timon C. & Li, Eldon Y. & Chou, Defrose, 2005. "Dynamic vehicle routing for online B2C delivery," Omega, Elsevier, vol. 33(1), pages 33-45, February.
    7. Michel Gendreau & Jean-Yves Potvin, 2005. "Metaheuristics in Combinatorial Optimization," Annals of Operations Research, Springer, vol. 140(1), pages 189-213, November.
    8. Russell Bent & Pascal Van Hentenryck, 2004. "A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 38(4), pages 515-530, November.
    9. Andrew Lim & Xingwen Zhang, 2007. "A Two-Stage Heuristic with Ejection Pools and Generalized Ejection Chains for the Vehicle Routing Problem with Time Windows," INFORMS Journal on Computing, INFORMS, vol. 19(3), pages 443-457, August.
    10. R A Russell & T L Urban, 2008. "Vehicle routing with soft time windows and Erlang travel times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(9), pages 1220-1228, September.
    11. Nguyen, Phuong Khanh & Crainic, Teodor Gabriel & Toulouse, Michel, 2013. "A tabu search for Time-dependent Multi-zone Multi-trip Vehicle Routing Problem with Time Windows," European Journal of Operational Research, Elsevier, vol. 231(1), pages 43-56.
    12. Sana Jawarneh & Salwani Abdullah, 2015. "Sequential Insertion Heuristic with Adaptive Bee Colony Optimisation Algorithm for Vehicle Routing Problem with Time Windows," PLOS ONE, Public Library of Science, vol. 10(7), pages 1-23, July.
    13. G W Kinney & R R Hill & J T Moore, 2005. "Devising a quick-running heuristic for an unmanned aerial vehicle (UAV) routing system," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(7), pages 776-786, July.
    14. Jean-Yves Potvin, 2009. "State-of-the Art Review ---Evolutionary Algorithms for Vehicle Routing," INFORMS Journal on Computing, INFORMS, vol. 21(4), pages 518-548, November.
    15. Jing-Quan Li, 2014. "Transit Bus Scheduling with Limited Energy," Transportation Science, INFORMS, vol. 48(4), pages 521-539, November.
    16. T. Ibaraki & S. Imahori & M. Kubo & T. Masuda & T. Uno & M. Yagiura, 2005. "Effective Local Search Algorithms for Routing and Scheduling Problems with General Time-Window Constraints," Transportation Science, INFORMS, vol. 39(2), pages 206-232, May.
    17. Bolte, Andreas & Thonemann, Ulrich Wilhelm, 1996. "Optimizing simulated annealing schedules with genetic programming," European Journal of Operational Research, Elsevier, vol. 92(2), pages 402-416, July.
    18. Luca Maria Gambardella & Marco Dorigo, 2000. "An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem," INFORMS Journal on Computing, INFORMS, vol. 12(3), pages 237-255, August.
    19. Pirlot, Marc, 1996. "General local search methods," European Journal of Operational Research, Elsevier, vol. 92(3), pages 493-511, August.
    20. Liu, Fuh-Hwa Franklin & Shen, Sheng-Yuan, 1999. "A route-neighborhood-based metaheuristic for vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 118(3), pages 485-504, November.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:135:y:2001:i:1:p:1-16. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.