Arcs-states models for the vehicle routing problem with time windows and related problems

Computers and Operations Research

Volumn 34, Issue 4, 2007, Pages 1061-1084

  Mautor, Thierry ^a   Naudin, Edith ^a,b  

^a LABORATOIRE DES SCIENCES DU CLIMAT ET DE L ENVIRONNEMENT   (France)

^b UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

Branch and bound method; Column and row generation; Vehicle routing problems

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; EMBEDDED SYSTEMS; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING;

BRANCH AND BOUND METHOD; COLUMN AND ROW GENERATION; VEHICLE ROUTING PROBLEMS;

OPERATIONS RESEARCH;

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

References (16)

1. Desrosiers J., Soumis F., and Desrochers M. Routing with time windows by column generation. Networks 14 (1984) 545-565
2. Dror M. Note on the complexity of the shortest path models for column generation in VRPTW. (Technical note.) Operations Research 42 5 (1994) 977-978
3. Desrochers M., and Soumis F. A generalised permanent labelling algorithm for the shortest path problem with time windows. INFOR 26 3 (1988) 191-212
4. Desrochers M., Desrosiers J., and Solomon M. A new optimisation for the vehicle routing with time windows. Operations Research 40 (1992) 342-354
5. Kohl N., Desrosiers J., Madsen O., Solomon M., and Soumis F. 2-path cuts for the vehicle routing problem with time windows. Transportation Science 33 (1999) 101-116
6. Irnich S, Villeneuve D. The shortest path problem with resources contraintes and k-cycle elimination for k ≥ 3. Les Cahiers du GERAD G-2003-55, Montréal, Canada; 2003.
7. Larsen J. Parallelization of the vehicle routing problem with time windows. Ph.D. thesis, Informatics and Mathematical Modelling, Technical University of Denmark, DTU, 1999.
8. Cook W, Rich JL. A parallel cutting-plane algorithm for the vehicle routing problem with time windows. Computational and Applied Mathematics 1999.
9. Kallehauge B, Larsen J, Madsen OBG. Lagrangean duality applied on vehicle routing with time windows-experimental results. Informatics and Mathematical Modelling, (IMM-TR-2001-9), 2001. Technical report.
10. Chabrier A, Danna É, Le Pape C. Coopération entre génération de colonnes avec tournées sans cycles et recherche locale appliquée au routage de véhicules. JNPC 2002.
11. Feillet D., Dejax P., Gendreau M., and Gueguen C. An exact algorithm for the elementary shortest path problem with resources contraints: application to some vehicle routing problems. Networks 3 44 (2004) 216-229
12. Solomon M.M. Algorithms for the vehicle routing and scheduling problem with time window constraints. Operations Research 35 (1987) 254-265
13. Valério de Carvalho J.M. Exact solution of bin-packing problems using column generation and branch-and-bound. Annals of Operations Research 86 629-59 (1999)
14. Gilmore P.C., and Gomory R.E. A linear programming approach to the cutting stock problem. Operations Research 9 (1960) 849-859
15. Mamer J.W., and McBride R.D. A decomposition-based pricing procedure for large-scale linear programs: an application to the linear multicommodity flow problem. Management Science 46 5 (2000) 693-709
16. Kohl N. Exact methods for time constrained routing and related scheduling problem. Ph.D. thesis, Institute of Mathematical Modeling, Technical University of Denmark, 1995. Ph.D. Dissertation n16, DK-2800 Lyngby, Denmark.