Hybrid Column Generation Approaches for Urban Transit Crew Management Problems

Published Online:https://doi.org/10.1287/trsc.1030.0078

References

  • Barnhart C., Johnson E. L., Nemhauser G. L., Savelsbergh M. W. P., Vance P. H. Branch-and-price: Column generation for solving huge integer programs. Oper. Res. (1998) 46(3):316–329LinkGoogle Scholar
  • Bianco L., Bielli M., Mingozzi A., Ricciardelli S., Spandoni M. A heuristic procedure for the crew rostering problem. Eur. J. Oper. Res. (1992) 58(2):272–283CrossrefGoogle Scholar
  • Caprara A., Fischetti M., Toth P. A heuristic method for the set covering problem. Oper. Res. (1999) 47(5):730–743LinkGoogle Scholar
  • Caprara A., Fischetti M., Toth P., Vigo D. Modeling and solving the crew rostering problem. Oper. Res. (1998) 46(6):820–830LinkGoogle Scholar
  • Caprara A., Fischetti M., Toth P., Vigo D., Guida P. L. Algorithms for railway crew management. Math. Programming (1997) 79:125–141CrossrefGoogle Scholar
  • Caprara A., Focacci F., Lamma E., Mello P., Milano M., Vigo P. Toth D. Integrating constraint logic programming and operations research techniques for the crew rostering problem. Software Practice Experience (1998) 28(1):49–76CrossrefGoogle Scholar
  • Carraresi P., Gallo G. A multi-level bottleneck assignment approach to the bus drivers’ rostering problem. Eur. J. Oper. Res. (1984) 16(2):163–173CrossrefGoogle Scholar
  • Caseau Y., Koppstein P. A rule-based approach to a time-constrained traveling salesman problem. 2nd Internat. Sympos. Artificial Intelligence Math. (1992) Google Scholar
  • Chabrier A. 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) (1999) (Ferrara, Italy)Google Scholar
  • Cheng B. M. W., Choi K. M. F., Lee J. H. M., Wu J. C. K. Increasing constraint propagation by redundant modeling: An experience report. Constraints (1999) 4(2):167–182CrossrefGoogle Scholar
  • Cormen T. H., Leiserson C. E., Rivest R. L.Introduction to Algorithms (1990) (MIT Press, Cambridge, MA) Google Scholar
  • Crainic T. G., Laporte G.Fleet Management and Logistics (1998) (Kluwer Academic Publishers, Boston, MA) CrossrefGoogle Scholar
  • Darby-Dowman K., Little J. Properties of some combinatorial optimization problems and their effect on the performance of integer programming and constraint logic programming. INFORMS J. Comput. (1998) 10(3):276–286LinkGoogle Scholar
  • Desrochers M., Soumis F. A column generation approach to the urban transit crew scheduling problem. Transportation Sci. (1989) 23(1):1–13LinkGoogle Scholar
  • Dror M.Arc Routing: Theory, Solutions and Applications (2000) (Kluwer Academic Publishers, Boston, MA) CrossrefGoogle Scholar
  • Fahle T., Sellmann M. Constraint programming based column generation with knapsack subproblems. 2nd Internat. Workshop Integration AI & OR Tech. Constraint Programming Combinatorial Optim. Problems (CP-AI-OR’00) (2000) (Paderborn, Germany)Google Scholar
  • Gervet C. Large combinatorial optimization problems: A methodology for hybrid models and solutions. Journées Francophones de Programmation en Logique et par Contraintes (1998) (Nantes, France)Google Scholar
  • Ginsberg M. L. Dynamic backtracking. J. Artificial Intelligence Res. (1993) 1:25–46CrossrefGoogle Scholar
  • Grötschel M., Martin A., Weismantel R. Packing Steiner trees: A cutting plane algorithm and computational results. Math. Programming (1996) 72:125–145CrossrefGoogle Scholar
  • Guerinik N., Caneghem M. V. Solving crew scheduling problems by constraint programming. Lecture Notes Comput. Sci. (1995) 976Cassis, France:481–498CrossrefGoogle Scholar
  • IC-Parc Imperial College, London, The ECLiiPSee Constraint Logic Programming System. (2001) . Ver. 5.1.3 http://www.icparc.ic.ac.uk/eclipseGoogle Scholar
  • ILOG S. A.ILOG CPLEX 6.5 Reference Manual (1999) Google Scholar
  • Jachnik J. K., Wren A. Attendance and rostering system. Computer Scheduling of Public Transport (1981) (North-Holland Publishing Company, Amsterdam, The Netherlands) 337–343Google Scholar
  • Jourdan J. Concurrent constraint multiple models in CLP and CC languages: Toward a programming methodology by modeling. (1995) . Doctoral dissertation, Université Denis Diderot, Paris VII, FranceGoogle Scholar
  • Junker U., Karisch S., Kohl N., Vaaben B. Constraint programming based column generation for crew assignment. Internat. Workshop Integration AI OR Tech. Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR’99) (1999a) (Ferrara, Italy)Google Scholar
  • Junker U., Karisch S., Kohl N., Vaaben B., Fahle T., Sellmann M. A framework for constraint programming based column generation. Lecture Notes Comput. Sci. (1999b) 1713Alexandria, VA:261–274CrossrefGoogle Scholar
  • Leconte M., Couronne P., Vergamini D. Column generation using cooperating constraint-based solvers. Workshop on Constraints and Constraint Programming, Asian Computing Sci. Conf. (Asian’96) (1996) SingaporeGoogle Scholar
  • Lever J., Wallace M., Richards B. Constraint logic programming for scheduling and planning. British Telecom Tech. J. (1995) 13:73–81Google Scholar
  • OREAS GmbH ABACUS: A Branch-And-CUt System. User’s Guide and Reference Manual (1999) . Ver. 2.3Google Scholar
  • Reeves C. R.Modern Heuristic Techniques for Combinatorial Problems (1993) (Wiley, New York) Google Scholar
  • Sellmann M., Zervoudakis K., Stamatopoulos P., Fahle T. 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) (2000) (Paderborn, Germany)Google Scholar
  • Uchôa E., Poggi de Aragão M. Vertex-disjoint packing of two Steiner trees: Polyhedra and branch-and-cut. Lecture Notes Comput. Sci. (1999) 1610Graz, Austria:439–452CrossrefGoogle Scholar
  • Yunes T. H., Moura A. V., de Souza C. C. Exact solutions for real world crew scheduling problems. INFORMS Fall 1999 Meeting (1999) Philadelphia, PAGoogle Scholar
  • Yunes T. H., Moura A. V., de Souza C. C. A hybrid approach for solving large scale crew scheduling problems. Lecture Notes Comput. Sci. (2000a) 1753(Boston, MA)293–307Google Scholar
  • Yunes T. H., Moura A. V., de Souza C. C. Hybrid column generation approaches for solving real world crew management problems. (2000b) . 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.gzGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.