Soft Computing

, Volume 19, Issue 9, pp 2481–2498 | Cite as

Constrained dynamic vehicle routing problems with time windows

  • Jesica de Armas
  • Belén Melián-Batista


This paper tackles two variants of a Dynamic Vehicle Routing Problem with Time Windows as real-world applications of several companies in the Canary Islands, Spain. In these dynamic vehicle routing problems, customer requests can be either known at the beginning of the planning horizon or dynamically revealed over it. Particularly, the problems corresponding to a delivery company and a vending machines company are taken into consideration. In addition to the dynamism feature of these problems, the companies consider several attributes that consist of a fixed heterogeneous fleet of vehicles, multiple time windows, customers priorities and vehicle–customer constraints. This work proposes a metaheuristic procedure to solve these problems. The computational experiments indicate that the proposed method is feasible to solve these real-world problems.


Dynamic vehicle routing Time windows Heterogeneous fleet Metaheuristics 



This work has been partially funded by the Spanish Ministry of Economy and Competitiveness (TIN2012-32608) and the Spanish Ministry of Industry, Tourism and Trade (TSI-020100-2011-298). Research by Jesica de Armas, supported by the Canary Islands CIE: Tricontinental Atlantic Campus.


  1. Bräysy O (2003) A reactive variable neighborhood search for the vehicle routing problem with time windows. INFORMS J Comput 15:347–368MathSciNetCrossRefGoogle Scholar
  2. Cassani L, Righini G (2004) Heuristic algorithms for the tsp with rear-loading. In: 35th Annual Conference of the Italian Operations Research Society (AIRO XXXV), Lecce, ItalyGoogle Scholar
  3. Chen ZL, Xu H (2006) Dynamic column generation for dynamic vehicle routing with time windows. Transp Sci 40(1):74–88CrossRefGoogle Scholar
  4. Croes GA (1958) A method for solving traveling-salesman problems. Oper Res 6(6):791–812MathSciNetCrossRefGoogle Scholar
  5. De Armas J, Melián-Batista B, Moreno-Pérez JA, Brito J (2013) GVNS for a real-world rich vehicle routing problem with time windows. University of La Laguna, Technical reportGoogle Scholar
  6. Fleszar K, Osman I, Hindi K (2008) A variable neighbourhood search algorithm for the open vehicle routing problem. Eur J Oper Res 195(3):803–809CrossRefGoogle Scholar
  7. Gendreau M, Potvin JY (eds) (2004) Focused section on real-time fleet management, vol 38. Transportation ScienceGoogle Scholar
  8. Michel Gendreau, Alain Hertz, Gilbert Laporte (1992) New insertion and postoptimization procedures for the traveling salesman problem. Oper Res 40(6):1086–1094MathSciNetCrossRefGoogle Scholar
  9. Ghiani G, Guerriero F, Laporte G, Musmanno R (2003) Real-time vehicle routing: solution concepts, algorithms and parallel computing strategies. Eur J Oper Res 151:1–11Google Scholar
  10. Goel A, Gruhn V (2008) A general vehicle routing problem. Eur J Oper Res 191(3):650–660MathSciNetCrossRefGoogle Scholar
  11. Hansen P, Mladenovic N, Moreno-Pérez JA (2010) Variable neighbourhood search: methods and applications. Ann OR 175(1):367–407CrossRefGoogle Scholar
  12. Hemmelmayr V, Doerner K, Hartl R (2009) A variable neighborhood search heuristic for periodic routing problems. Eur J Oper Res 195(3):791–802CrossRefGoogle Scholar
  13. Hong L (2012) An improved LNS algorithm for real-time vehicle routing problem with time windows. Comput Oper Res 39(2):151–163CrossRefGoogle Scholar
  14. Ichoua S, Gendreau M, Potvin J-Y (2007) In: Zeimpekis V, Tarantilis CD, Giaglis GM, Minis I (eds) Planned route optimization for real-time vehicle routing., Dynamic fleet management, volume 38 of operations research/computer science interfaces seriesSpringer, US, pp 1–8Google Scholar
  15. Nicolas J, Frederic S, El-Ghazali T (2008) Multi-objective vehicle routing problems. Eur J Oper Res 189(2):293–309CrossRefGoogle Scholar
  16. Khouadjia MR, Sarasola B, Alba E, Jourdan L, Talbi EG (2012) A comparative study between dynamic adapted PSO and VNS for the vehicle routing problem with dynamic requests. Appl Soft Comput 12(4):1426–1439CrossRefGoogle Scholar
  17. Kytöjoki J, Nuortio T, Brysy O, Gendreau M (2007) An efficient variable neighborhood search heuristic for very large scale vehicle routing problems. Comput Oper Res 34(9):2743–2757CrossRefGoogle Scholar
  18. Lackner A (2004) Selection meta-heuristics for dynamic vehicle routing problem (Dynamische Tourenplanung mit ausgewählten Metaheuristiken). Number 47. Göttinger WirtschftinformatikGoogle Scholar
  19. Larsen A (2001) The dynamic vehicle routing problem. Ph.D. ThesisGoogle Scholar
  20. Larsen A, Madsen OBG, Solomon MM (2008) In: Golden B, Raghavan S, Wasil E (eds) Recent developments in dynamic vehicle routing systems., The Vehicle Routing Problem: Latest Advances and New Challenges, volume 43 of Operations Research/Computer Science InterfacesSpringer, US, pp 199–218Google Scholar
  21. Lund K, Madsen OBG, Rygaard JM (1996) Vehicle routing problems with varying degrees of dynamism. Technical Report, IMM Institute of Mathematical ModellingGoogle Scholar
  22. Montemanni R, Gambardella LM, Rizzoli AE, Donati A (2005) Ant colony system for a dynamic vehicle routing problem. J Comb Optim 10(4):327–343MathSciNetCrossRefGoogle Scholar
  23. Ilhan O (1976) Traveling salesman-type combinatorial problems and their relation to the logistics of regional blood banking. Xerox University MicrofilmsGoogle Scholar
  24. Pillac V, Gendreau M, Gueret C, Medaglia AL (2013) A review of dynamic vehicle routing problems. Eur J Oper Res 225(1):1–11MathSciNetCrossRefGoogle Scholar
  25. Polacek M, Hartl K, Doerner K, Reimann M (2004) A variable neighborhood search for the multi depot vehicle routing problem with time windows. J Heuristics 10(6):613–627CrossRefGoogle Scholar
  26. Psaraftis HN (1980) A Dynamic-programming solution to the single vehicle many-to-many immediate request dial-a-ride problem. Transp Sci 14(2):130–154CrossRefGoogle Scholar
  27. Rizzoli AE, Montemanni R, Lucibello E, Gambardella LM (2007) Ant colony optimization for real-world vehicle routing problems. Swarm Intel 1:135–151CrossRefGoogle Scholar
  28. Solomon MM (1987) Algorithms for the vehicle-routing and scheduling problems with time window constraints. Oper Res 35(2):254–265MathSciNetCrossRefGoogle Scholar
  29. Taillard E, Badeau P, Gendreau M, Guertin F, Potvin JY (1997) A tabu search heuristic for the vehicle routing problem with soft time windows. Transp Sci 31(2):170–186CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2015

Authors and Affiliations

  1. 1.Department of Computer EngineeringUniversity of La LagunaSan Cristóbal de La LagunaSpain

Personalised recommendations