University of British Columbia
The operator scheduling for Singapore mass transit system
Abstract
dc:descriptionThis paper presents a mathematical formulation of the train operator scheduling problem in a Mass Rapid Transit System. Integer programs (IP) with 0-1 constraints matrices arise frequently in scheduling and staffing methods. The formulation of the train operator scheduling problem a asset-partitioning or set-covering integer program gives rise to IP problems with excessive size and computational complexity. Subproblems of the original problem can however be solved by relaxing the integer program to an LP and introducing some heuristics to round off the fractional parts of the solution. Near optimal solutions to these problems can be found and can be easily implemented using reasonable computing resources. The method is demonstrated on the original data given by the Provisional Mass Rapid Transit Authority of Singapore and on several other variations of the data set The results compare favorably with other methods in computational efficiency.
Degree
thesis:*- Name thesis:degree_name
- Master of Science - MSc
- Level thesis:degree_level
- master's
- Discipline thesis:degree_discipline
- Business Administration
- Grantor dc:publisher
- University of British Columbia
- Year dc:date
- 1984
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Goh, Lek-Oon
Rights
dc:rights- Statement dc:rights
-
- For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use.
- Language dc:language
- eng
Identifiers
dc:identifier.*- Handle dc:identifier
- http://hdl.handle.net/2429/24499