Skip to main content

Advertisement

Springer Nature Link
Log in

Constrained dynamic vehicle routing problems with time windows

  • Focus
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

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.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

Notes

  1. http://web.cba.neu.edu/msolomon/problems.htm.

  2. https://sites.google.com/site/gciports/vrptw/dynamic-vrptw.

    Table 2 Dynamic customers
    Full size table
    Table 3 Solution example. Insertion of dynamic requests
    Full size table

  3. http://www.fernuniversitaet-hagen.de/WINF/inhalte/benchmark_data.htm.

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  MathSciNet  Google Scholar 

  • 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, Italy

  • Chen ZL, Xu H (2006) Dynamic column generation for dynamic vehicle routing with time windows. Transp Sci 40(1):74–88

    Article  Google Scholar 

  • Croes GA (1958) A method for solving traveling-salesman problems. Oper Res 6(6):791–812

    Article  MathSciNet  Google Scholar 

  • 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 report

  • 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–809

    Article  Google Scholar 

  • Gendreau M, Potvin JY (eds) (2004) Focused section on real-time fleet management, vol 38. Transportation Science

  • Michel Gendreau, Alain Hertz, Gilbert Laporte (1992) New insertion and postoptimization procedures for the traveling salesman problem. Oper Res 40(6):1086–1094

    Article  MathSciNet  Google Scholar 

  • 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–11

  • Goel A, Gruhn V (2008) A general vehicle routing problem. Eur J Oper Res 191(3):650–660

    Article  MathSciNet  Google Scholar 

  • Hansen P, Mladenovic N, Moreno-Pérez JA (2010) Variable neighbourhood search: methods and applications. Ann OR 175(1):367–407

    Article  Google Scholar 

  • Hemmelmayr V, Doerner K, Hartl R (2009) A variable neighborhood search heuristic for periodic routing problems. Eur J Oper Res 195(3):791–802

    Article  Google Scholar 

  • Hong L (2012) An improved LNS algorithm for real-time vehicle routing problem with time windows. Comput Oper Res 39(2):151–163

    Article  Google Scholar 

  • 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–8

  • Nicolas J, Frederic S, El-Ghazali T (2008) Multi-objective vehicle routing problems. Eur J Oper Res 189(2):293–309

    Article  Google Scholar 

  • 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–1439

    Article  Google Scholar 

  • 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–2757

    Article  Google Scholar 

  • Lackner A (2004) Selection meta-heuristics for dynamic vehicle routing problem (Dynamische Tourenplanung mit ausgewählten Metaheuristiken). Number 47. Göttinger Wirtschftinformatik

  • Larsen A (2001) The dynamic vehicle routing problem. Ph.D. Thesis

  • 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–218

  • Lund K, Madsen OBG, Rygaard JM (1996) Vehicle routing problems with varying degrees of dynamism. Technical Report, IMM Institute of Mathematical Modelling

  • Montemanni R, Gambardella LM, Rizzoli AE, Donati A (2005) Ant colony system for a dynamic vehicle routing problem. J Comb Optim 10(4):327–343

    Article  MathSciNet  Google Scholar 

  • Ilhan O (1976) Traveling salesman-type combinatorial problems and their relation to the logistics of regional blood banking. Xerox University Microfilms

  • Pillac V, Gendreau M, Gueret C, Medaglia AL (2013) A review of dynamic vehicle routing problems. Eur J Oper Res 225(1):1–11

    Article  MathSciNet  Google Scholar 

  • 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–627

    Article  Google Scholar 

  • 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–154

    Article  Google Scholar 

  • Rizzoli AE, Montemanni R, Lucibello E, Gambardella LM (2007) Ant colony optimization for real-world vehicle routing problems. Swarm Intel 1:135–151

    Article  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  • 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–186

    Article  Google Scholar 

Download references

Acknowledgments

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.

Author information

Authors and Affiliations

  1. Department of Computer Engineering, University of La Laguna, San Cristóbal de La Laguna, Spain

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

Authors
  1. Jesica de Armas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Belén Melián-Batista
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Belén Melián-Batista.

Additional information

Communicated by I. R. Ruiz.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

de Armas, J., Melián-Batista, B. Constrained dynamic vehicle routing problems with time windows. Soft Comput 19, 2481–2498 (2015). https://doi.org/10.1007/s00500-014-1574-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-014-1574-4

Keywords

Search

Navigation