Path-Based Approach for Expanding Rail Transit Network in a Metropolitan Area
Rail transit network design is an important strategic problem in determining the layout of infrastructure and improving operating performance. A core transit network with multiclass rail transit systems has been constructed in many metropolitan areas worldwide. In this study, we aimed to expand an e...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2022-01-01
|
| Series: | Journal of Advanced Transportation |
| Online Access: | http://dx.doi.org/10.1155/2022/7637298 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832555174634192896 |
|---|---|
| author | Anjun Li Dian Wang Qiyuan Peng Lisha Wang |
| author_facet | Anjun Li Dian Wang Qiyuan Peng Lisha Wang |
| author_sort | Anjun Li |
| collection | DOAJ |
| description | Rail transit network design is an important strategic problem in determining the layout of infrastructure and improving operating performance. A core transit network with multiclass rail transit systems has been constructed in many metropolitan areas worldwide. In this study, we aimed to expand an existing network to shorten travel time and improve service quality under the restriction of limited transport supply. We formulate the studied problem as a mixed-integer linear model to obtain optimal construction links, the number of trains required on each link, and the path selected by each traveler such that the weighted sum of total costs from the perspective of travelers, operators, and investors is minimized. The formulated model is path-based, where feasible paths for each traveler are generated to describe the full door-to-door journey, including the first/last mile, transfers, and multiclass transit modes. Owing to the complexity of the network design problem and because it is impractical to enumerate all feasible paths for each traveler in real-size problems, we propose a column generation-based algorithm to find both tight lower bounds and good-quality solutions efficiently by considering only a subset of feasible paths. We prove that the pricing subproblem in column generation can be decomposed into multiple shortest path problems, which can be solved efficiently and separately, based on O/D pairs instead of individual travelers. A rail transit network along a metropolitan corridor was studied as an example. Multiple computational experiments were conducted, and the results illustrate the validity and practicality of the proposed methodology for solving the problem. |
| format | Article |
| id | doaj-art-3a13cea3435342f7ba5952e8fb225305 |
| institution | Kabale University |
| issn | 2042-3195 |
| language | English |
| publishDate | 2022-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Advanced Transportation |
| spelling | doaj-art-3a13cea3435342f7ba5952e8fb2253052025-02-03T05:49:20ZengWileyJournal of Advanced Transportation2042-31952022-01-01202210.1155/2022/7637298Path-Based Approach for Expanding Rail Transit Network in a Metropolitan AreaAnjun Li0Dian Wang1Qiyuan Peng2Lisha Wang3School of Transportation and LogisticsSchool of Transportation and LogisticsSchool of Transportation and LogisticsSchool of Architecture and Urban PlanningRail transit network design is an important strategic problem in determining the layout of infrastructure and improving operating performance. A core transit network with multiclass rail transit systems has been constructed in many metropolitan areas worldwide. In this study, we aimed to expand an existing network to shorten travel time and improve service quality under the restriction of limited transport supply. We formulate the studied problem as a mixed-integer linear model to obtain optimal construction links, the number of trains required on each link, and the path selected by each traveler such that the weighted sum of total costs from the perspective of travelers, operators, and investors is minimized. The formulated model is path-based, where feasible paths for each traveler are generated to describe the full door-to-door journey, including the first/last mile, transfers, and multiclass transit modes. Owing to the complexity of the network design problem and because it is impractical to enumerate all feasible paths for each traveler in real-size problems, we propose a column generation-based algorithm to find both tight lower bounds and good-quality solutions efficiently by considering only a subset of feasible paths. We prove that the pricing subproblem in column generation can be decomposed into multiple shortest path problems, which can be solved efficiently and separately, based on O/D pairs instead of individual travelers. A rail transit network along a metropolitan corridor was studied as an example. Multiple computational experiments were conducted, and the results illustrate the validity and practicality of the proposed methodology for solving the problem.http://dx.doi.org/10.1155/2022/7637298 |
| spellingShingle | Anjun Li Dian Wang Qiyuan Peng Lisha Wang Path-Based Approach for Expanding Rail Transit Network in a Metropolitan Area Journal of Advanced Transportation |
| title | Path-Based Approach for Expanding Rail Transit Network in a Metropolitan Area |
| title_full | Path-Based Approach for Expanding Rail Transit Network in a Metropolitan Area |
| title_fullStr | Path-Based Approach for Expanding Rail Transit Network in a Metropolitan Area |
| title_full_unstemmed | Path-Based Approach for Expanding Rail Transit Network in a Metropolitan Area |
| title_short | Path-Based Approach for Expanding Rail Transit Network in a Metropolitan Area |
| title_sort | path based approach for expanding rail transit network in a metropolitan area |
| url | http://dx.doi.org/10.1155/2022/7637298 |
| work_keys_str_mv | AT anjunli pathbasedapproachforexpandingrailtransitnetworkinametropolitanarea AT dianwang pathbasedapproachforexpandingrailtransitnetworkinametropolitanarea AT qiyuanpeng pathbasedapproachforexpandingrailtransitnetworkinametropolitanarea AT lishawang pathbasedapproachforexpandingrailtransitnetworkinametropolitanarea |