Skip to main content
SpringerLink
Log in

A Granular Local Search Matheuristic for a Heterogeneous Fleet Vehicle Routing Problem with Stochastic Travel Times

  • Published:
Networks and Spatial Economics Aims and scope Submit manuscript

Abstract

This paper addresses a multi-attribute variant of the vehicle routing problem which encompasses a heterogeneous fixed fleet, flexible time windows and stochastic travel times. The objective is to minimize the sum of the transportation and the service costs. The former comprises the vehicle fixed costs and route variable costs, and the latter corresponds to the penalty costs for violating customer time windows. The problem is formulated as a two-stage stochastic mixed-integer program with recourse and solved by a granular local search matheuristic. The stochastic travel times are approximated by a finite set of scenarios generated by Burr type XII distribution. Extensive computational tests are performed on 216 benchmark instances, and the advantages of both flexible windows and stochastic travel times are stressed. The experiments show that, compared to a state-of-art mathematical programming solver, the developed matheuristic found better solutions in 81% of the instances within shorter computational times. The proposed solution method also far outperformed an alternative decomposition algorithm based on the augmented Lagrangian relaxation. Furthermore, the flexible time windows yielded overall cost savings for 68% of the instances compared to the solutions obtained for hard time window problems. Finally, explicitly modeling the stochastic travel times provided 66% more feasible solutions than the adoption of a deterministic model with the random parameters fixed at their expected values.

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

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

Similar content being viewed by others

References

  • Agra A, Christiansen M, Hvattum LM, Rodrigues F (2016) A MIP Based Local Search Heuristic for a Stochastic Maritime Inventory Routing Problem. In: Paias A, Ruthmair M, Voß S (eds) Proceedings of the 7th International Conference on Computational Logistics (ICCL 2016). Springer, Cham 18–34

  • Agra A, Requejo C, Rodrigues F (2018) An adjustable sample average approximation algorithm for the stochastic production-inventory-routing problem. Networks 72(1):5–24

    Article  Google Scholar 

  • Ando N, Taniguchi E (2006) Travel time reliability in vehicle routing and scheduling with time windows. Netw Spat Econ 6(3–4):293–311

    Article  Google Scholar 

  • Balas E, Simonetti N (2001) Linear time dynamic-programming algorithms for new classes of restricted TSPs: A computational study. INFORMS J Comput 13(1):56–75

    Article  Google Scholar 

  • Baldacci R, Battarra M, Vigo D (2008) Routing a heterogeneous fleet of vehicles. In: Golden BL, Raghavan S, Wasil EA (eds) The Vehicle Routing Problem: Latest Advances and New Challenges. Springer, New York, pp 3–27

    Chapter  Google Scholar 

  • Crainic TG, Fu X, Gendreau M, Rei W, Wallace SW (2011) Progressive hedging-based metaheuristics for stochastic network design. Networks 58(2):114–124

    Article  Google Scholar 

  • Crainic TG, Gobbato L, Perboli G, Rei W (2016) Logistics capacity planning: A stochastic bin packing formulation and a progressive hedging meta-heuristic. Eur J Oper Res 253:404–417

    Article  Google Scholar 

  • Birge JR (1982) The value of the stochastic solution in stochastic linear programs with fixed recourse. Math Program 24(1):314–325

    Article  Google Scholar 

  • Birge JR, Louveaux F (2011) Introduction to Stochastic Programming, 2nd edn. Springer, New York

    Book  Google Scholar 

  • Braekers K, Ramaekers K, Van Nieuwenhuyse I (2016) The vehicle routing problem: State of the art classification and review. Comput Ind Eng 99:300–313

    Article  Google Scholar 

  • Branchini RM, Armentano VA, Løkketangen A (2009) Adaptive granular local search heuristic for a dynamic vehicle routing problem. Comput Oper Res 36(11):2955–2968

    Article  Google Scholar 

  • Burr IW (1942) Cumulative Frequency Functions. Ann Math. Stat 13(2):215–232

    Google Scholar 

  • Dantzig GB, Ramser JH (1959) The truck dispatching problem. Manage Sci 6(1):80–91

    Article  Google Scholar 

  • Desaulniers G, Madsen OB, Røpke S (2014) The vehicle routing problem with time windows. In: Toth P, Vigo D (eds) Vehicle Routing: Problems, Methods, and Applications, 2nd edn. SIAM, Philadelphia, pp 119-159

  • Desrosiers J, Dumas Y, Solomon MM, Soumis F (1995) Time constrained routing and scheduling. In: Ball MO, Magnanti TL, Monma CL, Nemhauser FL (eds) Handbooks in Operations Research and Management Science, vol 8. Network Routing. Elsevier, Amsterdam, pp 35–139

    Google Scholar 

  • Fachini RF, Armentano VA (2020a) Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows. Optim Lett 14:579–609

    Article  Google Scholar 

  • Fachini RF, Armentano VA (2020b) Logic-based Benders decomposition for the heterogeneous fixed fleet vehicle routing problem with time windows. Comput Ind Eng 148:106641

  • Fedex (2018) Fedex Annual Report 2018. http://s1.q4cdn.com/714383399/files/oar/2018/AnnualReport2018/assets/pdf/FedEx-Annual-Report-2018.pdf. Accessed 05 September 2018

  • Firouzi M, Jouzdani J, Shirouyehzad H, Paydar MM (2018) A rich heterogeneous fleet vehicle routing problem with flexible time windows: a case study of dairy supply chain. International Journal of Logistics Systems and Management 30(3):386–405

    Article  Google Scholar 

  • Fischetti M, Lodi A (2003) Local branching. Math. Program 98(1–3):23–47

    Article  Google Scholar 

  • Fischetti M, Monaci M (2014) Proximity search for 0–1 mixed-integer convex programming. J Heuristics 20(6):709–731

  • Fisher ML, Jaikumar R (1981) A generalized assignment heuristic for vehicle routing. Networks 11(2):109–124

    Article  Google Scholar 

  • Gendreau M, Jabali O, Rei W (2014) Stochastic vehicle routing problems. In: Toth P, Vigo D (eds) Vehicle Routing: Problems, Methods, and Applications, 2nd edn. SIAM, Philadelphia, pp 213–239

    Chapter  Google Scholar 

  • Gendreau M, Jabali O, Rei W (2016) 50th Anniversary Invited Article – Future Research Directions in Stochastic Vehicle Routing. Transport Sci 50(4):1163–1173

    Article  Google Scholar 

  • Glover F, Laguna M (1997) Tabu Search. Kluwer, Massachusetts

    Book  Google Scholar 

  • Golden BL, Raghavan S, Wasil EA (eds) (2008) The Vehicle Routing Problem: Latest Advances and New Challenges. Springer, New York

    Google Scholar 

  • Gómez A, Mariño R, Akhavan-Tabatabaei R, Medaglia AL, Mendoza JE (2016) On modeling stochastic travel and service times in vehicle routing. Transport Sci 50(2):627–641

    Article  Google Scholar 

  • Hoff A, Andersson H, Christiansen M, Hasle G, Løkketangen A (2010) Industrial aspects and literature survey: Fleet composition and routing. Comput Oper Res 37(12):2041–2061

    Article  Google Scholar 

  • Hooker JN, Ottosson G (2003) Logic-Benders decomposition. Math. Program 96(1):33–60

    Article  Google Scholar 

  • Koç C, Bektas T, Jabali O, Laporte G (2016) Thirty years of heterogeneous vehicle routing. Eur J Oper Res 249(1):1–21

    Article  Google Scholar 

  • Lamghari A, Dimitrakopoulos R (2016) Progressive hedging applied as a metaheuristic to schedule production in open-pit mines accounting for reserve uncertainty. Eur J Oper Res 253(3):843–855

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Liu FH, Shen SY (1999a) A method for vehicle routing problem with multiple vehicle types and times windows. Proc Natl Sci Counc Repub China, Part A: Phys Sci Eng 23(4):526–536

    Google Scholar 

  • Liu FH, Shen SY (1999b) The fleet size and mix routing problem with time windows. J Oper Res Soc 50(7):721–732

    Article  Google Scholar 

  • Prescott-Gagnon E, Desaulniers G, Rousseau LM (2009) A Branch-and-Price-Based Large Neighborhood Search Algorithm for the Vehicle Routing Problem with Time Windows. Networks 54(4):190–204

    Article  Google Scholar 

  • Quddus MA, Hossain NUI, Mohammad M, Jaradat RM, Roni MS (2017) Sustainable network design for multi-purpose pellet processing depots under biomass supply uncertainty. Comput Ind Eng 110:462–483

    Article  Google Scholar 

  • Rockafellar RT, Wets RJB (1991) Scenarios and Policy Aggregation in Optimization under Uncertainty. Math Oper Res 16(1):119–147

    Article  Google Scholar 

  • Russell RA, Urban TL (2008) Vehicle routing with soft time windows and erlang travel times. J Oper Res Soc 59(9):1220–1228

    Article  Google Scholar 

  • Salani M, Battarra M (2018) The opportunity cost of time window violations. EURO J Transp Logist 7(4):343–361

    Article  Google Scholar 

  • Salhi S, Rand GK (1989) The effect of ignoring routes when locating depots. Eur J Oper Res 39(2):150–156

    Article  Google Scholar 

  • Schneider M, Schwahn F, Vigo D (2017) Designing granular solution methods for routing problems with time windows. Eur J Oper Res 263(2):493–509

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Susilawati S, Taylor MAP, Somenahalli SVC (2013) Distributions of travel time variability on urban roads. J Adv Transport 47(8):720–736

    Article  Google Scholar 

  • Tadikamalla PR (1980) A Look at the Burr and Related Distributions. Int Stat Rev 48(3):337–344

    Article  Google Scholar 

  • Taillard ÉD (1999) A heuristic column generation method for the heterogeneous fleet VRP. RAIRO 33(1):1–14

    Article  Google Scholar 

  • Taş D, Dellaert N, Van Woensel T, de Kok AG (2013) Vehicle routing problem with stochastic travel times including soft time windows and service costs. Comput Oper Res 40(1):214–224

    Article  Google Scholar 

  • Taş D, Dellaert N, Van Woensel T, de Kok AG (2014a) The time-dependent vehicle routing problem with soft time windows and stochastic travel times. Transport Res C-Emer 48:66–83

    Article  Google Scholar 

  • Taş D, Gendreau M, Dellaert N, Van Woensel T, de Kok AG (2014b) Vehicle routing with soft time windows and stochastic travel times: A column generation and branch-and-price solution approach. Eur J Oper Res 236(3):789–799

    Article  Google Scholar 

  • Taş D, Jabali O, Van Woensel T (2014c) A vehicle routing problem with flexible time windows. Comput Oper Res 52:39–54

    Article  Google Scholar 

  • Taylor MAP (2017) Fosgerau’s travel time reliability ratio and the Burr distribution. Transport Res B-Meth 97:50–63

    Article  Google Scholar 

  • Teodorović D, Krcmar-Nozic E, Pavkovic G (1995) The mixed fleet stochastic vehicle routing problem. Transport Plan Techn 19(1):31–43

    Article  Google Scholar 

  • Thompson R, Taniguchi E, Yamada T (2011) Estimating the benefits of considering travel time variability in urban distribution. Transp Res Record 2238(1):86–96

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Toth P, Vigo D (eds) (2014) Vehicle Routing: Problems, Methods, and Applications, 2nd edn. SIAM, Philadelphia

    Google Scholar 

  • Wang Z, Lin WH (2017) Incorporating travel time uncertainty into the design of service regions for delivery/pickup problems with time windows. Exp Syst Appl 72(15):207–220

    Article  Google Scholar 

  • Zhang J, Lam WH, Chen BY (2013) A stochastic vehicle routing problem with travel time uncertainty: trade-off between cost and customer service. Netw Spat Econ 13(4):471–496

    Article  Google Scholar 

Download references

Acknowledgements

This research was funded by the Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq-Brazil, grants 141064/2015-3 and 305577/2014-0) and the Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP-Brazil, grants 2016/01860-1 and 2016/06566-4). We are grateful for the valuable suggestions made by the editor and referees.

Author information

Authors and Affiliations

  1. Faculdade de Engenharia Elétrica e de Computação, Universidade Estadual de Campinas, SP, 13083-852, Campinas, Brazil

    Ramon Faganello Fachini & Vinícius Amaral Armentano

  2. Instituto de Ciências Matemáticas e de Computação, Universidade de São Paulo, SP, 13560-970, São Carlos, Brazil

    Franklina Maria Bragion Toledo

Authors
  1. Ramon Faganello Fachini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vinícius Amaral Armentano
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Franklina Maria Bragion Toledo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ramon Faganello Fachini.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Supplementary Information

Below is the link to the electronic supplementary material.

Supplementary file1 (PDF 768 KB)

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Fachini, R.F., Armentano, V.A. & Toledo, F.M.B. A Granular Local Search Matheuristic for a Heterogeneous Fleet Vehicle Routing Problem with Stochastic Travel Times. Netw Spat Econ 22, 33–64 (2022). https://doi.org/10.1007/s11067-021-09553-6

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11067-021-09553-6

Keywords

Search

Navigation