Technical Papers
Oct 29, 2022

Last Train Rapid Synchronizing Approach for Maximum OD Accessibility with Passengers’ Effective Travel Route

Publication: Journal of Transportation Engineering, Part A: Systems
Volume 149, Issue 1

Abstract

During the last train period, passengers will not successfully reach their destination if the timetables of the various transfer station lines are not coordinated. This paper proposes a general model to optimize the last train timetables of urban rail networks and maximize origin-destination (OD) accessibility for metro networks during the last train period. By using a generalized cost function, all transportation activities involved in an urban rail network are effectively described, and a generalized cost function is established for the last train as a criterion for its accessibility. A mixed-integer programming model that pays more attention to passengers’ effective travel routes and accessibility of the entire OD route is proposed. A genetic algorithm combined with a K-shortest path algorithm is developed to calculate a rescheduling solution within a satisfactory running time (e.g., 35 min). Finally, comparative experiments are conducted using the Xi’an urban rail network as a case study. The results show that the objective function of OD accessibility is more favorable to last train passengers than to the number of successful transfer passengers at transfer stations. This increases the number of passengers successfully arriving at their destination by 12.03%. The proposed methodology assist in cost-effective coordination of the last train timetables and make accurate recommendations to improve passenger OD accessibility using information guidance.

Get full access to this article

View all available purchase options and get full access to this article.

Data Availability Statement

Station ridership data and train timetables used during the study were provided by Xi’an Metro Co., Ltd. Direct requests for these materials may be made to the provider as indicated in the Acknowledgments.

Acknowledgments

The authors confirm contributions to the study as follows: study conception and design: Shuang Zhang, Chaoqun Ma, and Quan Chen; data collection: Shuang Zhang and Chen Ma; analysis and interpretation of results: Shuang Zhang and Quan Chen; draft manuscript preparation: Shuang Zhang, Chaoqun Ma, Chen Ma, and Sijia Sun; revisions and responses: Shuang Zhang, Sijia Sun, and Yanqiu Cheng. All authors reviewed the results and approved the final version of the manuscript. The authors would like to thank Xi’an Metro Group Co., Ltd. for the station ridership data and train timetables.

References

Ansari Esfeh, M., S. Saidi, S. C. Wirasinghe, and L. Kattan. 2022. “Waiting time and headway modeling considering unreliability in transit service.” Transp. Res. Part A: Policy Pract. 155 (Jan): 219–233. https://doi.org/10.1016/j.tra.2021.11.015.
Cai, C. J., L. S. Zhou, and Y. F. Shang. 2014. “Research on the last train connection in the urban mass transit system.” Adv. Mater. Res. 1065–1069 (Dec): 3334–3338. https://doi.org/10.4028/www.scientific.net/AMR.1065-1069.3334.
Chen, Y., B. Mao, Y. Bai, T. K. Ho, and Z. Li. 2019. “Timetable synchronization of last trains for urban rail networks with maximum accessibility.” Transp. Res. Part C: Emerging Technol. 99 (Feb): 110–129. https://doi.org/10.1016/j.trc.2019.01.003.
Di, Z., L. Yang, J. Qi, and Z. Gao. 2018. “Transportation network design for maximizing flow-based accessibility.” Transp. Res. Part B: Methodol. 110 (Apr): 209–238. https://doi.org/10.1016/j.trb.2018.02.013.
Dial, R. B. 1971. “A probabilistic multipath traffic assignment model which obviates path enumeration.” Transp. Res. 5 (2): 83–111. https://doi.org/10.1016/0041-1647(71)90012-8.
Dou, X., Q. Meng, and X. Guo. 2015. “Bus schedule coordination for the last train service in an intermodal bus-and-train transport network.” Transp. Res. Part C: Emerging Technol. 60 (Nov): 360–376. https://doi.org/10.1016/j.trc.2015.09.006.
Feng, Z., S. Jungang, and P. Hanchuan. 2013. “Optimization method for last train coordination plan of urban rail transit based on network operation.” Procedia Social Behav. Sci. 96 (Nov) 2706–2712. https://doi.org/10.1016/j.sbspro.2013.08.304.
Guo, X., J. Wu, H. Sun, X. Yang, J. G. Jin, and D. Z. Wang. 2020. “Scheduling synchronization in urban rail transit networks: Trade-offs between transfer passenger and last train operation.” Transp. Res. Part A: Policy Pract. 138 (Aug): 463–490. https://doi.org/10.1016/j.tra.2020.06.008.
Han, Z., B. Han, D. Li, S. Ning, R. Yang, and Y. Yin. 2021. “Train timetabling in rail transit network under uncertain and dynamic demand using advanced and adaptive NSGA-II.” Transp. Res. Part B: Methodol. 154 (Dec): 65–99. https://doi.org/10.1016/j.trb.2021.10.002.
Ibarra-Rojas, O. J., and Y. A. Rios-Solis. 2012. “Synchronization of bus timetabling.” Transp. Res. Part B: Methodol. 46 (5): 599–614. https://doi.org/10.1016/j.trb.2012.01.006.
Jing, W., X. Xu, and Y. Pu. 2020. “Route redundancy-based approach to identify the critical stations in metro networks: A mean-excess probability measure.” Reliab. Eng. Syst. Saf. 204 (Dec): 107204. https://doi.org/10.1016/j.ress.2020.107204.
Kang, L., and Q. Meng. 2017. “Two-phase decomposition method for the last train departure time choice in subway networks.” Transp. Res. Part B: Methodol. 104 (Oct): 568–582. https://doi.org/10.1016/j.trb.2017.05.001.
Kang, L., J. Wu, H. Sun, X. Zhu, and B. Wang. 2015. “A practical model for last train rescheduling with train delay in urban railway transit networks.” Omega 50 (Jan): 29–42. https://doi.org/10.1016/j.omega.2014.07.005.
Kang, L., and X. Zhu. 2017. “Strategic timetable scheduling for last trains in urban railway transit networks.” Appl. Math. Modell. 45 (May): 209–225. https://doi.org/10.1016/j.apm.2016.12.016.
Liu, J., P. M. Schonfeld, Q. Peng, and Y. Yin. 2020. “Measures of travel reliability on an urban rail transit network.” J. Transp. Eng. Part A: Syst. 146 (6): 04020037. https://doi.org/10.1061/JTEPBS.0000361.
Tian, X., and H. Niu. 2019. “A bi-objective model with sequential search algorithm for optimizing network-wide train timetables.” Comput. Ind. Eng. 127 (Jan): 1259–1272. https://doi.org/10.1016/j.cie.2018.03.012.
Ullrich, A., and C. V. Forst. 2009. “K-pathA: K-shortest path algorithm.” In Proc., 2009 Int. Workshop on High Performance Computational Systems Biology, 23–30. New York: IEEE.
Wang, Y., T. Tang, B. Ning, T. J. Van Den Boom, and B. De Schutter. 2015. “Passenger-demands-oriented train scheduling for an urban rail transit network.” Transp. Res. Part C: Emerging Technol. 60 (Nov): 1–23. https://doi.org/10.1016/j.trc.2015.07.012.
Yang, S., K. Yang, Z. Gao, L. Yang, and J. Shi. 2017. “Last-train timetabling under transfer demand uncertainty: Mean-variance model and heuristic solution.” J. Adv. Transp. 2017 (Aug): 1–13. https://doi.org/10.1155/2017/5095021.
Yao, Y., X. Zhu, H. Shi, and P. Shang. 2019. “Last train timetable optimization considering detour routing strategy in an urban rail transit network.” Meas. Control 52 (9–10): 1461–1479. https://doi.org/10.1177/0020294019877480.
Yin, H., J. Wu, H. Sun, L. Kang, and R. Liu. 2018. “Optimizing last trains timetable in the urban rail network: Social welfare and synchronization.” Transportmetrica B: Transport Dyn. 7 (1): 473–497. https://doi.org/10.1080/21680566.2018.1440361.
Yin, J., A. D’ariano, Y. Wang, L. Yang, and T. Tang. 2021. “Timetable coordination in a rail transit network with time-dependent passenger demand.” Eur. J. Oper. Res. 295 (1): 183–202. https://doi.org/10.1016/j.ejor.2021.02.059.
Zhou, W., L. Deng, M. Xie, and X. Yan. 2013. “Coordination optimization of the first and last trains’ departure time on urban rail transit network.” Adv. Mech. Eng. 5 (Jan): 848292. https://doi.org/10.1016/j.ejor.2021.02.059.
Zhou, Y., Y. Wang, H. Yang, and X. Yan. 2019. “Last train scheduling for maximizing passenger destination reachability in urban rail transit networks.” Transp. Res. Part B: Methodol. 129 (Nov): 79–95. https://doi.org/10.1016/j.trb.2019.09.006.
Zhu, W., W.-L. Fan, A. M. Wahaballa, and J. Wei. 2019. “Calibrating travel time thresholds with cluster analysis and AFC data for passenger reasonable route generation on an urban rail transit network.” Transportation 47 (6): 3069–3090. https://doi.org/10.1007/s11116-019-10040-8.

Information & Authors

Information

Published In

Go to Journal of Transportation Engineering, Part A: Systems
Journal of Transportation Engineering, Part A: Systems
Volume 149Issue 1January 2023

History

Received: Jan 28, 2022
Accepted: Aug 11, 2022
Published online: Oct 29, 2022
Published in print: Jan 1, 2023
Discussion open until: Mar 29, 2023

Permissions

Request permissions for this article.

Authors

Affiliations

Shuang Zhang [email protected]
Ph.D. Student, Dept. of Traffic Engineering, College of Transportation Engineering, Chang’an Univ., Xi’an, Shaanxi 710064, China. Email: [email protected]
Associate Professor, Dept. of Traffic Engineering, College of Transportation Engineering, Chang’an Univ., Xi’an, Shaanxi 710064, China (corresponding author). Email: [email protected]
Ph.D. Student, Dept. of Traffic Engineering, College of Transportation Engineering, Chang’an Univ., Xi’an, Shaanxi 710064, China. Email: [email protected]
Assistant Engineer, Shenzhen Comprehensive Transportation and Municipal Engineering Design & Research Institute Co., Ltd., 2706 Highway Building, No. 1006 Dongmen North Rd., Luohu District, Shenzhen, Guangdong 518037, China. Email: [email protected]
Ph.D. Student, Dept. of Traffic Engineering, College of Transportation Engineering, Chang’an Univ., Xi’an, Shaanxi 710064, China. Email: [email protected]
Assistant Professor, College of Transportation Engineering, Chang’an Univ., Xi’an, Shaanxi 710064, China. ORCID: https://orcid.org/0000-0001-6326-0107. Email: [email protected]

Metrics & Citations

Metrics

Citations

Download citation

If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.

Cited by

  • Last train timetabling with transfer accessibility in metro networks: integer linear programing model and schedule-based transfer network, Measurement and Control, 10.1177/00202940231186674, 57, 1, (30-39), (2023).
  • Applications of Genetic Algorithm and Its Variants in Rail Vehicle Systems: A Bibliometric Analysis and Comprehensive Review, IEEE Access, 10.1109/ACCESS.2023.3292790, 11, (68972-68993), (2023).

View Options

Get Access

Access content

Please select your options to get access

Log in/Register Log in via your institution (Shibboleth)
ASCE Members: Please log in to see member pricing

Purchase

Save for later Information on ASCE Library Cards
ASCE Library Cards let you download journal articles, proceedings papers, and available book chapters across the entire ASCE Library platform. ASCE Library Cards remain active for 24 months or until all downloads are used. Note: This content will be debited as one download at time of checkout.

Terms of Use: ASCE Library Cards are for individual, personal use only. Reselling, republishing, or forwarding the materials to libraries or reading rooms is prohibited.
ASCE Library Card (5 downloads)
$105.00
Add to cart
ASCE Library Card (20 downloads)
$280.00
Add to cart
Buy Single Article
$35.00
Add to cart

Get Access

Access content

Please select your options to get access

Log in/Register Log in via your institution (Shibboleth)
ASCE Members: Please log in to see member pricing

Purchase

Save for later Information on ASCE Library Cards
ASCE Library Cards let you download journal articles, proceedings papers, and available book chapters across the entire ASCE Library platform. ASCE Library Cards remain active for 24 months or until all downloads are used. Note: This content will be debited as one download at time of checkout.

Terms of Use: ASCE Library Cards are for individual, personal use only. Reselling, republishing, or forwarding the materials to libraries or reading rooms is prohibited.
ASCE Library Card (5 downloads)
$105.00
Add to cart
ASCE Library Card (20 downloads)
$280.00
Add to cart
Buy Single Article
$35.00
Add to cart

Media

Figures

Other

Tables

Share

Share

Copy the content Link

Share with email

Email a colleague

Share