IDEAS home Printed from https://ideas.repec.org/a/eee/transa/v137y2020icp429-446.html
   My bibliography  Save this article

A metaheuristic for the time-dependent vehicle routing problem considering driving hours regulations – An application in city logistics

Author

Listed:
  • Rincon-Garcia, Nicolas
  • Waterson, Ben
  • Cherrett, Tom J.
  • Salazar-Arrieta, Fernando

Abstract

New retail trends show the increasing importance of providing cost efficient deliveries in cities, where congestion and compliance with driving hours regulations should be incorporated into routing software. This paper introduces a large neighbourhood search algorithm that substantially improves the benchmark solutions (in terms of the number of vehicles required, travel distance and duty time) for the vehicle routing problem variant considering time windows, time-dependent travel times and driving hours regulations (EC) 561/2006 that apply to vehicles over 3.5 tons in European cities. Additionally, instances for The Road Transport (Working Time) Regulation 2005 that applies to drivers in the United Kingdom are introduced. The proposed algorithm is also used in scenarios that represent home delivery conditions to evaluate the impacts of the length of time windows, customer density, congestion and regulations in terms of cost and environmental impact.

Suggested Citation

  • Rincon-Garcia, Nicolas & Waterson, Ben & Cherrett, Tom J. & Salazar-Arrieta, Fernando, 2020. "A metaheuristic for the time-dependent vehicle routing problem considering driving hours regulations – An application in city logistics," Transportation Research Part A: Policy and Practice, Elsevier, vol. 137(C), pages 429-446.
    • Handle: RePEc:eee:transa:v:137:y:2020:i:c:p:429-446
    DOI: 10.1016/j.tra.2018.10.033
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0965856417311503
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.tra.2018.10.033?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. David Pisinger & Stefan Ropke, 2010. "Large Neighborhood Search," International Series in Operations Research & Management Science, in: Michel Gendreau & Jean-Yves Potvin (ed.), Handbook of Metaheuristics, chapter 0, pages 399-419, Springer.
    2. Stefan Ropke & David Pisinger, 2006. "An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows," Transportation Science, INFORMS, vol. 40(4), pages 455-472, November.
    3. G. B. Dantzig & J. H. Ramser, 1959. "The Truck Dispatching Problem," Management Science, INFORMS, vol. 6(1), pages 80-91, October.
    4. ,, 2004. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 20(2), pages 427-429, April.
    5. ,, 2004. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 20(1), pages 223-229, February.
    6. Asvin Goel, 2009. "Vehicle Scheduling and Routing with Drivers' Working Hours," Transportation Science, INFORMS, vol. 43(1), pages 17-26, February.
    7. Said Dabia & Stefan Ropke & Tom van Woensel & Ton De Kok, 2013. "Branch and Price for the Time-Dependent Vehicle Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 47(3), pages 380-396, August.
    8. Bernhard Fleischmann & Martin Gietz & Stefan Gnutzmann, 2004. "Time-Varying Travel Times in Vehicle Routing," Transportation Science, INFORMS, vol. 38(2), pages 160-173, May.
    9. K Harwood & C Mumford & R Eglese, 2013. "Investigating the use of metaheuristics for solving single vehicle routing problems with time-varying traversal costs," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 64(1), pages 34-47, January.
    10. Vidal, Thibaut & Crainic, Teodor Gabriel & Gendreau, Michel & Prins, Christian, 2014. "A unified solution framework for multi-attribute vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 234(3), pages 658-673.
    11. Chryssi Malandraki & Mark S. Daskin, 1992. "Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms," Transportation Science, INFORMS, vol. 26(3), pages 185-200, August.
    12. W Dullaert & G K Janssens & K Sörensen & B Vernimmen, 2002. "New heuristics for the Fleet Size and Mix Vehicle Routing Problem with Time Windows," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 53(11), pages 1232-1238, November.
    13. Andres Figliozzi, Miguel, 2012. "The time dependent vehicle routing problem with time windows: Benchmark problems, an efficient solution algorithm, and solution characteristics," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(3), pages 616-636.
    14. Donati, Alberto V. & Montemanni, Roberto & Casagrande, Norman & Rizzoli, Andrea E. & Gambardella, Luca M., 2008. "Time dependent vehicle routing problem with a multi ant colony system," European Journal of Operational Research, Elsevier, vol. 185(3), pages 1174-1191, March.
    15. Eric Prescott-Gagnon & Guy Desaulniers & Michael Drexl & Louis-Martin Rousseau, 2010. "European Driver Rules in Vehicle Routing with Time Windows," Transportation Science, INFORMS, vol. 44(4), pages 455-473, November.
    16. Ichoua, Soumia & Gendreau, Michel & Potvin, Jean-Yves, 2003. "Vehicle dispatching with time-dependent travel times," European Journal of Operational Research, Elsevier, vol. 144(2), pages 379-396, January.
    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. Jan Fabian Ehmke, 2012. "Routing in City Logistics," International Series in Operations Research & Management Science, in: Integration of Information and Optimization Models for Routing in City Logistics, edition 127, chapter 0, pages 119-156, Springer.
    19. Roel Gevaers & Eddy Van de Voorde & Thierry Vanelslander, 2011. "Characteristics and Typology of Last-mile Logistics from an Innovation Perspective in an Urban Context," Chapters, in: Cathy Macharis & Sandra Melo (ed.), City Distribution and Urban Freight Transport, chapter 3, Edward Elgar Publishing.
    20. J-F Cordeau & M Gendreau & G Laporte & J-Y Potvin & F Semet, 2002. "A guide to vehicle routing heuristics," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 53(5), pages 512-522, May.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Dhirendra Prajapati & M. Manoj Kumar & Saurabh Pratap & H. Chelladurai & Mohd Zuhair, 2021. "Sustainable Logistics Network Design for Delivery Operations with Time Horizons in B2B E-Commerce Platform," Logistics, MDPI, vol. 5(3), pages 1-13, September.
    2. Guo, Feng & Wei, Qu & Wang, Miao & Guo, Zhaoxia & Wallace, Stein W., 2023. "Deep attention models with dimension-reduction and gate mechanisms for solving practical time-dependent vehicle routing problems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 173(C).
    3. Ezzatollah Asgharizadeh & Sobhan Jooybar & Hannan Amoozad Mahdiraji & Jose Arturo Garza-Reyes, 2022. "A Novel Travel Time Estimation Model for Modeling a Green Time-Dependent Vehicle Routing Problem in Food Supply Chain," Sustainability, MDPI, vol. 14(14), pages 1-16, July.
    4. Vasco Silva & António Amaral & Tânia Fontes, 2023. "Sustainable Urban Last-Mile Logistics: A Systematic Literature Review," Sustainability, MDPI, vol. 15(3), pages 1-27, January.
    5. Liu, Yiming & Roberto, Baldacci & Zhou, Jianwen & Yu, Yang & Zhang, Yu & Sun, Wei, 2023. "Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 310(1), pages 133-155.
    6. Schmidt, Carise E. & Silva, Arinei C.L. & Darvish, Maryam & Coelho, Leandro C., 2023. "Time-dependent fleet size and mix multi-depot vehicle routing problem," International Journal of Production Economics, Elsevier, vol. 255(C).
    7. Touzout, Faycal A. & Ladier, Anne-Laure & Hadj-Hamou, Khaled, 2022. "An assign-and-route matheuristic for the time-dependent inventory routing problem," European Journal of Operational Research, Elsevier, vol. 300(3), pages 1081-1097.

    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. 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.
    2. Vidal, Thibaut & Crainic, Teodor Gabriel & Gendreau, Michel & Prins, Christian, 2013. "Heuristics for multi-attribute vehicle routing problems: A survey and synthesis," European Journal of Operational Research, Elsevier, vol. 231(1), pages 1-21.
    3. Verbeeck, C. & Vansteenwegen, P. & Aghezzaf, E.-H., 2016. "Solving the stochastic time-dependent orienteering problem with time windows," European Journal of Operational Research, Elsevier, vol. 255(3), pages 699-718.
    4. Liu, Yiming & Roberto, Baldacci & Zhou, Jianwen & Yu, Yang & Zhang, Yu & Sun, Wei, 2023. "Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 310(1), pages 133-155.
    5. Pan, Binbin & Zhang, Zhenzhen & Lim, Andrew, 2021. "Multi-trip time-dependent vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 291(1), pages 218-231.
    6. Rifki, Omar & Chiabaut, Nicolas & Solnon, Christine, 2020. "On the impact of spatio-temporal granularity of traffic conditions on the quality of pickup and delivery optimal tours," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
    7. Lu, Jiawei & Nie, Qinghui & Mahmoudi, Monirehalsadat & Ou, Jishun & Li, Chongnan & Zhou, Xuesong Simon, 2022. "Rich arc routing problem in city logistics: Models and solution algorithms using a fluid queue-based time-dependent travel time representation," Transportation Research Part B: Methodological, Elsevier, vol. 166(C), pages 143-182.
    8. Andres Figliozzi, Miguel, 2012. "The time dependent vehicle routing problem with time windows: Benchmark problems, an efficient solution algorithm, and solution characteristics," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(3), pages 616-636.
    9. Avraham, Edison & Raviv, Tal, 2020. "The data-driven time-dependent traveling salesperson problem," Transportation Research Part B: Methodological, Elsevier, vol. 134(C), pages 25-40.
    10. Gmira, Maha & Gendreau, Michel & Lodi, Andrea & Potvin, Jean-Yves, 2021. "Tabu search for the time-dependent vehicle routing problem with time windows on a road network," European Journal of Operational Research, Elsevier, vol. 288(1), pages 129-140.
    11. Verbeeck, C. & Sörensen, K. & Aghezzaf, E.-H. & Vansteenwegen, P., 2014. "A fast solution method for the time-dependent orienteering problem," European Journal of Operational Research, Elsevier, vol. 236(2), pages 419-432.
    12. Sun, Peng & Veelenturf, Lucas P. & Hewitt, Mike & Van Woensel, Tom, 2020. "Adaptive large neighborhood search for the time-dependent profitable pickup and delivery problem with time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 138(C).
    13. Diego Cattaruzza & Nabil Absi & Dominique Feillet & Jesús González-Feliu, 2017. "Vehicle routing problems for city logistics," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(1), pages 51-79, March.
    14. Schmidt, Carise E. & Silva, Arinei C.L. & Darvish, Maryam & Coelho, Leandro C., 2023. "Time-dependent fleet size and mix multi-depot vehicle routing problem," International Journal of Production Economics, Elsevier, vol. 255(C).
    15. Ehmke, Jan Fabian & Campbell, Ann Melissa, 2014. "Customer acceptance mechanisms for home deliveries in metropolitan areas," European Journal of Operational Research, Elsevier, vol. 233(1), pages 193-207.
    16. Soriano, Adria & Gansterer, Margaretha & Hartl, Richard F., 2023. "The multi-depot vehicle routing problem with profit fairness," International Journal of Production Economics, Elsevier, vol. 255(C).
    17. Xiao, Yiyong & Konak, Abdullah, 2016. "The heterogeneous green vehicle routing and scheduling problem with time-varying traffic congestion," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 88(C), pages 146-166.
    18. Kok, A.L. & Hans, E.W. & Schutten, J.M.J., 2011. "Optimizing departure times in vehicle routes," European Journal of Operational Research, Elsevier, vol. 210(3), pages 579-587, May.
    19. Hamza Ben Ticha & Nabil Absi & Dominique Feillet & Alain Quilliot & Tom Woensel, 2021. "The Time-Dependent Vehicle Routing Problem with Time Windows and Road-Network Information," SN Operations Research Forum, Springer, vol. 2(1), pages 1-25, March.
    20. M. Alinaghian & M. Ghazanfari & N. Norouzi & H. Nouralizadeh, 2017. "A Novel Model for the Time Dependent Competitive Vehicle Routing Problem: Modified Random Topology Particle Swarm Optimization," Networks and Spatial Economics, Springer, vol. 17(4), pages 1185-1211, December.

    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:eee:transa:v:137:y:2020:i:c:p:429-446. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/547/description#description .

    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.