Open Collections

The operator scheduling for Singapore mass transit system

University of British Columbia

This 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.

Text

2010-05-08

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.

http://hdl.handle.net/2429/24499

Business Administration

University of British Columbia

Graduate