Name
Abstract | ||
|---|---|---|
n this paper, we propose a reformulation and a Branch-and-price (BP) algorithm for the Vehicle Routing Problem with Cross-Docking (VRPCD). Our computational results indicate that the reformulation provides bounds much stronger than network flow bounds from previous studies. As a consequence, when BP and a Linear Programming based Branch-and-bound (LPBB) method (that relies on the network flow formulation) are run for the same restricted time limit, BP clearly dominates LPBB in terms of the quality of lower and upper bounds found during the search. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1016/j.endm.2011.05.043 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
Combinatorial Optimization,Vehicle Routing,Column Generation | Flow network,Mathematical optimization,Column generation,Vehicle routing problem,Branch and price,Algorithm,Combinatorial optimization,Linear programming,Time limit,Cross-docking,Mathematics | Journal |
Volume | ISSN | Citations |
37 | 1571-0653 | 13 |
PageRank | References | Authors |
0.57 | 5 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Fernando Afonso Santos | 1 | 63 | 3.00 |
| Geraldo Robson Mateus | 2 | 413 | 42.30 |
| Alexandre Salles da Cunha | 3 | 242 | 22.32 |