Hybrid column generation approaches for urban transit crew management problems

Transportation Science

Volumn 39, Issue 2, 2005, Pages 273-288

  Yunes, Tallys H ^a   Moura, Arnaldo V ^a   de Souza, Cid C ^a  

^a UNIVERSITY OF CAMPINAS   (Brazil)

Author keywords

Column generation; Constraint programming; Crew scheduling; Hybrid algorithms; Public transportation

Indexed keywords

ALGORITHMS; BUS TRANSPORTATION; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; LOGIC PROGRAMMING; MATHEMATICAL PROGRAMMING; SCHEDULING; TRANSPORTATION PERSONNEL;

COLUMN GENERATION; CONSTRAINT PROGRAMMING; CREW MANAGEMENT PROBLEM; CREW ROSTERING; CREW SCHEDULING; PUBLIC TRANSPORTATION;

OPERATIONS RESEARCH;

EID: 19944404260     PISSN: 00411655     EISSN: None     Source Type: Journal    
DOI: 10.1287/trsc.1030.0078     Document Type: Article

References (35)

1. Barnhart, C., E. L. Johnson, G. L. Nemhauser, M. W. P. Savelsbergh, P. H. Vance. 1998. Branch-and-price: Column generation for solving huge integer programs. Oper. Res. 46(3) 316-329.
2. Bianco, L., M. Bielli, A. Mingozzi, S. Ricciardelli, M. Spandoni. 1992. A heuristic procedure for the crew rostering problem. Eur. J. Oper. Res. 58(2) 272-283.
3. Caprara, A., M. Fischetti, P. Toth. 1999. A heuristic method for the set covering problem. Oper. Res. 47(5) 730-743.
4. Caprara, A., M. Fischetti, P. Toth, D. Vigo. 1998. Modeling and solving the crew rostering problem. Oper. Res. 46(6) 820-830.
5. Caprara, A., M. Fischetti, P. Toth, D. Vigo, P. L. Guida. 1997. Algorithms for railway crew management. Math. Programming 79 125-141.
6. Caprara, A., F. Focacci, E. Lamma, P. Mello, M. Milano, P. Toth D. Vigo. 1998. Integrating constraint logic programming and operations research techniques for the crew rostering problem. Software Practice Experience 28(1) 49-76.
7. Carraresi, P., G. Gallo. 1984. A multi-level bottleneck assignment approach to the bus drivers' rostering problem. Eur. J. Oper. Res. 16(2) 163-173.
8. Caseau, Y., P. Koppstein. 1992. A rule-based approach to a time-constrained traveling salesman problem. 2nd Internat. Sympos. Artificial Intelligence Math.
9. Chabrier, A. 1999. A cooperative CP and LP optimizer approach for the pairing generation problem. Internat. Workshop Integration AI & OR Tech. Constraint Programming Combinatorial Optim. Problems (CP-AI-OR'99), Ferrara, Italy.
10. Cheng, B. M. W., K. M. F. Choi, J. H. M. Lee, J. C. K. Wu. 1999. Increasing constraint propagation by redundant modeling: An experience report. Constraints 4(2) 167-182.
11. Cormen, T. H., C. E. Leiserson, R. L. Rivest. 1990. Introduction to Algorithms. MIT Press, Cambridge, MA.
12. Crainic, T. G., G. Laporte, eds. 1998. Fleet Management and Logistics. Kluwer Academic Publishers, Boston, MA.
13. Darby-Dowman, K., J. Little. 1998. Properties of some combinatorial optimization problems and their effect on the performance of integer programming and constraint logic programming. INFORMS J. Comput. 10(3) 276-286.
14. Desrochers, M., F. Soumis. 1989. A column generation approach to the urban transit crew scheduling problem. Transportation Sci. 23 (1) 1-13.
15. Dror, M., ed. 2000. Arc Routing: Theory, Solutions and Applications. Kluwer Academic Publishers, Boston, MA.
16. Fahle, T., M. Sellmann. 2000. Constraint programming based column generation with knapsack subproblems. 2nd Internat. Workshop Integration AI & OR Tech. Constraint Programming Combinatorial Optim. Problems (CP-AI-OR'00), Paderborn, Germany.
17. Gervet, C. 1998. Large combinatorial optimization problems: A methodology for hybrid models and solutions. Journées Francophones de Programmation en Logique et par Contraintes, Nantes, France.
18. Ginsberg, M. L. 1993. Dynamic backtracking. J. Artificial Intelligence Res. 1 25-46.
19. Grötschel, M., A. Martin, R. Weismantel. 1996. Packing Steiner trees: A cutting plane algorithm and computational results. Math. Programming 72 125-145.
20. Guerinik, N., M. V. Caneghem. 1995. Solving crew scheduling problems by constraint programming. Lecture Notes Comput. Sci. 976 481-498. 1st Internat. Conf. Principles Practice Constraint Programming, CP'95, Cassis, France.
21. e Constraint Logic Programming System, Ver. 5.1.3. http://www.icparc.ic.ac.uk/eclipse.
22. ILOG S. A. 1999. ILOG CPLEX 6.5 Reference Manual.
23. Jachnik, J. K. 1981. Attendance and rostering system. Computer Scheduling of Public Transport. A. Wren, ed. North-Holland Publishing Company, Amsterdam, The Netherlands, 337-343.
24. Jourdan, J. 1995. Concurrent constraint multiple models in CLP and CC languages: Toward a programming methodology by modeling. Doctoral dissertation, Université Denis Diderot, Paris VII, France.
25. Junker, U., S. Karisch, N. Kohl, B. Vaaben. 1999a. Constraint programming based column generation for crew assignment. Internat. Workshop Integration AI OR Tech. Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR'99), Ferrara, Italy.
26. Junker, U., S. Karisch, N. Kohl, B. Vaaben, T. Fahle, M. Sellmann. 1999b. A framework for constraint programming based column generation. Lecture Notes Comput. Sci. 1713 261-274. 5th Internat. Conf. Principles Practice Constraint Programming (CP'99), Alexandria, VA.
27. Leconte, M., P. Couronne, D. Vergamini. 1996. Column generation using cooperating constraint-based solvers. Workshop on Constraints and Constraint Programming, Asian Computing Sci. Conf. (Asian'96), Singapore.
28. Lever, J., M. Wallace, B. Richards. 1995. Constraint logic programming for scheduling and planning. British Telecom Tech. J. 13 73-81.
29. OREAS GmbH. 1999. ABACUS: A Branch-And-CUt System, Ver. 2.3. User's Guide and Reference Manual.
30. Reeves, C. R., ed. 1993. Modern Heuristic Techniques for Combinatorial Problems. Wiley, New York.
31. Sellmann, M., K. Zervoudakis, P. Stamatopoulos, T. Fahle. 2000. Integrating direct CP search and CP-based column generation for the airline crew assignment problem. 2nd Internat. Workshop Integration AI & OR Techniques Constraint Programming Combinatorial Optim. Problems (CP-AI-OR'00), Paderborn, Germany.
32. Uchôa, E., M. Poggi de Aragão. 1999. Vertex-disjoint packing of two Steiner trees: Polyhedra and branch-and-cut. Lecture Notes Comput. Sci. 1610 439-452. 7th Internat. Conf. Integer Programming Combinatorial Optim. (IPCO'99), Graz, Austria.
33. Yunes, T. H., A. V. Moura, C. C. de Souza. 1999. Exact solutions for real world crew scheduling problems. INFORMS Fall 1999 Meeting, Philadelphia, PA.
34. Yunes, T. H., A. V. Moura, C. C. de Souza. 2000a. A hybrid approach for solving large scale crew scheduling problems. Lecture Notes Comput. Sci. 1753 293-307. 2nd Internat. Workshop Practical Aspects Declarative Languages (PADL'00), Boston, MA.
35. Yunes, T. H., A. V. Moura, C. C. de Souza. 2000b. Hybrid column generation approaches for solving real world crew management problems. Technical Report 00-18, Institute of Computing, University of Campinas (UNICAMP). Campinas, SP, Brazil. http://goa.pos.ic.unicamp.br/otimo/ pubtexts/rt-00-18.ps.gz.