Scipediacontent: Scipediacontent moved page Draft Content 583756478 to Kok et al 2008a

2021-01-25T16:49:37Z

Scipediacontent moved page Draft Content 583756478 to Kok et al 2008a

Scipediacontent: Created page with " == Abstract == Most solution methods for the vehicle routing problem with time windows (VRPTW) develop routes from the earliest feasible departure time. However, in practice..."

2021-01-25T16:49:35Z

Created page with " == Abstract == Most solution methods for the vehicle routing problem with time windows (VRPTW) develop routes from the earliest feasible departure time. However, in practice..."

New page

== Abstract ==

Most solution methods for the vehicle routing problem with time windows (VRPTW) develop routes from the earliest feasible departure time. However, in practice, temporal traffic congestions make that such solutions are not optimal with respect to minimizing the total duty time. Furthermore, VRPTW solutions do not account for complex driving hours regulations, which severely restrict the daily travel time available for a truck driver. To deal with these problems, we consider the vehicle departure time optimization (VDO) problem as a post-processing step of solving a VRPTW. We propose an ILP-formulation that minimizes the total duty time. The obtained solutions are feasible with respect to driving hours regulations and they account for temporal traffic congestions by modeling time-dependent travel times. For the latter, we assume a piecewise constant speed function. Computational experiments show that problem instances of realistic sizes can be solved to optimality within practical computation times. Furthermore, duty time reductions of 8 percent can be achieved. Finally, the results show that ignoring time-dependent travel times and driving hours regulations during the development of vehicle routes leads to many infeasible vehicle routes. Therefore, vehicle routing methods should account for these real-life restrictions.

== Original document ==

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

* [http://dx.doi.org/10.1016/j.ejor.2010.10.017 http://dx.doi.org/10.1016/j.ejor.2010.10.017]

* [https://research.utwente.nl/en/publications/optimizing-departure-times-in-vehicle-routes(52a3f6f2-ae83-4e20-a1c9-d70de0081d89).html https://research.utwente.nl/en/publications/optimizing-departure-times-in-vehicle-routes(52a3f6f2-ae83-4e20-a1c9-d70de0081d89).html]

* [https://research.utwente.nl/en/publications/optimizing-departure-times-in-vehicle-routes(c62b5381-e90c-497d-aceb-01dc15017720).html https://research.utwente.nl/en/publications/optimizing-departure-times-in-vehicle-routes(c62b5381-e90c-497d-aceb-01dc15017720).html]

* [https://ris.utwente.nl/ws/files/6669147/optiminzing.pdf https://ris.utwente.nl/ws/files/6669147/optiminzing.pdf]

* [https://api.elsevier.com/content/article/PII:S0377221710006582?httpAccept=text/xml https://api.elsevier.com/content/article/PII:S0377221710006582?httpAccept=text/xml],
: [https://api.elsevier.com/content/article/PII:S0377221710006582?httpAccept=text/plain https://api.elsevier.com/content/article/PII:S0377221710006582?httpAccept=text/plain],
: [http://dx.doi.org/10.1016/j.ejor.2010.10.017 http://dx.doi.org/10.1016/j.ejor.2010.10.017] under the license https://www.elsevier.com/tdm/userlicense/1.0/

* [https://pure.tue.nl/ws/files/4420177/633446.pdf https://pure.tue.nl/ws/files/4420177/633446.pdf],
: [https://www.sciencedirect.com/science/article/pii/S0377221710006582 https://www.sciencedirect.com/science/article/pii/S0377221710006582],
: [https://research.utwente.nl/en/publications/optimizing-departure-times-in-vehicle-routes https://research.utwente.nl/en/publications/optimizing-departure-times-in-vehicle-routes],
: [https://www.narcis.nl/publication/RecordID/oai%3Aris.utwente.nl%3Apublications%2Fc62b5381-e90c-497d-aceb-01dc15017720 https://www.narcis.nl/publication/RecordID/oai%3Aris.utwente.nl%3Apublications%2Fc62b5381-e90c-497d-aceb-01dc15017720],
: [https://core.ac.uk/display/11480153 https://core.ac.uk/display/11480153],
: [https://ideas.repec.org/a/eee/ejores/v210y2011i3p579-587.html https://ideas.repec.org/a/eee/ejores/v210y2011i3p579-587.html],
: [https://dblp.uni-trier.de/db/journals/eor/eor210.html#KokHS11 https://dblp.uni-trier.de/db/journals/eor/eor210.html#KokHS11],
: [https://ris.utwente.nl/ws/files/6669147/optiminzing.pdf https://ris.utwente.nl/ws/files/6669147/optiminzing.pdf],
: [https://doi.org/10.1016/j.ejor.2010.10.017 https://doi.org/10.1016/j.ejor.2010.10.017],
: [http://alexandria.tue.nl/repository/books/633446.pdf http://alexandria.tue.nl/repository/books/633446.pdf],
: [https://EconPapers.repec.org/RePEc:eee:ejores:v:210:y:2011:i:3:p:579-587 https://EconPapers.repec.org/RePEc:eee:ejores:v:210:y:2011:i:3:p:579-587],
: [https://academic.microsoft.com/#/detail/2166488815 https://academic.microsoft.com/#/detail/2166488815]

← Older revision	Revision as of 16:49, 25 January 2021
(No difference)

Kok et al 2008a - Revision history

Scipediacontent: Scipediacontent moved page Draft Content 583756478 to Kok et al 2008a

Scipediacontent: Created page with " == Abstract == Most solution methods for the vehicle routing problem with time windows (VRPTW) develop routes from the earliest feasible departure time. However, in practice..."