Pricing routines for vehicle routing with time windows on road networks

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

Research output: Contribution to journalArticle

10 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

Fingerprint

Vehicle Routing
Vehicle routing
Multigraph
Road Network
Time Windows
Pricing
Path
Branch-and-price
Vehicle Routing Problem with Time Windows
Costs
Exact Algorithms
Customers
Alternatives
Road network
Time windows
Graph

Keywords

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

ASJC Scopus subject areas

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

Cite this

Pricing routines for vehicle routing with time windows on road networks. / Letchford, Adam N.; Nasiri, Saeideh D.; Oukil, Amar.

In: Computers and Operations Research, Vol. 51, 2014, p. 331-337.

Research output: Contribution to journalArticle

Letchford, Adam N. ; Nasiri, Saeideh D. ; Oukil, Amar. / Pricing routines for vehicle routing with time windows on road networks. In: Computers and Operations Research. 2014 ; Vol. 51. pp. 331-337.
@article{d9aa21ec1763463586818ad0d9684fe2,
title = "Pricing routines for vehicle routing with time windows on road networks",
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.",
keywords = "Bi-criteria shortest paths, Combinatorial optimization, Vehicle routing",
author = "Letchford, {Adam N.} and Nasiri, {Saeideh D.} and Amar Oukil",
year = "2014",
doi = "10.1016/j.cor.2014.06.022",
language = "English",
volume = "51",
pages = "331--337",
journal = "Surveys in Operations Research and Management Science",
issn = "0305-0548",
publisher = "Elsevier Limited",

}

TY - JOUR

T1 - Pricing routines for vehicle routing with time windows on road networks

AU - Letchford, Adam N.

AU - Nasiri, Saeideh D.

AU - Oukil, Amar

PY - 2014

Y1 - 2014

N2 - 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.

AB - 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.

KW - Bi-criteria shortest paths

KW - Combinatorial optimization

KW - Vehicle routing

UR - http://www.scopus.com/inward/record.url?scp=84904867922&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84904867922&partnerID=8YFLogxK

U2 - 10.1016/j.cor.2014.06.022

DO - 10.1016/j.cor.2014.06.022

M3 - Article

VL - 51

SP - 331

EP - 337

JO - Surveys in Operations Research and Management Science

JF - Surveys in Operations Research and Management Science

SN - 0305-0548

ER -