Please use this identifier to cite or link to this item:
Title: Crew scheduling problem for mass rapid transit systems
Authors: Li, Yingying
Keywords: Engineering::Electrical and electronic engineering::Computer hardware, software and systems
Issue Date: 2022
Publisher: Nanyang Technological University
Source: Li, Y. (2022). Crew scheduling problem for mass rapid transit systems. Master's thesis, Nanyang Technological University, Singapore.
Abstract: 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
Schools: School of Electrical and Electronic Engineering 
Fulltext Permission: restricted
Fulltext Availability: With Fulltext
Appears in Collections:EEE Theses

Files in This Item:
File Description SizeFormat 
Crew Scheduling Problem for Mass Rapid Transit Systems.pdf
  Restricted Access
1.39 MBAdobe PDFView/Open

Page view(s)

Updated on Jul 20, 2024


Updated on Jul 20, 2024

Google ScholarTM


Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.