Transportation Science
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


TRANSPORTATION SCIENCE
Vol. 42, No. 1, February 2008, pp. 57-69
DOI: 10.1287/trsc.1070.0200
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Wong, R. C. W.
Right arrow Articles by Leung, J. M. Y.
Right arrow Search for Related Content

Optimizing Timetable Synchronization for Rail Mass Transit

Rachel C. W. Wong, Tony W. Y. Yuen, Kwok Wah Fung, Janny M. Y. Leung

Systems Engineering and Engineering Management Department, The Chinese University of Hong Kong, Shatin, New Territories, Hong Kong
Planning and Development Department, MTR Corporation Limited, Hong Kong
Operations Department, MTR Corporation Limited, Hong Kong
Systems Engineering and Engineering Management Department, The Chinese University of Hong Kong, Shatin, New Territories, Hong Kong

rachelwong{at}alumni.cuhk.net
tonyyuen{at}mtr.com.hk
kwfung{at}mtr.com.hk
janny{at}se.cuhk.edu.hk

In most urban public transit rail systems, passengers may need to make several interchanges between different lines to reach their destination. The design of coordinated timetables that enable smooth interchanges with minimal delay for all passengers is a very difficult task. This paper presents a mixed-integer-programming optimization model for this schedule synchronization problem for nonperiodic timetables that minimizes the interchange waiting times of all passengers. A novelty in our formulation is the use of binary variables that enable the correct representation of the waiting times to the "next available" train at the interchange stations.

By adjusting trains' run times and station dwell times during their trips and their dispatch times, turnaround times at the terminals, and headways at the stations, our model can construct high-quality timetables that minimize transfer waiting times. We also discuss an optimization-based heuristic for the model. We have tested our algorithm for the Mass Transit Railway (MTR) system in Hong Kong, which runs six railway lines with many cross-platform interchange stations. Preliminary numerical results indicate that our approach improves the synchronization significantly compared with the current practice of using fixed headways and trip times. We also explore the trade-offs among different operational parameters and flexibility and their impact on overall passenger waiting times.

Key Words: mass transit; rail; timetabling; scheduling; transfers
History: Received: February 2005; revised: March 2006; accepted: March 2007.







HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2008 by INFORMS.