A dynamic programming heuristic for vehicle routing with time-dependent travel times and required breaks


== Abstract ==

For the intensively studied vehicle routing problem (VRP), two real-life restrictions have received only minor attention in the VRP-literature: traffic congestion and driving hours regulations. Traffic congestion causes late arrivals at customers and long travel times resulting in large transport costs. To account for traffic congestion, time-dependent travel times should be considered when constructing vehicle routes. Next, driving hours regulations, which restrict the available driving and working times for truck drivers, must be respected. Since violations are severely fined, also driving hours regulations should be considered when constructing vehicle routes, even more in combination with congestion problems. The objective of this paper is to develop a solution method for the VRP with time windows (VRPTW), time-dependent travel times, and driving hours regulations. The major difficulty of this VRPTW extension is to optimize each vehicle’s departure times to minimize the duty time of each driver. Having compact duty times leads to cost savings. However, obtaining compact duty times is much harder when time-dependent travel times and driving hours regulations are considered. We propose a restricted dynamic programming (DP) heuristic for constructing the vehicle routes, and an efficient heuristic for optimizing the vehicle’s departure times for each (partial) vehicle route, such that the complete solution algorithm runs in polynomial time. Computational experiments demonstrate the trade-off between travel distance minimization and duty time minimization, and illustrate the cost savings of extending the depot opening hours such that traveling before the morning peak and after the evening peak becomes possible.


== Original document ==

The different versions of the original document can be found in:

* [http://dx.doi.org/10.1007/s10696-011-9077-4 http://dx.doi.org/10.1007/s10696-011-9077-4] under the license https://creativecommons.org/licenses/by-nc

* [https://link.springer.com/content/pdf/10.1007%2Fs10696-011-9077-4.pdf https://link.springer.com/content/pdf/10.1007%2Fs10696-011-9077-4.pdf]

* [https://research.utwente.nl/en/publications/a-dynamic-programming-heuristic-for-vehicle-routing-with-timedependent-travel-times-and-required-breaks(a6d449a0-eca2-4676-b77d-fad98569e77d).html https://research.utwente.nl/en/publications/a-dynamic-programming-heuristic-for-vehicle-routing-with-timedependent-travel-times-and-required-breaks(a6d449a0-eca2-4676-b77d-fad98569e77d).html] under the license cc-by-nc

* [http://www.springerlink.com/index/pdf/10.1007/s10696-011-9077-4 http://www.springerlink.com/index/pdf/10.1007/s10696-011-9077-4],
: [http://dx.doi.org/10.1007/s10696-011-9077-4 http://dx.doi.org/10.1007/s10696-011-9077-4]

* [https://link.springer.com/content/pdf/10.1007%2Fs10696-011-9077-4.pdf https://link.springer.com/content/pdf/10.1007%2Fs10696-011-9077-4.pdf],
: [https://link.springer.com/article/10.1007%2Fs10696-011-9077-4 https://link.springer.com/article/10.1007%2Fs10696-011-9077-4],
: [https://core.ac.uk/display/92158160 https://core.ac.uk/display/92158160],
: [https://research.utwente.nl/en/publications/a-dynamic-programming-heuristic-for-vehicle-routing-with-time-dep https://research.utwente.nl/en/publications/a-dynamic-programming-heuristic-for-vehicle-routing-with-time-dep],
: [https://paperity.org/p/11120673/a-dynamic-programming-heuristic-for-vehicle-routing-with-time-dependent-travel-times-and https://paperity.org/p/11120673/a-dynamic-programming-heuristic-for-vehicle-routing-with-time-dependent-travel-times-and],
: [https://ris.utwente.nl/ws/files/6595871/dynamic.pdf https://ris.utwente.nl/ws/files/6595871/dynamic.pdf],
: [https://www.narcis.nl/publication/RecordID/oai%3Aris.utwente.nl%3Apublications%2Fa6d449a0-eca2-4676-b77d-fad98569e77d https://www.narcis.nl/publication/RecordID/oai%3Aris.utwente.nl%3Apublications%2Fa6d449a0-eca2-4676-b77d-fad98569e77d],
: [https://academic.microsoft.com/#/detail/2121781850 https://academic.microsoft.com/#/detail/2121781850]