TOP

, Volume 20, Issue 1, pp 99–118 | Cite as

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

Original Paper

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.

Keywords

Stochastic vehicle routing Stochastic service time Route duration Generalized variable neighborhood search 

Mathematics Subject Classification (2000)

05 90B06 90B15 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bräysy O (2003) A reactive variable neighborhood search for the vehicle routing problem with time windows. INFORMS J Comput 15:347–368 CrossRefGoogle Scholar
  2. Carraway RL, Morin TL, Moskowitz H (1989) Generalized dynamic programming for stochastic combinatorial optimization. Oper Res 37:819–829 CrossRefGoogle Scholar
  3. Clarke G, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12:568–581 CrossRefGoogle Scholar
  4. Dueck G (1993) New optimization heuristics: The great deluge algorithm and the record-to-record travel. J Comput Phys 104:86–92 CrossRefGoogle Scholar
  5. 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 CrossRefGoogle Scholar
  6. Hansen P, Mladenović N (1997) Variable neighborhood search for the p-median. Location Sci 5:207–226 CrossRefGoogle Scholar
  7. Hansen P, Mladenović N (2005) Variable neighborhood search. In: Burke EK, Kendall G (eds) Search methodologies. Springer, Berlin, pp 211–238 CrossRefGoogle Scholar
  8. Hansen P, Mladenović N, Pérez JAM (2010) Variable neighborhood search: methods and applications. Ann Oper Res 175:367–407 CrossRefGoogle Scholar
  9. Irnich S, Funke B, Grünert T (2006) Sequential search and its application to vehicle-routing problems. Comput Oper Res 33:2405–2429 CrossRefGoogle Scholar
  10. Kao EPC (1978) A preference order dynamic program for a stochastic traveling salesman problem. Oper Res 26:1033–1045 CrossRefGoogle Scholar
  11. Kenyon AS, Morton DP (2003) Stochastic vehicle routing with random travel times. Transp Sci 37:69–82 CrossRefGoogle Scholar
  12. 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 CrossRefGoogle Scholar
  13. Lambert V, Laporte G, Louveaux FV (1993) Designing collection routes through bank branches. Comput Oper Res 20:783–791 CrossRefGoogle Scholar
  14. Laporte G, Louveaux FV, Mercure H (1992) The vehicle routing problem with stochastic travel times. Transp Sci 26:161–170 CrossRefGoogle Scholar
  15. Leipälä (1978) On the solutions of stochastic traveling salesman problems. Eur J Oper Res 2:291–297 CrossRefGoogle Scholar
  16. 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 CrossRefGoogle Scholar
  17. 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 CrossRefGoogle Scholar
  18. 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 CrossRefGoogle Scholar
  19. Mladenović N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24:1097–1100 CrossRefGoogle Scholar
  20. 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 CrossRefGoogle Scholar
  21. Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper Res 35:254–265 CrossRefGoogle Scholar
  22. Sniedovich M (1981) Analysis of a preference order traveling salesman problem. Oper Res 29:1234–1237 CrossRefGoogle Scholar
  23. Toth P, Vigo D (2003) The granular tabu search and its application to the vehicle-routing problem. INFORMS J Comput 15:333–346 CrossRefGoogle Scholar

Copyright information

© Sociedad de Estadística e Investigación Operativa 2011

Authors and Affiliations

  1. 1.College of Information Systems and ManagementNational University of Defense TechnologyChangshaP.R. China
  2. 2.Canada Research Chair in Distribution Management and CIRRELTHEC MontréalMontrealCanada

Personalised recommendations