Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows

This paper presents a branch-and-cut-and-price algorithm for the vehicle-routing problem with time windows. The standard Dantzig-Wolfe decomposition of the arc flow formulation leads to a set-partitioning problem as the master problem and an elementary shortest-path problem with resource constraints...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Operations research Ročník 56; číslo 2; s. 497 - 511
Hlavní autoři:	Jepsen, Mads, Petersen, Bjorn, Spoorendonk, Simon, Pisinger, David
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Linthicum, MD INFORMS 01.03.2008 Institute for Operations Research and the Management Sciences
Témata:	Algorithms Analysis Applied sciences Branch & bound algorithms Exact sciences and technology integer Integer programming Integers Logistics Operational research and scientific management Operational research. Management science Polynomials Product labeling programming Routing Studies Time windows Traffic congestion Traffic flow Transportation Vehicle capacity vehicle routing Vehicles Vertices United States Lower bound Fleet Vehicle routing problem Shortest path Dominance Routing Set partitioning Cut generation Integer programming Time window Branch and cut method Resource constraint Pricing transportation: vehicle routing Objective function programming: integer
ISSN:	0030-364X, 1526-5463
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!