Evolutionary Driver Scheduling with Relief Chains

Evolutionary Computation

Volumn 9, Issue 4, 2001, Pages 445-460

  Kwan, Raymond S K ^a   Kwan, Ann S K ^a   Wren, Anthony ^a  

^a UNIVERSITY OF LEEDS   (United Kingdom)

Author keywords

Combinatorial traits; Driver scheduling; Hybrid genetic algorithms; Learning property; Public transport; Set covering

Indexed keywords

CHAINS; INTEGER PROGRAMMING; SCHEDULING; SCHEDULING ALGORITHMS;

COMBINATORIAL TRAIT; DRIVER SCHEDULING; HYBRID GENETIC ALGORITHMS; INTEGER LINEAR PROGRAMMING; LEARNING PROPERTY; NP-HARD; PROPERTY; PUBLIC TRANSPORT; SCHEDULING PROBLEM; SET COVERINGS;

GENETIC ALGORITHMS;

ALGORITHM; ARTICLE; HUMAN; MOTOR VEHICLE; PERSONNEL MANAGEMENT; SYSTEM ANALYSIS; TRAFFIC AND TRANSPORT;

ALGORITHMS; HUMANS; MOTOR VEHICLES; OPERATIONS RESEARCH; PERSONNEL STAFFING AND SCHEDULING; TRANSPORTATION;

EID: 0035653738     PISSN: 10636560     EISSN: 15309304     Source Type: Journal    
DOI: 10.1162/10636560152642869     Document Type: Article

References (21)

1. Beasley, J. E. and Chu, P. C. (1996). A genetic algorithm for the set covering problem. European Journal of Operational Research, 94:392–404.
2. Caprara, A. et al. (1997). Algorithms for railway crew management. Mathematical Programming, 79:25–141.
3. Chvátal, V. (1979). A Greedy Heuristic for the Set-Covering Problem. Mathematics of Operations Research, 4:233–235.
4. Clement, R. and Wren, A. (1995). Greedy genetic algorithms, optimising mutations and bus driver scheduling. In Daduna, J. R., Branco, I., and Paixao, J. M. P., editors, Computer-Aided Transit Scheduling, pages 213–235. Springer Verlag, Berlin, Germany.
5. Curtis, S. D., Smith, B. M., and Wren, A. (1999). Forming bus driver schedules using constraint programming. In Proceedings of First International Conference on the Practical Applications of Constraint Technologies and Logic Programming, pages 239–254, The Practical Application Company, Blackpool, UK.
6. Fores, S., Proll, L. G., and Wren, A. (1999). An improved ILP system for driver scheduling. In Wilson, N. H. M., editor, Computer-Aided Transit Scheduling, pages 43–61. Springer-Verlag, Berlin, Germany.
7. Glover, F. and Laguna, M. (1993). Tabu search. In Reeves, C. R., editor, Modern heuristic techniques for combinatorial problems, pages 70–150. Blackwell Scientific, Oxford, UK.
8. Gonzalez Hernandez, L. F. and Corne, D. W. (1996). Evolutionary divide and conquer of the set covering problem. In Fogarty, T. C., editor, Evolutionary Computing, pages 198–208. Springer, Berlin, Germany.
9. Guerinik, N. and Caneghem, M. V. (1995). Solving crew scheduling problems by constraint programming. In Montanari, U. and Rossi, F., editors, Principles and Practice of Constraint Programming CP’95, pages 481–498. Springer, Berlin, Germany.
10. Kwan, A. S. K. (1999). Train driver scheduling. Doctoral Thesis, University of Leeds, Leeds, UK.
11. Kwan, R. S. K., and Wren, A. (1996). Hybrid genetic algorithms for bus driver scheduling. In Bianco, I., and Toth, P., editors, Advanced Methods in Transportation Analysis, pages 609–619, Springer, Berlin, Germany.
12. Kwan, A. S. K., Kwan, R. S. K., and Wren, A. (1999a). Driver scheduling using genetic algorithms with embedded combinatorial traits. In Wilson, N. H. M., editor, Computer-Aided Transit Scheduling, pages 81–102. Springer-Verlag, Berlin, Germany.
13. Kwan, A. S. K. et al. (1999b). Producing train driver schedules under different operating strategies. In Wilson, N. H. M., editor, Computer-Aided Transit Scheduling, pages 129–154. Springer-Verlag, Berlin, Germany.
14. Kwan, R. S. K., Kwan, A. S. K., and Wren, A. (2000). Hybrid genetic algorithms for scheduling bus and train drivers. In Proceedings of IEEE Congress on Evolutionary Computation, pages 285–292, IEEE Press, Piscataway, New Jersey.
15. Layfield, C. J., Smith, B. M., and Wren, A. (1999). Bus relief opportunity selection using constraint programming. In Proceedings of First International Conference on Practical Application of Constraint Technologies and Logic Programming, pages 537–552, The Practical Application Company, Blackpool, UK.
16. Meilton, M. (2001). Selecting and implementing a computer aided scheduling system for a large bus company. In Voß, S. and Daduna, J. R., editors, Computer-Aided Scheduling of Public Transport, pages 203–214. Springer, Berlin, Germany.
17. Rayward-Smith, V. J. et al., editors. (1996). Modern heuristic search methods. Wiley, Chichester, UK.
18. Rodosek, R., Wallace, M. G., and Hajian, T. (1996). A new approach to integrate mixed integer programming. In Freuder, E. C., editor, CP’96 workshop on Constraint Programming Applications: An Inventory and Taxonomy, Springer, Berlin, Germany.
19. Wilson, N. H. M., editor (1999). Computer-Aided Transit Scheduling. In Proceedings of the Seventh International Workshop on Computer-Aided Scheduling of Public Transport, Springer, Berlin, Germany.
20. Wren, A. and Rousseau, J.-M. (1995). Bus driver scheduling: An overview. In Daduna, J. R., Branco, I., and Paixao, J. M. P., editors, Computer-Aided Transit Scheduling, pages 173–187. Springer, Berlin, Germany.
21. Wren, A. and Wren, D. O. (1995). A genetic algorithm for public transport driver scheduling. Computers and Operations Research, 22:101–110.