Lagrangian duality applied to the vehicle routing problem with time windows

Computers and Operations Research

Volumn 33, Issue 5, 2006, Pages 1464-1487

  Kallehauge, Brian ^a   Larsen, Jesper ^a   Madsen, Oli B G ^a  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; PROBLEM SOLVING; RELAXATION PROCESSES;

CONSTRAINT SET; LAGRANGIAN DUALITY; LAGRANGIAN RELAXATION; VEHICLE ROUTING PROBLEM;

LAGRANGE MULTIPLIERS;

EID: 26444602999     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2004.11.002     Document Type: Article

References (34)

1. N. Ascheuer, M. Fischetti, and M. Grötschel Solving the asymmetric travelling salesman problem with time windows by branch-and-cut Mathematical Programming 90 3 2001 475 506
2. D. Naddef, and G. Rinaldi Branch-and-cut algorithms for the capacitated VRP P. Toth D. Vigo The vehicle routing problem, SIAM monographs on discrete mathematics and applications 2002 SIAM Philadelphia 49 78
3. M. Savelsbergh Local search in routing problems with time windows Annals of Operations Research 4 1985 285 305
4. J.F. Cordeau, G. Desaulniers, J. Desrosiers, M.M. Solomon, and F. Soumis VRP with time windows P. Toth D. Vigo The vehicle routing problem, SIAM monographs on discrete mathematics and applications 2002 SIAM Philadelphia 157 193
5. M. Desrochers, J. Desrosiers, and M. Solomon A new optimization algorithm for the vehicle routing problem with time windows Operations Research 40 1992 342 354
6. N. Kohl, and O.B.G. Madsen An optimization algorithm for the vehicle routing problem with time windows based on Lagrangean relaxation Operations Research 45 1997 395 406
7. M. Dror Note on the complexity of the shortest path models for column generation in VRPTW Operations Research 42 1994 977 978
8. M.L. Fisher The Lagrangian relaxation method for solving integer programming problems Management Science 27 1981 1 18
9. J.B. Hiriart-Urruty, and C. Lemaréchal Convex analysis and minimization algorithms I-II Grundlehren der Matematischen Wissenschaften 1993 Springer Berlin, Heidelberg 304 305
10. N. Kohl, J. Desrosiers, O.B.G. Madsen, M.M. Solomon, and F. Soumis 2-path cuts for the vehicle routing problem with time windows Transportation Science 33 1999 101 116
11. Cook W, Rich JL. A parallel cutting-plane algorithm for the vehicle routing problem with time windows. Technical report, Rice University; 1999.
12. Irnich S, Villeneuve D. The shortest path problem with k-cycle elimination (k ≥ 3 ): improving a branch-and-price algorithm for the VRPTW. Technical report, Lehr- und Forschungsgebiet Operations Research und Logistik Management, Rheinisch-Westfälische Technische Hochschule; 2003.
13. Feillet D, Dejax P, Gendreau M, Gueguen C. An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems. Technical report, Laboratoire d'Informatique d'Avignon, Université d'Avignon; 2004.
14. Chabrier A. Vehicle routing problem with elementary shortest path based column generation. Technical report, ILOG; 2003.
15. J.E. Kelley The cutting-plane method for solving convex programs Journal of SIAM 8 1960 703 712
16. E.W. Cheney, and A.A. Goldstein Newton's method for convex programming and tchebycheff approximation Numerische Mathematik 1 1959 253 268
17. G.B. Dantzig, and P. Wolfe A decomposition principle for linear programs Operations Research 8 1960 101 111
18. O. duMerle, D. Villeneuve, J. Desrosiers, and P. Hansen Stabilized column generation Discrete Mathematics 194 1999 229 237
19. M.M. Solomon Algorithms for the vehicle routing and scheduling problems with time window constraints Operations Research 35 1987 254 265
20. H. Gehring, and J. Homberger A parallel two-phase metaheuristic for routing problems with time windows Asia-Pacific Journal of Operational Research 18 2001 35 47
21. G.L. Nemhauser, and L.A. Wolsey Integer and combinatorial optimization 1988 Wiley New York
22. P. Neame, N. Boland, and D. Ralph An outer approximate subdifferential method for piecewise affine optimization Mathematical Programming 87 2000 57 86
23. M. Desrochers, and F. Soumis A generalized permanent labelling algorithm for the shortest path problem with time windows INFOR 26 1988 191 211
24. Desrochers M. An algorithm for the shortest path problem with resource constraints. Technical report, GERAD; 1988.
25. D.J. Houck, J.C. Picard, M. Queyranne, and R.R. Vemuganti The travelling salesman problem as a constrained shortest path problem theory and computational experience OPSEARCH 17 1980 93 109
26. Larsen J. Parallelization of the vehicle routing problem with time windows. PhD thesis, Department of Mathematical Modelling, Technical University of Denmark; 1999.
27. V. Chvátal Linear programming 1983 W.H. Freeman and Company New York
28. R.E. Griffith, and R.A. Stewart A nonlinear programming technique for the optimization of continuous processing systems Management Science 7 1961 379 392
29. K. Madsen An algorithm for minimax solution of overdetermined systems of non-linear equations Journal of the Institute of Mathematics and its Applications 16 1975 321 328
30. R.E. Marsten, W.W. Hogan, and J.W. Blankenship The BOXSTEP method for large-scale optimization Operations Research 23 1975 389 405
31. K. Levenberg A method for the solution of certain problems in least squares Quarterly Applied Mathematics 2 1944 164 168
32. D. Marquardt An algorithm for least squares estimation of nonlinear parameters SIAM Journal of Applied Mathematics 11 1963 431 441
33. M. Jünger, and S. Thienel The ABACUS system for branch-and-cut-and- price algorithms in integer programming and combinatorial optimization Software Practice and Experience 30 11 2000 1325 1352
34. Kohl N. Exact methods for time constrained routing and related scheduling problems. PhD thesis, Department of Mathematical Modelling, Technical University of Denmark; 1995.