IDEAS home Printed from https://ideas.repec.org/a/kap/netspa/v22y2022i1d10.1007_s11067-021-09553-6.html
   My bibliography  Save this article

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

Author

Listed:
  • Ramon Faganello Fachini

    (Universidade Estadual de Campinas)

  • Vinícius Amaral Armentano

    (Universidade Estadual de Campinas)

  • Franklina Maria Bragion Toledo

    (Instituto de Ciências Matemáticas e de Computação, Universidade de São Paulo)

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.

Suggested Citation

  • Ramon Faganello Fachini & Vinícius Amaral Armentano & Franklina Maria Bragion Toledo, 2022. "A Granular Local Search Matheuristic for a Heterogeneous Fleet Vehicle Routing Problem with Stochastic Travel Times," Networks and Spatial Economics, Springer, vol. 22(1), pages 33-64, March.
    • Handle: RePEc:kap:netspa:v:22:y:2022:i:1:d:10.1007_s11067-021-09553-6
    DOI: 10.1007/s11067-021-09553-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11067-021-09553-6
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s11067-021-09553-6?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Naoki Ando & Eiichi Taniguchi, 2006. "Travel Time Reliability in Vehicle Routing and Scheduling with Time Windows," Networks and Spatial Economics, Springer, vol. 6(3), pages 293-311, September.
    2. Andrés Gómez & Ricardo Mariño & Raha Akhavan-Tabatabaei & Andrés L. Medaglia & Jorge E. Mendoza, 2016. "On Modeling Stochastic Travel and Service Times in Vehicle Routing," Transportation Science, INFORMS, vol. 50(2), pages 627-641, May.
    3. Crainic, Teodor Gabriel & Gobbato, Luca & Perboli, Guido & Rei, Walter, 2016. "Logistics capacity planning: A stochastic bin packing formulation and a progressive hedging meta-heuristic," European Journal of Operational Research, Elsevier, vol. 253(2), pages 404-417.
    4. G. B. Dantzig & J. H. Ramser, 1959. "The Truck Dispatching Problem," Management Science, INFORMS, vol. 6(1), pages 80-91, October.
    5. R. T. Rockafellar & Roger J.-B. Wets, 1991. "Scenarios and Policy Aggregation in Optimization Under Uncertainty," Mathematics of Operations Research, INFORMS, vol. 16(1), pages 119-147, February.
    6. R A Russell & T L Urban, 2008. "Vehicle routing with soft time windows and Erlang travel times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(9), pages 1220-1228, September.
    7. Li, Xiangyong & Tian, Peng & Leung, Stephen C.H., 2010. "Vehicle routing problems with time windows and stochastic travel and service times: Models and algorithm," International Journal of Production Economics, Elsevier, vol. 125(1), pages 137-145, May.
    8. Salhi, Said & Rand, Graham K., 1989. "The effect of ignoring routes when locating depots," European Journal of Operational Research, Elsevier, vol. 39(2), pages 150-156, March.
    9. Schneider, Michael & Schwahn, Fabian & Vigo, Daniele, 2017. "Designing granular solution methods for routing problems with time windows," European Journal of Operational Research, Elsevier, vol. 263(2), pages 493-509.
    10. Matteo Salani & Maria Battarra, 2018. "The opportunity cost of time window violations," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 7(4), pages 343-361, December.
    11. Mehdi Firouzi & Javid Jouzdani & Hadi Shirouyehzad & Mohammad Mahdi Paydar, 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, Inderscience Enterprises Ltd, vol. 30(3), pages 386-405.
    12. Paolo Toth & Daniele Vigo, 2003. "The Granular Tabu Search and Its Application to the Vehicle-Routing Problem," INFORMS Journal on Computing, INFORMS, vol. 15(4), pages 333-346, November.
    13. Junlong Zhang & William Lam & Bi Chen, 2013. "A Stochastic Vehicle Routing Problem with Travel Time Uncertainty: Trade-Off Between Cost and Customer Service," Networks and Spatial Economics, Springer, vol. 13(4), pages 471-496, December.
    14. Michel Gendreau & Ola Jabali & Walter Rei, 2016. "50th Anniversary Invited Article—Future Research Directions in Stochastic Vehicle Routing," Transportation Science, INFORMS, vol. 50(4), pages 1163-1173, November.
    15. Egon Balas & Neil Simonetti, 2001. "Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study," INFORMS Journal on Computing, INFORMS, vol. 13(1), pages 56-75, February.
    16. Lamghari, Amina & Dimitrakopoulos, Roussos, 2016. "Progressive hedging applied as a metaheuristic to schedule production in open-pit mines accounting for reserve uncertainty," European Journal of Operational Research, Elsevier, vol. 253(3), pages 843-855.
    17. Marius M. Solomon, 1987. "Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints," Operations Research, INFORMS, vol. 35(2), pages 254-265, April.
    18. Koç, Çağrı & Bektaş, Tolga & Jabali, Ola & Laporte, Gilbert, 2016. "Thirty years of heterogeneous vehicle routing," European Journal of Operational Research, Elsevier, vol. 249(1), pages 1-21.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Jorge Oyola & Halvard Arntzen & David L. Woodruff, 2017. "The stochastic vehicle routing problem, a literature review, Part II: solution methods," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(4), pages 349-388, December.
    2. Mojtaba Rajabi-Bahaabadi & Afshin Shariat-Mohaymany & Mohsen Babaei & Daniele Vigo, 2021. "Reliable vehicle routing problem in stochastic networks with correlated travel times," Operational Research, Springer, vol. 21(1), pages 299-330, March.
    3. Elgesem, Aurora Smith & Skogen, Eline Sophie & Wang, Xin & Fagerholt, Kjetil, 2018. "A traveling salesman problem with pickups and deliveries and stochastic travel times: An application from chemical shipping," European Journal of Operational Research, Elsevier, vol. 269(3), pages 844-859.
    4. Junlong Zhang & William Lam & Bi Chen, 2013. "A Stochastic Vehicle Routing Problem with Travel Time Uncertainty: Trade-Off Between Cost and Customer Service," Networks and Spatial Economics, Springer, vol. 13(4), pages 471-496, December.
    5. Anastasios D. Vareias & Panagiotis P. Repoussis & Panagiotis P. Repoussi, 2019. "Assessing Customer Service Reliability in Route Planning with Self-Imposed Time Windows and Stochastic Travel Times," Service Science, INFORMS, vol. 53(1), pages 256-281, February.
    6. Jorge Oyola & Halvard Arntzen & David L. Woodruff, 2018. "The stochastic vehicle routing problem, a literature review, part I: models," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 7(3), pages 193-221, September.
    7. Tomáš Režnar & Jan Martinovič & Kateřina Slaninová & Ekaterina Grakova & Vít Vondrák, 2017. "Probabilistic time-dependent vehicle routing problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 25(3), pages 545-560, September.
    8. Taş, D. & Gendreau, M. & Dellaert, N. & van Woensel, T. & de Kok, A.G., 2014. "Vehicle routing with soft time windows and stochastic travel times: A column generation and branch-and-price solution approach," European Journal of Operational Research, Elsevier, vol. 236(3), pages 789-799.
    9. Evers, Lanah & Barros, Ana Isabel & Monsuur, Herman & Wagelmans, Albert, 2014. "Online stochastic UAV mission planning with time windows and time-sensitive targets," European Journal of Operational Research, Elsevier, vol. 238(1), pages 348-362.
    10. Yu Zhang & Zhenzhen Zhang & Andrew Lim & Melvyn Sim, 2021. "Robust Data-Driven Vehicle Routing with Time Windows," Operations Research, INFORMS, vol. 69(2), pages 469-485, March.
    11. Alexandre M. Florio & Richard F. Hartl & Stefan Minner & Juan-José Salazar-González, 2021. "A Branch-and-Price Algorithm for the Vehicle Routing Problem with Stochastic Demands and Probabilistic Duration Constraints," Transportation Science, INFORMS, vol. 55(1), pages 122-138, 1-2.
    12. Biao Yuan & Ran Liu & Zhibin Jiang, 2015. "A branch-and-price algorithm for the home health care scheduling and routing problem with stochastic service times and skill requirements," International Journal of Production Research, Taylor & Francis Journals, vol. 53(24), pages 7450-7464, December.
    13. Seyedmehdi Mirmohammadsadeghi & Shamsuddin Ahmed, 2015. "Memetic Heuristic Approach for Solving Truck and Trailer Routing Problems with Stochastic Demands and Time Windows," Networks and Spatial Economics, Springer, vol. 15(4), pages 1093-1115, December.
    14. Nicolas Rincon-Garcia & Ben J. Waterson & Tom J. Cherrett, 2018. "Requirements from vehicle routing software: perspectives from literature, developers and the freight industry," Transport Reviews, Taylor & Francis Journals, vol. 38(1), pages 117-138, January.
    15. Pradhananga, Rojee & Taniguchi, Eiichi & Yamada, Tadashi & Qureshi, Ali Gul, 2014. "Bi-objective decision support system for routing and scheduling of hazardous materials," Socio-Economic Planning Sciences, Elsevier, vol. 48(2), pages 135-148.
    16. Rafael Dawid & David McMillan & Matthew Revie, 2018. "Decision Support Tool for Offshore Wind Farm Vessel Routing under Uncertainty," Energies, MDPI, vol. 11(9), pages 1-17, August.
    17. Hongtao Lei & Gilbert Laporte & Bo Guo, 2012. "A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 20(1), pages 99-118, April.
    18. Hoogeboom, Maaike & Dullaert, Wout, 2019. "Vehicle routing with arrival time diversification," European Journal of Operational Research, Elsevier, vol. 275(1), pages 93-107.
    19. Zhang, Jian & Woensel, Tom Van, 2023. "Dynamic vehicle routing with random requests: A literature review," International Journal of Production Economics, Elsevier, vol. 256(C).
    20. Maaike Hoogeboom & Yossiri Adulyasak & Wout Dullaert & Patrick Jaillet, 2021. "The Robust Vehicle Routing Problem with Time Window Assignments," Transportation Science, INFORMS, vol. 55(2), pages 395-413, March.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:kap:netspa:v:22:y:2022:i:1:d:10.1007_s11067-021-09553-6. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.