A multi-objective and dictionary-based checking for efficient rescheduling trains

doi:10.1016/j.aej.2021.01.027

2021-06-01

Neeraj Kumar *

Abhishek Mishra

DOI：10.1016/j.aej.2021.01.027

原文链接

查看原文

摘要

En 中文

In railway networks, unexpected disruptions happen for numerous reasons, which in-turn induce delays and cancellations that eventually bring about passenger inconvenience. Thus, the Trains Timetable Rescheduling (TTR) is required, but how to reschedule the railway timetable is an imperative issue in real train operations. Though the existing research works concentrated on rescheduling the timetable, the delay time along with reliability, still, are not greatly solved. Thus, this paper proposed a multi-objective and dictionary-based checking for effective rescheduling trains. In this proposed system, first, the constraints are extracted, and the MCMIGP metrics are illustrated. Next, the GKACO optimizes the constraints to make optimal rescheduling. In this algorithm, the multi-objective function is viewed as the fitness function, which is the amalgamation of minimization of a train delay, dwell time, timetable deviation, along with the operational cost and augmentation of service reliability. Subsequent to the generation of rescheduling, the rescheduled timetable's feasibility is checked based on the dictionary-based checking technique. If the rescheduled timetable is feasible, then it is denoted as the optimal timetable. Otherwise, the timetable is again rescheduled by using the same GKACO. Lastly, the experimentation's analysis proves the proposed TTR system's performance. (C) 2021 THE AUTHORS. Published by Elsevier BV on behalf of Faculty of Engineering, Alexandria University. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).

Keyword:

Multi-Choice Mixed Integer Goal Programming (MCMIGP)

Gaussian Kernel Ant Colony Optimization (GKACO)

Dictionary-based checking

Multi-objective function