Please use this identifier to cite or link to this item:
https://doi.org/10.1109/ACCESS.2019.2921758
Title: | Integrated Optimization of Train Stop Planning and Scheduling on Metro Lines with Express/Local Mode | Authors: | Li, Z. Mao, B. Bai, Y. Chen, Y. |
Keywords: | express/local mode integrated optimization mixed integer linear programming Public transportation train scheduling train stop planning |
Issue Date: | 2019 | Publisher: | Institute of Electrical and Electronics Engineers Inc. | Citation: | Li, Z., Mao, B., Bai, Y., Chen, Y. (2019). Integrated Optimization of Train Stop Planning and Scheduling on Metro Lines with Express/Local Mode. IEEE Access 7 : 88534-88546. ScholarBank@NUS Repository. https://doi.org/10.1109/ACCESS.2019.2921758 | Rights: | Attribution-NonCommercial-NoDerivatives 4.0 International | Abstract: | Train stopping patterns and schedules play critical roles in the service design of metro lines with express/local mode. Previous studies on express/local mode generally handle the design of train stopping patterns and schedules independently, which cannot ensure the overall optimality of service provision. In this paper, a mixed integer nonlinear programming model is developed to collaboratively adjust train stopping patterns and schedules in order to minimize passenger travel time in express/local mode. With two types of train services provided, overtaking is allowed and a diverse set of passenger route choices is also incorporated into the proposed model. Linearization techniques are applied to transform this model from nonlinear to linear, which enables the proposed model to be handled by commercial linear solvers. To enhance computing efficiency in large-scale problems, a guided branch-And-cut algorithm is designed. The numerical examples on a test line and a real-world metro line are implemented to demonstrate the effectiveness of the proposed model and approach. The proposed approach is compared to existing approaches to identify the benefits of integrating train stop planning and scheduling decisions. Based on the computational time and the objective value, the guided branch-And-cut algorithm outperforms the direct use of the CPLEX solver. © 2013 IEEE. | Source Title: | IEEE Access | URI: | https://scholarbank.nus.edu.sg/handle/10635/212507 | ISSN: | 2169-3536 | DOI: | 10.1109/ACCESS.2019.2921758 | Rights: | Attribution-NonCommercial-NoDerivatives 4.0 International |
Appears in Collections: | Staff Publications Elements |
Show full item record
Files in This Item:
File | Description | Size | Format | Access Settings | Version | |
---|---|---|---|---|---|---|
10_1109_ACCESS_2019_2921758.pdf | 2.24 MB | Adobe PDF | OPEN | None | View/Download |
This item is licensed under a Creative Commons License