Skip to main content
SpringerLink
Log in

A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times

  • Original Paper
  • Published:
TOP Aims and scope Submit manuscript

Abstract

This paper describes a generalized variable neighborhood search heuristic for the Capacitated Vehicle Routing Problem with Stochastic Service Times, in which the service times at vertices are stochastic. The heuristic is tested on randomly generated instances and compared with two other heuristics and with an alternative solution strategy. Computational results show the superiority and effectiveness of the proposed heuristic.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Bräysy O (2003) A reactive variable neighborhood search for the vehicle routing problem with time windows. INFORMS J Comput 15:347–368

    Article  Google Scholar 

  • Carraway RL, Morin TL, Moskowitz H (1989) Generalized dynamic programming for stochastic combinatorial optimization. Oper Res 37:819–829

    Article  Google Scholar 

  • Clarke G, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12:568–581

    Article  Google Scholar 

  • Dueck G (1993) New optimization heuristics: The great deluge algorithm and the record-to-record travel. J Comput Phys 104:86–92

    Article  Google Scholar 

  • Fleszar K, Osman I, Hindi KS (2009) A variable neighborhood search algorithm for the open vehicle routing problem. Eur J Oper Res 195:803–809

    Article  Google Scholar 

  • Hansen P, Mladenović N (1997) Variable neighborhood search for the p-median. Location Sci 5:207–226

    Article  Google Scholar 

  • Hansen P, Mladenović N (2005) Variable neighborhood search. In: Burke EK, Kendall G (eds) Search methodologies. Springer, Berlin, pp 211–238

    Chapter  Google Scholar 

  • Hansen P, Mladenović N, Pérez JAM (2010) Variable neighborhood search: methods and applications. Ann Oper Res 175:367–407

    Article  Google Scholar 

  • Irnich S, Funke B, Grünert T (2006) Sequential search and its application to vehicle-routing problems. Comput Oper Res 33:2405–2429

    Article  Google Scholar 

  • Kao EPC (1978) A preference order dynamic program for a stochastic traveling salesman problem. Oper Res 26:1033–1045

    Article  Google Scholar 

  • Kenyon AS, Morton DP (2003) Stochastic vehicle routing with random travel times. Transp Sci 37:69–82

    Article  Google Scholar 

  • Kytöjoki J, Nuortio T, Bräysy O, Gendreau M (2007) An efficient variable neighborhood search heuristic for very large scale vehicle routing problems. Comput Oper Res 34:2743–2757

    Article  Google Scholar 

  • Lambert V, Laporte G, Louveaux FV (1993) Designing collection routes through bank branches. Comput Oper Res 20:783–791

    Article  Google Scholar 

  • Laporte G, Louveaux FV, Mercure H (1992) The vehicle routing problem with stochastic travel times. Transp Sci 26:161–170

    Article  Google Scholar 

  • Leipälä (1978) On the solutions of stochastic traveling salesman problems. Eur J Oper Res 2:291–297

    Article  Google Scholar 

  • Li X, Tian P, Leung SCH (2010) Vehicle routing problems with time windows and stochastic travel and service times: models and algorithm. Int J Prod Econ 125:137–145

    Article  Google Scholar 

  • Liu S-C, Chung C-H (2009) A heuristic method for the vehicle routing problem with backhauls and inventory. J Intell Manuf 20:29–42

    Article  Google Scholar 

  • Melechovsky J, Prins C, Wolfler-Calvo R (2005) A metaheuristic to solve a location-routing problem with non-linear costs. J Heuristics 11:375–391

    Article  Google Scholar 

  • Mladenović N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24:1097–1100

    Article  Google Scholar 

  • Rousseau L-M, Gendreau M, Pesant G (2002) Using constraint-based operators to solve the vehicle routing problem with time windows. J Heuristics 8:43–58

    Article  Google Scholar 

  • Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper Res 35:254–265

    Article  Google Scholar 

  • Sniedovich M (1981) Analysis of a preference order traveling salesman problem. Oper Res 29:1234–1237

    Article  Google Scholar 

  • Toth P, Vigo D (2003) The granular tabu search and its application to the vehicle-routing problem. INFORMS J Comput 15:333–346

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Information Systems and Management, National University of Defense Technology, Changsha, Hunan, 410073, P.R. China

    Hongtao Lei & Bo Guo

  2. Canada Research Chair in Distribution Management and CIRRELT, HEC Montréal, 3000 chemin de la Côte-Sainte-Catherine, Montreal, H3T 2A7, Canada

    Gilbert Laporte

Authors
  1. Hongtao Lei
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gilbert Laporte
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Bo Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Gilbert Laporte.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lei, H., Laporte, G. & Guo, B. A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times. TOP 20, 99–118 (2012). https://doi.org/10.1007/s11750-011-0188-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11750-011-0188-6

Keywords

Mathematics Subject Classification (2000)

Search

Navigation