Skip to the main content

Preliminary communication

https://doi.org/10.7307/ptt.v29i4.2263

An Experimental Analysis on Dispatching Rules for the Train Platforming Problem in Busy Complex Passenger Stations

Qiongfang Zeng ; Central South University
Yinggui Zhang ; Central South University
Dingyou Lei ; Central South University


Full text: english PDF 731 Kb

page 411-423

downloads: 473

cite


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.

Keywords

busy complex passenger station; train platforming problem; job shop scheduling theory; dispatching rule

Hrčak ID:

186863

URI

https://hrcak.srce.hr/186863

Publication date:

28.8.2017.

Visits: 1.072 *