Exploring Fairness in Train Timetabling and Rolling Stock Scheduling with Flexible (Un)coupling in a Y-Shaped Network
Teer Lu , Mohammad Sadrani , Ramandeep Singh , Han Zheng , Junhua Chen , Yuxuan Liu , Constantinos Antoniou
Urban Rail Transit ›› : 1 -28.
Flexible (un)coupling operation within a Y-shaped network allows for the dynamic adjustment of metro train formations at the diverging junction based on fluctuating passenger demand. Train timetable and rolling stock schedule serve as essential elements in organising efficient flexible (un)coupling train operation. However, reducing overall waiting time during the optimisation process may lead to disparities, where some passengers experience much longer waiting periods compared to others. To address this issue, we formulate a multi-objective optimisation model that jointly determines train formations, timetable, and rolling stock schedule while balancing operating cost, total waiting time, and fairness. Moreover, we design an operationalisation method for balancing the objectives and solve the problem using the Gurobi solver. Numerical experiments are conducted under different scenarios on a Y-shaped metro network in Guangzhou, China. The results reveal that the model can effectively improve fairness compared to cases without fairness considerations. By allowing a moderate increase in total waiting time or operating costs, passengers with the longest waiting times experience reduced waiting durations. The standard deviation of waiting times also decreases. For instance, a 25.6 $\%$ rise in operating costs yields a 27.4$\%$ reduction in passenger waiting time cost and a 36.5$\%$ reduction in the standard deviation of waiting times. Ultimately, a more efficient balance between fairness, operating costs, and overall passenger waiting time is achieved.
Train timetabling / Rolling stock circulation / Fairness / Flexible train formation / Multi-objective optimisation
| [1] |
|
| [2] |
|
| [3] |
|
| [4] |
|
| [5] |
|
| [6] |
|
| [7] |
|
| [8] |
|
| [9] |
|
| [10] |
|
| [11] |
|
| [12] |
|
| [13] |
|
| [14] |
|
| [15] |
|
| [16] |
|
| [17] |
|
| [18] |
|
| [19] |
|
| [20] |
|
| [21] |
|
| [22] |
|
| [23] |
|
| [24] |
|
| [25] |
|
| [26] |
|
| [27] |
|
| [28] |
|
| [29] |
|
| [30] |
|
| [31] |
|
| [32] |
|
| [33] |
|
| [34] |
|
| [35] |
|
| [36] |
|
| [37] |
|
| [38] |
|
| [39] |
|
| [40] |
|
| [41] |
|
| [42] |
|
| [43] |
|
| [44] |
|
| [45] |
|
| [46] |
|
| [47] |
|
| [48] |
|
| [49] |
|
| [50] |
|
| [51] |
|
| [52] |
|
| [53] |
|
| [54] |
|
| [55] |
|
| [56] |
|
| [57] |
|
| [58] |
|
| [59] |
|
| [60] |
|
The Author(s)
/
| 〈 |
|
〉 |