Pricing routines for vehicle routing with time windows on road networks

Letchford, Adam and Nasiri, Saeideh D. and Oukil, Amar (2014) Pricing routines for vehicle routing with time windows on road networks. Computers and Operations Research, 51. pp. 331-337. ISSN 0305-0548

[thumbnail of pricing-time-windows]
PDF (pricing-time-windows)
pricing_time_windows.pdf - Accepted Version

Download (368kB)


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.

Item Type:
Journal Article
Journal or Publication Title:
Computers and Operations Research
Additional Information:
The final, definitive version of this article has been published in the Journal, Computers & Operations Research 51, 2014, © ELSEVIER.
Uncontrolled Keywords:
?? vehicle routingcombinatorial optimisationbi-criteria shortest pathsmodelling and simulationmanagement science and operations researchcomputer science(all)discipline-based research ??
ID Code:
Deposited By:
Deposited On:
17 Sep 2014 16:01
Last Modified:
16 Jun 2024 00:15