A Passenger‐Oriented Model for Train Rescheduling on an Urban Rail Transit Line considering Train Capacity Constraint
Open Access
- 1 January 2017
- journal article
- research article
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2017 (1)
Abstract
The major objective of this work is to present a train rescheduling model with train capacity constraint from a passenger‐oriented standpoint for a subway line. The model expects to minimize the average generalized delay time (AGDT) of passengers. The generalized delay time is taken into consideration with two aspects: the delay time of alighting passengers and the penalty time of stranded passengers. Based on the abundant automatic fare collection (AFC) system records, the passenger arrival rate and the passenger alighting ratio are introduced to depict the short‐term characteristics of passenger flow at each station, which can greatly reduce the computation complexity. In addition, an efficient genetic algorithm with adaptive mutation rate and elite strategy is used to solve the large‐scale problem. Finally, Beijing Subway Line 13 is taken as a case study to validate the method. The results show that the proposed model does help neutralize the effect of train delay, with a 9.47% drop in the AGDT in comparison with the train‐oriented model.Keywords
Funding Information
- National Natural Science Foundation of China (51478036)
This publication has 22 references indexed in Scilit:
- Design of an effective algorithm for fast response to the re-scheduling of railway traffic during disturbancesTransportation Research Part C: Emerging Technologies, 2012
- SAPI: Statistical Analysis of Propagation of Incidents. A new approach for rescheduling trains after disruptionsEuropean Journal of Operational Research, 2011
- A MIP‐based local search method for the railway rescheduling problemNetworks, 2010
- A practical model for transfer optimization in a transit network: Model formulations and solutionsTransportation Research Part A: Policy and Practice, 2010
- Train Timetable Optimizing and Rescheduling Based on Improved Particle Swarm AlgorithmTransportation Research Record: Journal of the Transportation Research Board, 2010
- A branch and bound algorithm for scheduling trains in a railway networkEuropean Journal of Operational Research, 2007
- Single-track train timetabling with guaranteed optimality: Branch-and-bound algorithms with enhanced lower boundsTransportation Research Part B: Methodological, 2007
- N-tracked railway traffic re-scheduling during disturbancesTransportation Research Part B: Methodological, 2007
- Job-shop scheduling with blocking and no-wait constraintsEuropean Journal of Operational Research, 2002
- A study of train dwelling time at the hong kong mass transit railway systemJournal of Advanced Transportation, 1998