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

Improvement heuristics for the Vehicle Routing Problem based on simulated annealing

Author

Listed:
  • Van Breedam, Alex

Abstract

No abstract is available for this item.

Suggested Citation

  • Van Breedam, Alex, 1995. "Improvement heuristics for the Vehicle Routing Problem based on simulated annealing," European Journal of Operational Research, Elsevier, vol. 86(3), pages 480-490, November.
    • Handle: RePEc:eee:ejores:v:86:y:1995:i:3:p:480-490
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(94)00064-J
    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. G. Clarke & J. W. Wright, 1964. "Scheduling of Vehicles from a Central Depot to a Number of Delivery Points," Operations Research, INFORMS, vol. 12(4), pages 568-581, August.
    2. David S. Johnson & Cecilia R. Aragon & Lyle A. McGeoch & Catherine Schevon, 1991. "Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning," Operations Research, INFORMS, vol. 39(3), pages 378-406, June.
    3. Fred Glover, 1989. "Tabu Search---Part I," INFORMS Journal on Computing, INFORMS, vol. 1(3), pages 190-206, August.
    4. David S. Johnson & Cecilia R. Aragon & Lyle A. McGeoch & Catherine Schevon, 1989. "Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning," Operations Research, INFORMS, vol. 37(6), pages 865-892, December.
    5. Bruce Hajek, 1988. "Cooling Schedules for Optimal Annealing," Mathematics of Operations Research, INFORMS, vol. 13(2), pages 311-329, May.
    6. Eglese, R. W., 1990. "Simulated annealing: A tool for operational research," European Journal of Operational Research, Elsevier, vol. 46(3), pages 271-281, June.
    7. M.W.P. Savelsbergh, 1990. "A parallel insertion heuristic for vehicle routing with side constraints," Statistica Neerlandica, Netherlands Society for Statistics and Operations Research, vol. 44(3), pages 139-148, September.
    8. S. Lin & B. W. Kernighan, 1973. "An Effective Heuristic Algorithm for the Traveling-Salesman Problem," Operations Research, INFORMS, vol. 21(2), pages 498-516, April.
    9. Robuste, Francesc & Daganzo, Carlos F. & Souleyrette, Reginald R., 1990. "Implementing vehicle routing models," Transportation Research Part B: Methodological, Elsevier, vol. 24(4), pages 263-286, August.
    10. Billy E. Gillett & Leland R. Miller, 1974. "A Heuristic Algorithm for the Vehicle-Dispatch Problem," Operations Research, INFORMS, vol. 22(2), pages 340-349, April.
    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. Gong, Manlin & Hu, Yucong & Chen, Zhiwei & Li, Xiaopeng, 2021. "Transfer-based customized modular bus system design with passenger-route assignment optimization," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 153(C).
    2. Gayialis, Sotiris P. & Tatsiopoulos, Ilias P., 2004. "Design of an IT-driven decision support system for vehicle routing and scheduling," European Journal of Operational Research, Elsevier, vol. 152(2), pages 382-398, January.
    3. Joseph I. Daniel & Munish Pahwa, 2005. "There and Back Again: Airline Routes, Fares and Passenger Flows in Network Equilibria," Working Papers 05-07, University of Delaware, Department of Economics.
    4. Sebastián Muñoz-Herrera & Karol Suchan, 2022. "Local Optima Network Analysis of Multi-Attribute Vehicle Routing Problems," Mathematics, MDPI, vol. 10(24), pages 1-21, December.
    5. Hughes, Michael S. & Lunday, Brian J. & Weir, Jeffrey D. & Hopkinson, Kenneth M., 2021. "The multiple shortest path problem with path deconfliction," European Journal of Operational Research, Elsevier, vol. 292(3), pages 818-829.
    6. Tan, K.C. & Chew, Y.H. & Lee, L.H., 2006. "A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 172(3), pages 855-885, August.
    7. Lin, Shih-Wei & Yu, Vincent F., 2012. "A simulated annealing heuristic for the team orienteering problem with time windows," European Journal of Operational Research, Elsevier, vol. 217(1), pages 94-107.
    8. Yu, Vincent F. & Anh, Pham Tuan & Baldacci, Roberto, 2023. "A robust optimization approach for the vehicle routing problem with cross-docking under demand uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 173(C).
    9. Wei, Lijun & Zhang, Zhenzhen & Zhang, Defu & Leung, Stephen C.H., 2018. "A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints," European Journal of Operational Research, Elsevier, vol. 265(3), pages 843-859.
    10. L Zeng & H L Ong & K M Ng, 2007. "A generalized crossing local search method for solving vehicle routing problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(4), pages 528-532, April.
    11. Goeke, Dominik, 2019. "Granular tabu search for the pickup and delivery problem with time windows and electric vehicles," European Journal of Operational Research, Elsevier, vol. 278(3), pages 821-836.
    12. Shukla, Nagesh & Choudhary, A.K. & Prakash, P.K.S. & Fernandes, K.J. & Tiwari, M.K., 2013. "Algorithm portfolios for logistics optimization considering stochastic demands and mobility allowance," International Journal of Production Economics, Elsevier, vol. 141(1), pages 146-166.
    13. Gajpal, Yuvraj & Abad, P.L., 2009. "Multi-ant colony system (MACS) for a vehicle routing problem with backhauls," European Journal of Operational Research, Elsevier, vol. 196(1), pages 102-117, July.
    14. Zografos, Konstantinos G. & Androutsopoulos, Konstantinos N., 2004. "A heuristic algorithm for solving hazardous materials distribution problems," European Journal of Operational Research, Elsevier, vol. 152(2), pages 507-519, January.
    15. Chen Chao & Tian Zhihui & Yao Baozhen, 2019. "Optimization of two-stage location–routing–inventory problem with time-windows in food distribution network," Annals of Operations Research, Springer, vol. 273(1), pages 111-134, February.
    16. Hu, Qian & Lim, Andrew, 2014. "An iterative three-component heuristic for the team orienteering problem with time windows," European Journal of Operational Research, Elsevier, vol. 232(2), pages 276-286.
    17. Du, Mingyang & Cheng, Lin & Li, Xuefeng & Tang, Fang, 2020. "Static rebalancing optimization with considering the collection of malfunctioning bikes in free-floating bike sharing system," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 141(C).
    18. Vidal, Thibaut & Crainic, Teodor Gabriel & Gendreau, Michel & Prins, Christian, 2013. "Heuristics for multi-attribute vehicle routing problems: A survey and synthesis," European Journal of Operational Research, Elsevier, vol. 231(1), pages 1-21.
    19. Belarmino Adenso-Díaz & Manuel Laguna, 2006. "Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search," Operations Research, INFORMS, vol. 54(1), pages 99-114, February.

    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. Pirlot, Marc, 1996. "General local search methods," European Journal of Operational Research, Elsevier, vol. 92(3), pages 493-511, August.
    2. Vidal, Thibaut & Crainic, Teodor Gabriel & Gendreau, Michel & Prins, Christian, 2013. "Heuristics for multi-attribute vehicle routing problems: A survey and synthesis," European Journal of Operational Research, Elsevier, vol. 231(1), pages 1-21.
    3. Voudouris, Christos & Tsang, Edward, 1999. "Guided local search and its application to the traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 113(2), pages 469-499, March.
    4. Kai Gutenschwager & Christian Niklaus & Stefan Voß, 2004. "Dispatching of an Electric Monorail System: Applying Metaheuristics to an Online Pickup and Delivery Problem," Transportation Science, INFORMS, vol. 38(4), pages 434-446, November.
    5. 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.
    6. 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.
    7. Kim, Yeong-Dae & Lim, Hyeong-Gyu & Park, Moon-Won, 1996. "Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process," European Journal of Operational Research, Elsevier, vol. 91(1), pages 124-143, May.
    8. B Suman & P Kumar, 2006. "A survey of simulated annealing as a tool for single and multiobjective optimization," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(10), pages 1143-1160, October.
    9. Jesus Gonzalez-Feliu, 2012. "Cost optimisation in freight distribution with cross-docking: N-echelon location routing problem," Post-Print halshs-00565329, HAL.
    10. Julia Rieck & Jürgen Zimmermann & Matthias Glagow, 2007. "Tourenplanung mittelständischer Speditionsunternehmen in Stückgutkooperationen: Modellierung und heuristische Lösungsverfahren," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 17(4), pages 365-388, January.
    11. Tânia Rodrigues Pereira Ramos & Maria Isabel Gomes & Ana Paula Barbosa-Póvoa, 2020. "A new matheuristic approach for the multi-depot vehicle routing problem with inter-depot routes," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(1), pages 75-110, March.
    12. Sleman Saliba, 2006. "Heuristics for the lexicographic max-ordering vehicle routing problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 14(3), pages 313-336, September.
    13. Drexl, Andreas & Haase, Knut, 1993. "Sequential-analysis-based randomized-regret-methods for lotsizing and scheduling," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 323, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    14. Crainic, Teodor Gabriel & Laporte, Gilbert, 1997. "Planning models for freight transportation," European Journal of Operational Research, Elsevier, vol. 97(3), pages 409-438, March.
    15. J Faulin & A García del Valle, 2008. "Solving the capacitated vehicle routing problem using the ALGELECT electrostatic algorithm," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(12), pages 1685-1695, December.
    16. Olli Bräysy & Michel Gendreau, 2005. "Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms," Transportation Science, INFORMS, vol. 39(1), pages 104-118, February.
    17. Goodson, Justin C. & Ohlmann, Jeffrey W. & Thomas, Barrett W., 2012. "Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand," European Journal of Operational Research, Elsevier, vol. 217(2), pages 312-323.
    18. Van Buer, Michael G. & Woodruff, David L. & Olson, Rick T., 1999. "Solving the medium newspaper production/distribution problem," European Journal of Operational Research, Elsevier, vol. 115(2), pages 237-253, June.
    19. Doole, Graeme J., 2007. "A primer on implementing compressed simulated annealing for the optimisation of a constrained simulation model in Microsoft Excel," Working Papers 7420, University of Western Australia, School of Agricultural and Resource Economics.
    20. 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.

    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:86:y:1995:i:3:p:480-490. 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.