Skip to main content
Log in

An Optimization Based Approach to the Train Operator Scheduling Problem at Singapore MRT

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

Singapore Mass Rapid Transit (SMRT) operates two train lines with 83 kilometers of track and 48 stations. A total of 77 trains are in operation during peak hours and 41 during off-peak hours. In this article we report on an optimization based approach to develop a computerized train-operator scheduling system that has been implemented at SMRT. The approach involves a bipartite matching algorithm for the generation of night duties and a tabu search algorithm for the generation of day duties. The system automates the train-operator scheduling process at SMRT and produces favorable schedules in comparison with the manual process. It is also able to handle the multiple objectives inherent in the crew scheduling system. While trying to minimize the system wide crew-related costs, the system is also able to address concern with respect to the number of split duties.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J.E. Beasley and B. Cao, Dynamic programming based algorithm for crew scheduling, Computers and Operations Research 25 (1998) 567–582.

    Google Scholar 

  2. L. Bodin, B. Golden, A. Assad and M. Ball, Routing and scheduling of vehicles and crews; the state of the art, Computers and Operations Research 10 (1983) 63–211.

    Google Scholar 

  3. A. Caprara, M. Fischetti and P. Toth, A heuristic method for the set covering problem, Operations Research 47 (1999) 730–743.

    Google Scholar 

  4. L. Cavique, C. Rego and I. Themido, Subgraph ejection chains and tabu search for the crew scheduling problem (1997) submitted.

  5. Committee on the Next Decade of Operations Research (CONDOR 1998), Operations research: The next decade, Operations Research 36.

  6. U. Derigs, Solving non-bipartite matching problems vis. shortest path techniques, Annals of Operations Research 13 (1988) 225–261.

    Google Scholar 

  7. M. Desrochers and J.-M. Rousseau, Computer-Aided Transit Scheduling (Springer, Berlin, 1990).

    Google Scholar 

  8. F. Glover, Heuristics for integer programming using surrogate constraints, Decision Sciences 8 (1977) 156–166.

    Google Scholar 

  9. F. Glover and M. Laguna, Tabu Search (Kluwer Academic, 1997).

  10. J.-M. Rousseau, Computer Scheduling of Public Transport 2 (North-Holland, Amsterdam, 1985).

    Google Scholar 

  11. A. Wren, Computer Scheduling of Public Transport: Urban Passenger Vehicle and Crew Scheduling (North-Holland, Amsterdam, 1981).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chew, KL., Pang, J., Liu, Q. et al. An Optimization Based Approach to the Train Operator Scheduling Problem at Singapore MRT. Annals of Operations Research 108, 111–122 (2001). https://doi.org/10.1023/A:1016002910561

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1016002910561

Navigation