An Experimental Analysis on Dispatching Rules for the Train Platforming Problem in Busy Complex Passenger Stations
Abstract
This paper presents the scheduling models for train
platforming problem (TPP) by using mixed integer linear programming and job shop scheduling theory. First, the operation procedures and scheduled time adjustment costs of different train types specific to busy complex passenger stations are explicitly represented. Second, a multi-criteria scheduling model (MCS) for TPP without earliness and tardiness time window (ETTW) and a time window scheduling model (TWS) with ETTW for TPP are proposed. Third, various dispatching rules were designed by incorporating the dispatcher experiences with modern scheduling theory and a rule-based metaheuristic to solve the above model is presented. With solution improvement strategies analogous to those used in practice by dispatchers, the realistic size problems in acceptable time can be solved.
References
Sels P, Vansteenwegen P, Dewilde T, Cattrysse D, Waquet B, Joubert A. The train platforming problem: The infrastructure management company perspective. Transportation Research Part B Methodological. 2014;61(1):55-72.
Dewilde T, Sels P, Cattrysse D, Vansteenwegen P. Improving the robustness in railway station areas. European Journal of Operational Research. 2014;235(1):276-286.
Zhou WL, Teng HL. Simultaneous passenger train routing and timetabling using an efficient train-based Lagrangian relaxation decomposition. Transportation Research Part B. 2016;94:409-439.
Cacchiani V, Galli L, Toth P. A tutorial on non-periodic train timetabling and platforming problems. Euro Journal on Transportation & Logistics. 2014;4(3):1-36.
Mascis A, Pacciarelli D. Job-shop scheduling with blocking and no-wait constrains. European Journal of Operational Research. 2002;143(3):498-517.
D’Ariano A, Pacciarelli D, Pranzo M. A branch and bound algorithm for scheduling trains in a railway network. European Journal of Operational Research. 2007;183(2):643-657.
Samà M, Meloni C, D'Ariano A, Corman F. A multi-criteria decision support methodology for real-time train scheduling. Journal of Rail Transport Planning & Management. 2015;5(3):146-162.
Corman F, Goverde R, D’Ariano A. Rescheduling dense traffic over busy complex station interlocking areas. In: Ahuja R, Möhring R, Zaroliagis C (Eds.). Robust and Online Large-Scale Optimization: Models and Techniques for Transportation Systems. Berlin, Germany: Springer-Verlag Berlin Heidelberg, 2009; p. 369-386.
Carey M, Craville S. Scheduling and platforming trains at busy complex stations. Transportation Research Part A: Policy & Practice. 2003;37(3):195-224.
Carey M, Crawford I. Scheduling trains on a network of busy complex stations. Transportation Research Part B: Methodological. 2007;41(2):159-178.
Fang W, Yang S, Yao X. A survey on problem models and solution approaches to rescheduling in railway networks. IEEE Transactions on Intelligent Transportation Systems. 2015;16(6):2997-3016.
Lusby RM, Larsen J, Ehrgott M, Ryan DM. A set packing inspired method for real-time junction train routing. Computers & Operations Research. 2013;40(3):713-724.
Pellegrini P, Marlière G, Rodriguez J. Optimal train routing and scheduling for managing traffic perturbations in busy complex junctions. Transportation Research Part B: Methodological. 2014;59(1):58-80.
Alagöz O, Azizoğlu M. Rescheduling of identical parallel machines under machine eligibility constrains. European Journal of Operational Research. 2003;149(3):523-532.
Caprara A, Galli L, Toth P. Solution of the train platforming problem. Transportation Science. 2011;45(2):246-257.
Caimi G, Fuchsberger M, Laumanns M, Lüthi, M. A model predictive control approach for descrete-time rescheduling in busy complex central railway station approach. Computers & Operations Research. 2012;39(11):145-155.
Dewilde T, Sels P, Cattrysse D, Vansteenwegen P. Robust railway station planning: An interaction between routing, timetabling and platforming. Journal of Rail Transport Planning & Management. 2013;3(3):68-77.
Pinedo M. Scheduling theory, algorithms and systems. New York, NY: Springer Science+Business Media, LLC; 2008.
Kroon LG, Romeijn HE, Zwaneveld PJ. Routing trains through railway stations: busy complexity issues. European Journal of Operational Research. 1997;98(3):485-498.
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
