Skip to main content
Article thumbnail
Location of Repository

Fuzzy Evolutionary Approaches for Bus and\ud Rail Driver Scheduling

By Jingpeng Li


Bus and train driver scheduling is a process of partitioning blocks of work, each of which is serviced by one vehicle, into a set of legal driver shifts. The main objectives are to minimise the total number of shifts and the total shift cost. Restrictions imposed by logistic, legal and union agreements make the problem more complicated.\ud \ud The generate-and-select approach is widely used. A large set of feasible shifts is generated first, and then a subset is selected, from the large set, to form a final schedule by the mathematical programming method. In the subset selection phase, computational difficulties exist because of the NP-hard nature of this combinatorial optimisation problem. This thesis presents two evolutionary algorithms, namely a Genetic Algorithm and a Simulated Evolution algorithm, attempting to model and solve the driver scheduling problem in new ways.\ud \ud At the heart of both algorithms is a function for evaluating potential driver shifts under fuzzified criteria. A Genetic Algorithm is first employed to calibrate the weight distribution among fuzzy membership functions. A Simulated Evolution algorithm then mimics generations of evolution on the single schedule produced by the Genetic Algorithm. In each generation an unfit portion of the working schedule is removed. The broken schedule is then reconstructed by means of a greedy algorithm, using the weight distribution derived by the Genetic Algorithm. The basic Simulated Evolution algorithm is a greedy search strategy that achieves improvement through iterative perturbation and reconstruction. This approach has achieved success in solving driver scheduling problems from different companies, with comparable results to the previously best known solutions.\ud \ud Finally, the Simulated Evolution algorithm for driver scheduling has been generalized for the set covering problem, without using any special domain knowledge. This shows that this research is valuable to many applications that can be formulated as set covering models. Furthermore, Taguchi's orthogonal experimental design method has been used for the parameter settings. Computational results have shown that for large-scale problems, in general the proposed approach can produce superior solutions much faster than some existing approaches. This approach is particularly suitable for situations where quick and high-quality solutions are desirable

Publisher: School of Computing (Leeds)
Year: 2002
OAI identifier:

Suggested articles


  1. (1992). A ‘memetic’ approach for the traveling salesman problem: implementation of a computational ecology for combinatorial optimization on message-passing systems,” In
  2. (1988). A bus crew scheduling system using set covering formulation,”
  3. (1995). A combination of genetic algorithm and simulated evolution techniques for clustering,”
  4. (1987). A Connectionist Machine for Genetic Hillclimbing,”
  5. (1995). A dual strategy for solving the linear programming relaxation of a driver scheduling system,”
  6. (2002). A fuzzy evolutionary approach with Taguchi parameter setting for the set covering problem,”
  7. (2002). A fuzzy genetic algorithm for driver scheduling,” (to appear in)
  8. (2001). A fuzzy simulated evolution algorithm for the driver scheduling problem,”
  9. (2001). A fuzzy theory based evolutionary approach for driver scheduling,” in
  10. (1996). A genetic algorithm for the set covering problem,”
  11. (1979). A greedy heuristic for the set-covering problem,”
  12. (1999). A heuristic method for the set covering problem”,
  13. (1990). A Lagrangian heuristic for set covering problems,”
  14. (1994). A new adaptive multi-start technique for combinatorial global optimization,”
  15. (1996). A new approach to integrate mixed integer programming,”
  16. (1984). A new polynomial -time algorithm for Linear Programming,”
  17. (2002). A parallel genetic algorithm to solve the setcovering problem,”
  18. (1973). A technique for the solution of massive set covering problems with application of airline crew scheduling,”
  19. (1996). A Tight analysis of the greedy algorithm for set cover,”
  20. (1975). Adaptation in Natural and Artificial Systems: an Introductory Analysis with Applications to Biology, Control,
  21. (1994). Adaptive probabilities of crossover and mutation in Genetic Algorithms,”
  22. (1987). An algorithm for set covering problems,”
  23. (1989). An algorithm for solving the job-shop problem,”
  24. (1991). An analysis of multipoint crossover,”
  25. (1970). An analysis of private and public sector facilities location models,”
  26. (1997). An ant system for driver scheduling,”
  27. (2001). An efficient mean field approach to the set covering problem,”
  28. (1999). An improved ILP system for driver Scheduling,”
  29. (1996). An Introduction to Genetic Algorithms,”
  30. (1995). Ant system: optimisation by a colony of cooperating agents,”
  31. (1993). Applying Simulated Evolution to high level synthesis,”
  32. (2000). Approximating the nondominated front using the Pareto archived evolution strategy,”
  33. (1974). Approximation algorithms for combinatorial problems,”
  34. (1993). Arc-consistency and arc-consistency again,”
  35. (1988). Aspects of bus crew scheduling using a set partitioning model,”
  36. (1995). Bus driver scheduling – an overview,” in
  37. (1999). Bus relief opportunity selection using constraint programming,”
  38. (1999). Computer-Aided Transit Scheduling,” Proceedings,
  39. (1988). Computer-aided vehicle and duty scheduling using the HOT programme system,”
  40. (1981). Computerized vehicle and driver scheduling for the Hamburger Hochbahn Aktiengesellschaft,”
  41. (1979). Computers and Intractability: a Guide to the Theory of NP-Completeness,” Freeman,
  42. (2000). Constraint Satisfaction Approaches to Bus Driver Scheduling,”
  43. (1992). Developments and recent experience with the BUSMAN and BUSMAN II system,”
  44. (1985). Enhancements to the RUCUS II crew scheduling system,”
  45. (1987). ESP: a new standard cell placement package using Simulated Evolution,”
  46. (2001). Evolutionary driver scheduling with fuzzy evaluation,”
  47. (2001). Evolutionary driver scheduling with relief chains,”
  48. (1988). Experiences with a crew scheduling system based on set covering,”
  49. (2001). Experiences with a flexible driver scheduler,”
  50. (1992). EXPRESS: set partitioning for bus crew scheduling in Christchurch,”
  51. (1994). Formal memetic algorithms,” in Fogarty,
  52. (1999). Forming bus driver schedules using constraint programming,”
  53. (1993). Foundations of Constraint Satisfaction,”
  54. (1995). Fuzzy sets and fuzzy logic: theory and applications,”
  55. (1980). Fuzzy sets and systems: theory and applications,”
  56. (1965). Fuzzy sets,”
  57. (1999). Fuzzy Simulated Evolution algorithm for multiobjective optimization of VLSI placement,”
  58. (1999). Generalised fuzzy aggregation operators,”
  59. (1987). Genetic Algorithms and Simulated Annealing,”
  60. (2000). Genetic algorithms for integer solutions of bus and rail driver scheduling,” (presented at)
  61. (2000). Genetic algorithms for the bus and rail driver scheduling problem,”
  62. (1997). Genetic Algorithms in Engineering Systems”, Institution of Electrical Engineers,
  63. (1989). Genetic Algorithms in Search, Optimization and Machine Leaning,”
  64. (1995). Greedy randomized adaptive search procedures,”
  65. (1981). HAUSUS I: a mathematical programming approach to the bus driver scheduling problem,”
  66. (2000). Hybrid genetic algorithms for scheduling bus and train drivers,”
  67. (1995). Improved approximations of packing and covering problems,”
  68. (1987). Improved search in genetic algorithms,”
  69. (1996). Information combination operators for data fusion: a comparative review with classification,”
  70. (1998). Initialisation strategies and diversity in evolutionary timetabling,”
  71. (1975). Introduction to the theory of fuzzy subsets: fundamental theoretical elements,”
  72. (1993). Minimal cost set covering using probabilistic methods,”
  73. (1995). Modelling the scheduling of train drivers,”
  74. (1994). Multi-objective combinatorial optimization problems: a survey,”
  75. (1998). Multi-objective genetic local search algorithm and its application to flowshop scheduling,”
  76. (1986). Multiple Criteria Optimization – Theory, Computation and Application,”
  77. (1975). On the ratio of optimal integral and fractional covers,”
  78. (1997). Operations Research (An Introduction)”, Prentice-Hall Inc.,
  79. (1990). Optimal solution of the set covering/partitioning problems using dual heuristics,”
  80. (1990). OR-Library: Distribution test problems by electronic mail,”
  81. (1988). Overview of HASTUS current and future versions,” in
  82. (1975). Overview of RUCUS vehicle scheduling program (BLOCKS),”
  83. (1996). Peckish initialization strategies for evolutionary timetabling," in
  84. (2001). Performance of multiple objective evolutionary algorithms on distribution system design problem – computational experiments,”
  85. (1972). Reducibility among combinatorial problems,” in:
  86. (1989). SILK: a Simulated Evolution router,”
  87. (1997). Simple Lagrangian heuristic for the set covering problem.”
  88. (1970). Simplification of the set covering problem with application to Boolean expression,”
  89. (1995). Solving crew scheduling problems by constraint programming,”
  90. (1997). Stronger formulations of mixed integer Linear Programs: an example,”
  91. (1999). Subgraph ejection chains and tabu search for the crew scheduling problem,”
  92. (1989). Tabu search –part 1,”
  93. (1990). Tabu search –part 2,”
  94. (2001). Tabu Search for Bus and Train Driver Scheduling with Time Windows,”
  95. (2001). Tabu search for driver scheduling,” in
  96. (1955). The assembly line balancing problem”,
  97. (1971). The location of emergency service facilities,”
  98. (1987). The triplex design group of Chinese Association of Statistics
  99. (1999). Train Driver Scheduling,” PhD Thesis,
  100. (1981). Two approaches to computer crew scheduling,” in

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.