Crew scheduling problem for mass rapid transit systems

• Main Author: Li, Yingying
• Other Authors: Cheng Tee Hiang
• Format: Thesis-Master by Coursework
• Language: English
• Published: Nanyang Technological University 2022
• Subjects: Engineering::Electrical and electronic engineering::Computer hardware, software and systems
• Online Access: https://hdl.handle.net/10356/159272
• Institution: Nanyang Technological University

This dissertation makes a detailed analysis of the Mass Rapid Transit (MRT) crew scheduling problem after summarizing the relevant literature. It introduces the relevant concepts and contents in crew scheduling. The crew scheduling problem has many complex constraints and it is a large-scale problem that needs a complex solution process. Based on the time and location constraints, an optimization model with the minimum cost as the optimization objective is constructed. The principles, characteristics, and steps of the ant colony algorithm are introduced. The improved algorithm provides more possibilities for the ant colony to search for the path and effectively avoid the algorithm from facing the local optimal state by using the heuristic information calculated from real-time information. Finally, the improved algorithm is used to solve the crew scheduling model of a real case. By comparing the crew scheduling scheme obtained with that in actual operation and that obtained by the genetic algorithm, relevant conclusions are drawn through analysis, thereby verifying the effectiveness of the model and algorithm. Keywords: Crew Scheduling Problem; Ant Colony Algorithm; Genetic Algorithm; Combinatorial Optimization Problem