Scipediacontent: Scipediacontent moved page Draft Content 132889619 to Ropke et al 2013a

2021-02-16T09:11:13Z

Scipediacontent moved page Draft Content 132889619 to Ropke et al 2013a

Scipediacontent: Created page with " == Abstract == This paper presents a branch-and-price algorithm for the time-dependent vehicle routing problem with time windows (TDVRPTW). We capture road congestion by con..."

2021-02-16T09:11:09Z

Created page with " == Abstract == This paper presents a branch-and-price algorithm for the time-dependent vehicle routing problem with time windows (TDVRPTW). We capture road congestion by con..."

New page

== Abstract ==

This paper presents a branch-and-price algorithm for the time-dependent vehicle routing problem with time windows (TDVRPTW). We capture road congestion by considering time-dependent travel times, i.e., depending on the departure time to a customer, a different travel time is incurred. We consider the variant of the TDVRPTW where the objective is to minimize total route duration and denote this variant the duration minimizing TDVRPTW (DM-TDVRPTW). Because of time dependency, vehicles' dispatch times at the depot are crucial as road congestion might be avoided. Because of its complexity, all known solution methods to the DM-TDVRPTW are based on (meta-)heuristics. The decomposition of an arc-based formulation leads to a set-partitioning problem as the master problem, and a time-dependent shortest path problem with resource constraints as the pricing problem. The master problem is solved by means of column generation, and a tailored labeling algorithm is used to solve the pricing problem. We introduce new dominance criteria that allow more label dominance. For our numerical results, we modified Solomon's data sets by adding time dependency. Our algorithm is able to solve about 63% of the instances with 25 customers, 38% of the instances with 50 customers, and 15% of the instances with 100 customers.

== Original document ==

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

* [http://dx.doi.org/10.1287/trsc.1120.0445 http://dx.doi.org/10.1287/trsc.1120.0445]

* [https://research.tue.nl/nl/publications/branch-and-price-for-the-timedependent-vehicle-routing-problem-with-time-windows(3e4b31c3-ae4c-4e75-9678-b673b0ab5923).html https://research.tue.nl/nl/publications/branch-and-price-for-the-timedependent-vehicle-routing-problem-with-time-windows(3e4b31c3-ae4c-4e75-9678-b673b0ab5923).html]

* [https://pubsonline.informs.org/doi/abs/10.1287/trsc.1120.0445 https://pubsonline.informs.org/doi/abs/10.1287/trsc.1120.0445],
: [https://pure.tue.nl/ws/files/3636053/905058079249446.pdf https://pure.tue.nl/ws/files/3636053/905058079249446.pdf],
: [https://orbit.dtu.dk/en/publications/branch-and-price-for-the-time-dependent-vehicle-routing-problem-w https://orbit.dtu.dk/en/publications/branch-and-price-for-the-time-dependent-vehicle-routing-problem-w],
: [https://trid.trb.org/view/1262574 https://trid.trb.org/view/1262574],
: [https://www.narcis.nl/publication/RecordID/oai%3Aresearch.vu.nl%3Apublications%2F03df2dd6-fe02-4c9a-9863-da494f5401c3 https://www.narcis.nl/publication/RecordID/oai%3Aresearch.vu.nl%3Apublications%2F03df2dd6-fe02-4c9a-9863-da494f5401c3],
: [https://ideas.repec.org/a/inm/ortrsc/v47y2013i3p380-396.html https://ideas.repec.org/a/inm/ortrsc/v47y2013i3p380-396.html],
: [https://research.vu.nl/en/publications/branch-and-price-for-the-time-dependent-vehicle-routing-problem-w https://research.vu.nl/en/publications/branch-and-price-for-the-time-dependent-vehicle-routing-problem-w],
: [https://research.tue.nl/nl/publications/branch-and-cut-and-price-for-the-time-dependent-vehicle-routing-p https://research.tue.nl/nl/publications/branch-and-cut-and-price-for-the-time-dependent-vehicle-routing-p],
: [https://dblp.uni-trier.de/db/journals/transci/transci47.html#DabiaRWK13 https://dblp.uni-trier.de/db/journals/transci/transci47.html#DabiaRWK13],
: [https://EconPapers.repec.org/RePEc:inm:ortrsc:v:47:y:2013:i:3:p:380-396 https://EconPapers.repec.org/RePEc:inm:ortrsc:v:47:y:2013:i:3:p:380-396],
: [https://doi.org/10.1287/trsc.1120.0445 https://doi.org/10.1287/trsc.1120.0445],
: [http://purl.tue.nl/905058079249446.pdf http://purl.tue.nl/905058079249446.pdf],
: [https://core.ac.uk/display/91266805 https://core.ac.uk/display/91266805],
: [https://academic.microsoft.com/#/detail/2161796540 https://academic.microsoft.com/#/detail/2161796540]

* [https://pubsonline.informs.org/doi/pdf/10.1287/trsc.1120.0445 https://pubsonline.informs.org/doi/pdf/10.1287/trsc.1120.0445],
: [http://dx.doi.org/10.1287/trsc.1120.0445 http://dx.doi.org/10.1287/trsc.1120.0445]

← Older revision	Revision as of 09:11, 16 February 2021
(No difference)

Ropke et al 2013a - Revision history

Scipediacontent: Scipediacontent moved page Draft Content 132889619 to Ropke et al 2013a

Scipediacontent: Created page with " == Abstract == This paper presents a branch-and-price algorithm for the time-dependent vehicle routing problem with time windows (TDVRPTW). We capture road congestion by con..."