Pricing routines for vehicle routing with time windows on road networks

Adam N. Letchford, Saeideh D. Nasiri, Amar Oukil

Research output: Contribution to journalArticle

13 Citations (Scopus)

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 co-authors 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.

Original languageEnglish
Pages (from-to)331-337
Number of pages7
JournalComputers and Operations Research
Volume51
DOIs
Publication statusPublished - 2014

Keywords

  • Bi-criteria shortest paths
  • Combinatorial optimization
  • Vehicle routing

ASJC Scopus subject areas

  • Computer Science(all)
  • Management Science and Operations Research
  • Modelling and Simulation

Fingerprint Dive into the research topics of 'Pricing routines for vehicle routing with time windows on road networks'. Together they form a unique fingerprint.

  • Cite this