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

A multi-start local search algorithm for the vehicle routing problem with time windows

Author

Listed:
  • Braysy, Olli
  • Hasle, Geir
  • Dullaert, Wout

Abstract

No abstract is available for this item.

Suggested Citation

  • Braysy, Olli & Hasle, Geir & Dullaert, Wout, 2004. "A multi-start local search algorithm for the vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 159(3), pages 586-605, December.
    • Handle: RePEc:eee:ejores:v:159:y:2004:i:3:p:586-605
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(03)00435-1
    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. Paul M. Thompson & Harilaos N. Psaraftis, 1993. "Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems," Operations Research, INFORMS, vol. 41(5), pages 935-946, October.
    2. 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.
    3. G Ioannou & M Kritikos & G Prastacos, 2001. "A greedy look-ahead heuristic for the vehicle routing problem with time windows," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 52(5), pages 523-537, May.
    4. Potvin, Jean-Yves & Rousseau, Jean-Marc, 1993. "A parallel route building algorithm for the vehicle routing and scheduling problem with time windows," European Journal of Operational Research, Elsevier, vol. 66(3), pages 331-340, May.
    5. César Rego, 1998. "A Subpath Ejection Method for the Vehicle Routing Problem," Management Science, INFORMS, vol. 44(10), pages 1447-1459, October.
    6. 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.
    7. É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.
    8. Marius M. Solomon, 1987. "Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints," Operations Research, INFORMS, vol. 35(2), pages 254-265, April.
    9. George Kontoravdis & Jonathan F. Bard, 1995. "A GRASP for the Vehicle Routing Problem with Time Windows," INFORMS Journal on Computing, INFORMS, vol. 7(1), pages 10-23, February.
    10. Julien Bramel & David Simchi-Levi, 1996. "Probabilistic Analyses and Practical Algorithms for the Vehicle Routing Problem with Time Windows," Operations Research, INFORMS, vol. 44(3), pages 501-509, June.
    11. Niklas Kohl & Jacques Desrosiers & Oli B. G. Madsen & Marius M. Solomon & François Soumis, 1999. "2-Path Cuts for the Vehicle Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 33(1), pages 101-116, February.
    12. Robert A. Russell, 1995. "Hybrid Heuristics for the Vehicle Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 29(2), pages 156-166, May.
    13. Li, Haibing & Lim, Andrew, 2003. "Local search with annealing-like restarts to solve the VRPTW," European Journal of Operational Research, Elsevier, vol. 150(1), pages 115-127, October.
    14. J-F Cordeau & G Laporte & A Mercier, 2001. "A unified tabu search heuristic for vehicle routing problems with time windows," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 52(8), pages 928-936, August.
    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. Cruijssen, F. & Borm, P.E.M. & Fleuren, H.A. & Hamers, H.J.M., 2005. "Insinking : A Methodology to Exploit Synergy in Transportation," Other publications TiSEM 958be918-e7b4-4e46-9cbe-d, Tilburg University, School of Economics and Management.
    2. Olli Bräysy & Wout Dullaert & Geir Hasle & David Mester & Michel Gendreau, 2008. "An Effective Multirestart Deterministic Annealing Metaheuristic for the Fleet Size and Mix Vehicle-Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 42(3), pages 371-386, August.
    3. Vicky Mak & Andreas Ernst, 2007. "New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 66(1), pages 69-98, August.
    4. Vieira, Bruno S. & Ribeiro, Glaydston M. & Bahiense, Laura & Cruz, Roberto & Mendes, André B. & Laporte, Gilbert, 2021. "Exact and heuristic algorithms for the fleet composition and periodic routing problem of offshore supply vessels with berth allocation decisions," European Journal of Operational Research, Elsevier, vol. 295(3), pages 908-923.
    5. Tai-Yu Ma, 2011. "A cross entropy multiagent learning algorithm for solving vehicle routing problems with time windows," Post-Print halshs-00592118, HAL.
    6. He, Dongdong & Guan, Wei, 2023. "Promoting service quality with incentive contracts in rural bus integrated passenger-freight service," Transportation Research Part A: Policy and Practice, Elsevier, vol. 175(C).
    7. Cruijssen, F. & Braysy, O. & Dullaert, W. & Fleuren, H.A. & Salomon, M., 2007. "Joint route planning under varying market conditions," Other publications TiSEM 52bc4d35-1558-4fee-8ff5-b, Tilburg University, School of Economics and Management.
    8. Cruijssen, F. & Braysy, O. & Dullaert, W. & Fleuren, H.A. & Salomon, M., 2006. "Joint Route Planning under Varying Market Conditions," Other publications TiSEM 3de2ec0a-7424-43ec-a419-5, Tilburg University, School of Economics and Management.
    9. 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.
    10. Masmoudi, Mohamed Amine & Hosny, Manar & Braekers, Kris & Dammak, Abdelaziz, 2016. "Three effective metaheuristics to solve the multi-depot multi-trip heterogeneous dial-a-ride problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 96(C), pages 60-80.
    11. He, Dongdong & Ceder, Avishai (Avi) & Zhang, Wenyi & Guan, Wei & Qi, Geqi, 2023. "Optimization of a rural bus service integrated with e-commerce deliveries guided by a new sustainable policy in China," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 172(C).
    12. Cruijssen, F., 2006. "Horizontal cooperation in transport and logistics," Other publications TiSEM ab6dbe68-aebc-4b03-8eea-d, Tilburg University, School of Economics and Management.
    13. Min-Xia Zhang & Hong-Fan Yan & Jia-Yu Wu & Yu-Jun Zheng, 2020. "Quarantine Vehicle Scheduling for Transferring High-Risk Individuals in Epidemic Areas," IJERPH, MDPI, vol. 17(7), pages 1-17, March.
    14. Cruijssen, Frans & Borm, Peter & Fleuren, Hein & Hamers, Herbert, 2010. "Supplier-initiated outsourcing: A methodology to exploit synergy in transportation," European Journal of Operational Research, Elsevier, vol. 207(2), pages 763-774, December.

    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, 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.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. Homberger, Jorg & Gehring, Hermann, 2005. "A two-phase hybrid metaheuristic for the vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 162(1), pages 220-238, April.
    8. Diana, Marco & Dessouky, Maged M., 2004. "A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 38(6), pages 539-557, July.
    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. Russell, Robert A. & Chiang, Wen-Chyuan, 2006. "Scatter search for the vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 169(2), pages 606-622, March.
    11. Hong, Sung-Chul & Park, Yang-Byung, 1999. "A heuristic for bi-objective vehicle routing with time window constraints," International Journal of Production Economics, Elsevier, vol. 62(3), pages 249-258, September.
    12. Li, Haibing & Lim, Andrew, 2003. "Local search with annealing-like restarts to solve the VRPTW," European Journal of Operational Research, Elsevier, vol. 150(1), pages 115-127, October.
    13. 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.
    14. Wanpracha Chaovalitwongse & Dukwon Kim & Panos M. Pardalos, 2003. "GRASP with a New Local Search Scheme for Vehicle Routing Problems with Time Windows," Journal of Combinatorial Optimization, Springer, vol. 7(2), pages 179-207, June.
    15. Lau, Hoong Chuin & Sim, Melvyn & Teo, Kwong Meng, 2003. "Vehicle routing problem with time windows and a limited number of vehicles," European Journal of Operational Research, Elsevier, vol. 148(3), pages 559-569, August.
    16. Calvete, Herminia I. & Gale, Carmen & Oliveros, Maria-Jose & Sanchez-Valverde, Belen, 2007. "A goal programming approach to vehicle routing problems with soft time windows," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1720-1733, March.
    17. Yanzhi Li & Andrew Lim & Brian Rodrigues, 2005. "Manpower allocation with time windows and job‐teaming constraints," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(4), pages 302-311, June.
    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. L Tansini & O Viera, 2006. "New measures of proximity for the assignment algorithms in the MDVRPTW," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(3), pages 241-249, March.
    20. Tan Yu & Yongpei Guan & Xiang Zhong, 2024. "Visiting nurses assignment and routing for decentralized telehealth service networks," Annals of Operations Research, Springer, vol. 341(2), pages 1191-1221, October.

    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:159:y:2004:i:3:p:586-605. 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.