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/11
Y1 - 2014/11
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
AN - SCOPUS:84904867922
SN - 0305-0548
VL - 51
SP - 331
EP - 337
JO - Computers and Operations Research
JF - Computers and Operations Research
ER -