Home > Research > Publications & Outputs > Pricing routines for vehicle routing with time ...

Electronic data

  • pricing-time-windows

    Rights statement: The final, definitive version of this article has been published in the Journal, Computers & Operations Research 51, 2014, © ELSEVIER.

    Accepted author manuscript, 360 KB, PDF document

Links

Text available via DOI:

View graph of relations

Pricing routines for vehicle routing with time windows on road networks

Research output: Contribution to journalJournal articlepeer-review

Published
<mark>Journal publication date</mark>11/2014
<mark>Journal</mark>Computers and Operations Research
Volume51
Number of pages7
Pages (from-to)331-337
Publication StatusPublished
<mark>Original language</mark>English

Abstract

Several very effective exact algorithms have been developed for vehicle routing problems with time windows. Unfortunately, most of these algorithms cannot be applied to instances that are defined on road networks, because they implicitly assume that the cheapest path between two customers is equal to the quickest path. Garaix and coauthors proposed to tackle this issue by first storing alternative paths in an auxiliary multi-graph, and then using that multi-graph within a branch-and-price algorithm. We show that, if one works with the original road network rather than the multi-graph, then one can solve the pricing subproblem more quickly, in both theory and practice.

Bibliographic note

The final, definitive version of this article has been published in the Journal, Computers & Operations Research 51, 2014, © ELSEVIER.