An intelligent simulation platform for train traffic control under disturbance
- Publication Type:
- Journal Article
- International Journal of Modelling and Simulation, 2019, 39 (3), pp. 135 - 156
- Issue Date:
|An intelligent simulation platform for train traffic control under disturbance.pdf||Published Version||3.22 MB|
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
© 2018, © 2018 Informa UK Limited, trading as Taylor & Francis Group. Railway disturbance management is inherently a multi-objective optimization problem that concerns both the operators’ cost and passenger’s service level. This study proposes a multi-objective simulation-based optimization framework to effectively manage the train conflicts after the occurrences of a disturbance caused by a temporary line blockage. The simulation model enhanced with a dynamic priority dispatching rule in order to speed up the optimization procedure. A multi-objective variable neighborhood search meta-heuristic is proposed to solve the train rescheduling model. The obtained Pareto optimal solutions for disturbance management model support the decision maker to find a trade-off between both user and operator viewpoints. The proposed approach has been validated on a set of disruption scenarios covering a large part of the Iranian rail network. The computational results prove that the proposed model can generate good-quality timetables with the minimum passenger delay and deviation from the initial timetable. The outcomes indicate that the developed simulation-based optimization approach has substantial advantages in producing practical solution quickly when compared to currently accepted solutions. Abbreviation: MOVNS: multi-objective variable neighbourhood search; DES: discrete-event simulation; SO: simulation-optimization; AG: Alternative Graph; FCFS: First Come First Served; MIP: mixed integer programming; MILP: mixed-integer linear programming; B&B: branch and bound algorithm; VND: Variable Neighborhood Descent; NSGA-II: Non-dominated Sorting Genetic Algorithm–II; CD: crowding distance; DP: dynamic priority; EDD: earliest due date first; SRTT: shortest remaining traveling time; LST: least slack time first.
Please use this identifier to cite or link to this item: