Accelerating strategies in column generation methods for vehicle routing and crew scheduling problems

Operations Research/ Computer Science Interfaces Series

Volumn 15, Issue , 2002, Pages 309-324

  Desaulniers, Guy ^a   Desrosiers, Jacques ^b   Solomon, Marius M ^c  

^a ÉCOLE POLYTECHNIQUE DE MONTRÉAL   (Canada)

^b HEC MONTRÉAL   (Canada)

^c NORTHEASTERN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84888782730     PISSN: 1387666X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-1-4615-1507-4     Document Type: Article

References (40)

1. R.K. Ahuja, T. Magnanti, and J.B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, 1993.
2. C. Barnhart, L. Hatay, and E.L. Johnson. Deadhead Selection for the LongHaul Crew Pairing Problem. Operations Research, 43:491-499, 1995.
3. C. Barnhart, E.L. Johnson, G.L. Nemhauser, M.W.P. Savelsbergh, and P.H. Vance. Branch-and-Price: Column Generation for Solving Huge Integer Programs. Operations Research, 46:316-329, 1998.
4. A. Caprara, M. Fischetti, and P. Toth. A Heuristic Algorithm for the Set Covering Problem. Lecture Notes in Computer Science, 1084:72-84, 1996.
5. J.-F. Cordeau, G. Desaulniers, N. Lingaya, F. Soumis, and J. Desrosiers. Simultaneous Locomotive and Car Assignment at VIA Rail Canada. Les Cahiers du GERAD, G-98-61, Montreal, 1998.
6. T.-G. Crainic and J.-M. Rousseau. The Column Generation Principle and the Airline Crew Scheduling Problem. INFOR, 25:136-151, 1987.
7. G.B. Dantzig and P. Wolfe. Decomposition Principle for Linear Programs. Operations Research, 8:101-111, 1960.
8. G. Desaulniers, J. Desrosiers, Y. Dumas, S. Marc, B. Rioux, M.M. Solomon, and F. Soumis. Crew Pairing at Air France. European Journal of Operational Research, 97:245-259, 1997.
9. G. Desaulniers, J. Desrosiers, I. Ioachim, M.M. Solomon, F. Soumis, and D. Villeneuve. A Unified Framework for Deterministic Time Constrained Vehicle Routing and Crew Scheduling Problems. In: Fleet Management and Logistics, T.G. Crainic and G. Laporte, editors, pages 57-93, Kluwer, 1998.
10. G. Desaulniers, J. Desrosiers, M.M. Solomon, and F. Soumis. Daily Aircraft Routing and Scheduling. Management Science, 43:841-855, 1997.
11. G. Desaulniers, J. Lavigne, and F. Soumis. Multi-Depot Vehicle Scheduling Problems with Time Windows and Waiting Costs. European Journal of Operational Research, 111:479-494, 1998.
12. G. Desaulniers, J. Desrosiers, A. Lasry, and M. M. Solomon. Crew Pairing for a Regional Carrier. Lecture Notes in Economics and Mathematical Systems, 471:19-41, 1999.
13. M. Desrochers and F. Soumis. A Reoptimization Algorithm for the Shortest Path Problem with Time Windows. European Journal of Operational Research, 35:242-254, 1988.
14. M. Desrochers and F. Soumis. A Column Generation Approach to the Urban Transit Crew Scheduling Problem. Transportation Science, 23:1-13,1989.
15. M. Desrochers, J. Desrosiers, and M.M. Solomon. A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows. Operations Research, 40:342-354, 1992.
16. J. Desrosiers, Y. Dumas, M.M. Solomon, and F. Soumis. Time Constrained Routing and Scheduling. In: Network Routing, M.O. Ball, T.L. Magnanti, C.L. Monma, and G.L. Nemhauser, editors, Handbooks in Operations Research and Management Science, vol. 8, pages 35-139, Elsevier, 1995.
17. J. Desrosiers, Y. Dumas, and F. Soumis. The Multiple Vehicle Dial-a-Ride Problem. Lecture Notes in Economics and Mathematical Systems, 308:15-27,1988.
18. J. Desrosiers, F. Soumis, and M. Desrochers. Routing with Time Windows by Column Generation. Networks, 14:545-565, 1984.
19. M. Dror. Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW. Operations Research, 42:977-978, 1994.
20. Y. Dumas, J. Desrosiers, and F. Soumis. The Pickup and Delivery Problem with Time Windows. European Journal of Operational Research, 54:7-22, 1991.
21. O. du Merle, D. Villeneuve, J. Desrosiers, and P. Hansen. Stabilized Column Generation. Discrete Mathematics, 194:229-237,1999.
22. L.R. Ford, and D.R. Fulkerson. A Suggested Computation for Maximal Multi-commodity Network Flows. Management Science, 5:97-101, 1958.
23. M. Gamache and F. Soumis. A Method for Optimally Solving the Rostering Problem. In: Operations Research in the Airline Industry, G. Yu, editor, pages 124-157, Kluwer, 1998.
24. M. Gamache, F. Soumis, G. Marquis, and J. Desrosiers. A Column Generation Approach for Large Scale Aircrew Rostering Problems. Operations Research, 47:247-263, 1999.
25. A.M. Geoffrion. Lagrangean Relaxation for Integer Programming. Mathematical Programming Studies, 2:82-114, 1974.
26. P.C. Gilmore and R.E. Gomory. A Linear Programming Approach to the Cutting-Stock Problem. Operations Research, 9:849-859, 1961.
27. J.-L. Goffin and J.-P. Vial. Multiple Cuts in the Analytic Center Cutting Plane Method. SIAM Journal on Optimization, 11:266-288, 2000.
28. C. Hane, C. Barnhart, E.L. Johnson, R. Marsten, G.L. Nemhauser, and G. Sigismondi. The Fleet Assignment Problem: Solving a Large-Scale Integer Program. Mathematical Programming, 70:211-232,1995.
29. K.L. Hoffman and M. Padberg. Solving Airline Crew Scheduling Problems by Branch-and-Cut. Management Science, 39:657-682, 1993.
30. I. Ioachim, J. Desrosiers, Y. Dumas, M.M. Solomon, and Daniel Villeneuve. A Request Clustering Algorithm for Door-to-Door Handicapped Transportation. Transportation Science, 29:63-79, 1995.
31. 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:101-116, 1999.
32. N. Kohl and O.B.G. Madsen. An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation. Operations Research, 45:395-406, 1997.
33. A.W.J. Kolen, A.H.G. Rinnooy Kan, and H.W.J.M. Trienekens. Vehicle Routing with Time Windows. Operations Research, 35:266-273, 1987.
34. N. Lingaya, J.-F. Cordeau, G. Desaulniers, J. Desrosiers, and F. Soumis. Operational Car Assignment at VIA Rail Canada. Les Cahiers du GERAD, G-2000-55, Montreal, 2000.
35. A. Mingozzi, M.A. Boschetti, S. Ricciardelli, and L. Bianco. A Set Partitioning Approach to the Crew Scheduling Problem. Operations Research, 47:873-888, 1999.
36. C. Ribeiro and F. Soumis. A Column Generation Approach to the Multiple Depot Vehicle Scheduling Problem. Operations Research, 42:41-53, 1994.
37. J.M. Rousseau and J. Desrosiers. Results Obtained with CREW-OPT, a Column Generation Method for Transit Crew Scheduling. Lecture Notes in Economics and Mathematical Systems, 430:349-358, 1995.
38. M.M. Solomon. Algorithms for the Vehicle Routing and Scheduling Problem with Time Window Constraints. Operations Research, 35:254-265, 1987.
39. K. Ziarati, F. Soumis, J. Desrosiers, S. Gelinas, and A. Saintonge. Locomotive Assignment with Heterogeneous Consists at CN North America. European Journal of Operational Research, 97:281-292, 1997.
40. K. Ziarati, J. Desrosiers, F. Soumis, and M.M. Solomon. A Branch-First, Cut-Second Approach for Locomotive Assignment. Management Science, 45:1156-1168, 1999.