IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v210y2011i3p579-587.html
   My bibliography  Save this article

Optimizing departure times in vehicle routes

Author

Listed:
  • Kok, A.L.
  • Hans, E.W.
  • Schutten, J.M.J.

Abstract

Most solution methods for the vehicle routing problem with time windows (VRPTW) develop routes from the earliest feasible departure time. In practice, however, temporary traffic congestion make such solutions non-optimal with respect to minimizing the total duty time. Furthermore, the VRPTW does not account for driving hours regulations, which restrict the available travel time for truck drivers. To deal with these problems, we consider the vehicle departure time optimization (VDO) problem as a post-processing of a VRPTW. We propose an ILP formulation that minimizes the total duty time. The results of a case study indicate that duty time reductions of 15% can be achieved. Furthermore, computational experiments on VRPTW benchmarks indicate that ignoring traffic congestion or driving hours regulations leads to practically infeasible solutions. Therefore, new vehicle routing methods should be developed that account for these common restrictions. We propose an integrated approach based on classical insertion heuristics.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:210:y:2011:i:3:p:579-587
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(10)00658-2
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Van Woensel, T. & Kerbache, L. & Peremans, H. & Vandaele, N., 2008. "Vehicle routing with dynamic travel times: A queueing approach," European Journal of Operational Research, Elsevier, vol. 186(3), pages 990-1007, May.
    2. A. L. Kok & C. M. Meyer & H. Kopfer & J. M. J. Schutten, 2010. "A Dynamic Programming Heuristic for the Vehicle Routing Problem with Time Windows and European Community Social Legislation," Transportation Science, INFORMS, vol. 44(4), pages 442-454, November.
    3. Asvin Goel, 2009. "Vehicle Scheduling and Routing with Drivers' Working Hours," Transportation Science, INFORMS, vol. 43(1), pages 17-26, February.
    4. Bernhard Fleischmann & Martin Gietz & Stefan Gnutzmann, 2004. "Time-Varying Travel Times in Vehicle Routing," Transportation Science, INFORMS, vol. 38(2), pages 160-173, May.
    5. 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.
    6. 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.
    7. 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.
    8. Laoucine Kerbache & T. van Woensel & N. Vandaele & Herbert Peremans, 2008. "Vehicle routing with dynamic travel times: A queueing approach," Post-Print hal-00465127, HAL.
    9. Hong, Sung-Chul & Park, Yang-Byung, 1999. "A heuristic for bi-objective vehicle routing with time window constraints," International Journal of Production Economics, Elsevier, vol. 62(3), pages 249-258, September.
    10. Li, Haibing & Lim, Andrew, 2003. "Local search with annealing-like restarts to solve the VRPTW," European Journal of Operational Research, Elsevier, vol. 150(1), pages 115-127, October.
    11. Claudia Archetti & Martin Savelsbergh, 2009. "The Trip Scheduling Problem," Transportation Science, INFORMS, vol. 43(4), pages 417-431, November.
    12. Martin W. P. Savelsbergh, 1992. "The Vehicle Routing Problem with Time Windows: Minimizing Route Duration," INFORMS Journal on Computing, INFORMS, vol. 4(2), pages 146-154, May.
    13. Hang Xu & Zhi-Long Chen & Srinivas Rajagopal & Sundar Arunapuram, 2003. "Solving a Practical Pickup and Delivery Problem," Transportation Science, INFORMS, vol. 37(3), pages 347-364, August.
    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. Visser, T.R. & Spliet, R., 2017. "Efficient Move Evaluations for Time-Dependent Vehicle Routing Problems," Econometric Institute Research Papers EI2017-23, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    2. Bernhardt, A. & Melo, Teresa & Bousonville, Thomas & Kopfer, Herbert, 2016. "Scheduling of driver activities with multiple soft time windows considering European regulations on rest periods and breaks," Technical Reports on Logistics of the Saarland Business School 12, Saarland University of Applied Sciences (htw saar), Saarland Business School.
    3. Pilz, Danny & Schwerdfeger, Stefan & Boysen, Nils, 2022. "Make or break: Coordinated assignment of parking space for breaks and rest periods in long-haul trucking," Transportation Research Part B: Methodological, Elsevier, vol. 164(C), pages 45-64.
    4. Gilbert Laporte, 2016. "Scheduling issues in vehicle routing," Annals of Operations Research, Springer, vol. 236(2), pages 463-474, January.
    5. Stehbeck, Florian, 2019. "Designing and Scheduling Cost-Efficient Tours by Using the Concept of Truck Platooning," Junior Management Science (JUMS), Junior Management Science e. V., vol. 4(4), pages 566-634.
    6. 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.
    7. Koç, Çağrı & Bektaş, Tolga & Jabali, Ola & Laporte, Gilbert, 2016. "A comparison of three idling options in long-haul truck scheduling," Transportation Research Part B: Methodological, Elsevier, vol. 93(PA), pages 631-647.
    8. Sartori, Carlo S. & Smet, Pieter & Vanden Berghe, Greet, 2022. "Scheduling truck drivers with interdependent routes under European Union regulations," European Journal of Operational Research, Elsevier, vol. 298(1), pages 76-88.
    9. Perugia, Alessandro & Moccia, Luigi & Cordeau, Jean-François & Laporte, Gilbert, 2011. "Designing a home-to-work bus service in a metropolitan area," Transportation Research Part B: Methodological, Elsevier, vol. 45(10), pages 1710-1726.
    10. Asvin Goel & Thibaut Vidal & Adrianus Leendert Kok, 2021. "To team up or not: single versus team driving in European road freight transport," Flexible Services and Manufacturing Journal, Springer, vol. 33(4), pages 879-913, December.
    11. Lecluyse, Christophe & Sörensen, Kenneth & Peremans, Herbert, 2013. "A network-consistent time-dependent travel time layer for routing optimization problems," European Journal of Operational Research, Elsevier, vol. 226(3), pages 395-413.
    12. Gilbert Laporte, 2016. "Scheduling issues in vehicle routing," Annals of Operations Research, Springer, vol. 236(2), pages 463-474, January.
    13. Fleming, Christopher L. & Griffis, Stanley E. & Bell, John E., 2013. "The effects of triangle inequality on the vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 224(1), pages 1-7.
    14. Thomas R. Visser & Remy Spliet, 2020. "Efficient Move Evaluations for Time-Dependent Vehicle Routing Problems," Transportation Science, INFORMS, vol. 54(4), pages 1091-1112, July.
    15. Vital, Filipe & Ioannou, Petros, 2022. "Optimizing Fuel Consumption and Pollutant Emissions in Truck Routing with Parking Availability Prediction and Working Hours Constraints," Institute of Transportation Studies, Working Paper Series qt8rw99523, Institute of Transportation Studies, UC Davis.
    16. Marie-Eve Rancourt & Jean-François Cordeau & Gilbert Laporte, 2013. "Long-Haul Vehicle Routing and Scheduling with Working Hour Rules," Transportation Science, INFORMS, vol. 47(1), pages 81-107, February.
    17. Wang, Xuping & Ruan, Junhu & Shi, Yan, 2012. "A recovery model for combinational disruptions in logistics delivery: Considering the real-world participators," International Journal of Production Economics, Elsevier, vol. 140(1), pages 508-520.
    18. Maximilian Schiffer & Michael Schneider & Grit Walther & Gilbert Laporte, 2019. "Vehicle Routing and Location Routing with Intermediate Stops: A Review," Transportation Science, INFORMS, vol. 53(2), pages 319-343, March.
    19. Vital, Filipe & Ioannou, Petros, 2021. "Scheduling and shortest path for trucks with working hours and parking availability constraints," Transportation Research Part B: Methodological, Elsevier, vol. 148(C), pages 1-37.
    20. Pottel, Steffen & Goel, Asvin, 2022. "Scheduling activities with time-dependent durations and resource consumptions," European Journal of Operational Research, Elsevier, vol. 301(2), pages 445-457.

    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. 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.
    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. 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.
    4. W Maden & R Eglese & D Black, 2010. "Vehicle routing and scheduling with time-varying data: A case study," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(3), pages 515-522, March.
    5. 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.
    6. Asvin Goel & Thibaut Vidal, 2014. "Hours of Service Regulations in Road Freight Transport: An Optimization-Based International Assessment," Transportation Science, INFORMS, vol. 48(3), pages 391-412, August.
    7. Ostermeier, Manuel, 2024. "The supply of convenience stores: Challenges of short-distance routing within the constraints of working time regulations," European Journal of Operational Research, Elsevier, vol. 314(3), pages 997-1012.
    8. Gilbert Laporte, 2016. "Scheduling issues in vehicle routing," Annals of Operations Research, Springer, vol. 236(2), pages 463-474, January.
    9. 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.
    10. 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.
    11. 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.
    12. Tilk, Christian & Goel, Asvin, 2020. "Bidirectional labeling for solving vehicle routing and truck driver scheduling problems," European Journal of Operational Research, Elsevier, vol. 283(1), pages 108-124.
    13. 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).
    14. Lecluyse, Christophe & Sörensen, Kenneth & Peremans, Herbert, 2013. "A network-consistent time-dependent travel time layer for routing optimization problems," European Journal of Operational Research, Elsevier, vol. 226(3), pages 395-413.
    15. Gilbert Laporte, 2016. "Scheduling issues in vehicle routing," Annals of Operations Research, Springer, vol. 236(2), pages 463-474, January.
    16. 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.
    17. 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.
    18. Marie-Eve Rancourt & Jean-François Cordeau & Gilbert Laporte, 2013. "Long-Haul Vehicle Routing and Scheduling with Working Hour Rules," Transportation Science, INFORMS, vol. 47(1), pages 81-107, February.
    19. Sun, Peng & Veelenturf, Lucas P. & Hewitt, Mike & Van Woensel, Tom, 2018. "The time-dependent pickup and delivery problem with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 116(C), pages 1-24.
    20. Sun, Peng & Veelenturf, Lucas P. & Dabia, Said & Van Woensel, Tom, 2018. "The time-dependent capacitated profitable tour problem with time windows and precedence constraints," European Journal of Operational Research, Elsevier, vol. 264(3), pages 1058-1073.

    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:ejores:v:210:y:2011:i:3:p:579-587. 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/locate/eor .

    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.