A New Model for the Mass Transit Crew Scheduling Problem
暂无分享,去创建一个
[1] John E. Beasley,et al. A dynamic programming based algorithm for the crew scheduling problem , 1998, Comput. Oper. Res..
[2] Anthony Wren,et al. A bus crew scheduling system using a set covering formulation , 1988 .
[3] G. Mitra,et al. Computer Scheduling of Public Transport , 1982 .
[4] Marco A. Boschetti,et al. A Set Partitioning Approach to the Crew Scheduling Problem , 1999, Oper. Res..
[5] Maddalena Nonato,et al. Network Models, Lagrangean Relaxation and Subgradients Bundle Approach in Crew Scheduling Problems , 1995 .
[6] Nicos Christofides,et al. Algorithms for large scale set covering problems , 1993, Ann. Oper. Res..
[7] Ann S. K. Kwan,et al. Driver Scheduling Using Genetic Algorithms with Embedded Combinatorial Traits , 1999 .
[8] Anthony Wren,et al. An Improved ILP System for Driver Scheduling , 1999 .
[9] J. Beasley,et al. A tree search algorithm for the crew scheduling problem , 1996 .
[10] Ana Paias,et al. State space relaxation for set covering problems related to bus driver scheduling , 1993 .
[11] G Mitra,et al. CRU-SCHED--A COMPUTER BASED BUS CREW SCHEDULING SYSTEM USING INTEGER PROGRAMMING. FROM THE BOOK COMPUTER SCHEDULING OF PUBLIC TRANSPORT 2 , 1985 .
[12] Anthony Wren,et al. Greedy Genetic Algorithms, Optimizing Mutations and Bus Driver Scheduling , 1995 .
[13] Martin Desrochers,et al. A Column Generation Approach to the Urban Transit Crew Scheduling Problem , 1987, Transp. Sci..