Timetable Design for Urban Rail Line with Capacity Constraints
To design an efficient and economical timetable for a heavily congested urban rail corridor, a scheduling model is proposed in this paper. The objective of the proposed model is to find the departure time of trains at the start terminal to minimize the system cost, which includes passenger waiting c...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2015-01-01
|
| Series: | Discrete Dynamics in Nature and Society |
| Online Access: | http://dx.doi.org/10.1155/2015/429219 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832561262792278016 |
|---|---|
| author | Yu-Ting Zhu Bao-Hua Mao Lu Liu Ming-Gao Li |
| author_facet | Yu-Ting Zhu Bao-Hua Mao Lu Liu Ming-Gao Li |
| author_sort | Yu-Ting Zhu |
| collection | DOAJ |
| description | To design an efficient and economical timetable for a heavily congested urban rail corridor, a scheduling model is proposed in this paper. The objective of the proposed model is to find the departure time of trains at the start terminal to minimize the system cost, which includes passenger waiting cost and operating cost. To evaluate the performance of the timetable, a simulation model is developed to simulate the detailed movements of passengers and trains with strict constraints of station and train capacities. It assumes that passengers who arrive early will have more chances to access a station and board a train. The accessing and boarding processes of passengers are all based on a first-come-first-serve basis. When a station is full, passengers unable to access must wait outside until the number of waiting passengers at platform falls below a given value. When a train is full, passengers unable to board must wait at the platform for the next train to arrive. Then, based on the simulation results, a two-stage genetic algorithm is introduced to find the best timetable. Finally, a numerical example is given to demonstrate the effectiveness of the proposed model and solution method. |
| format | Article |
| id | doaj-art-027949cf31c8462f92737b169092cd34 |
| institution | Kabale University |
| issn | 1026-0226 1607-887X |
| language | English |
| publishDate | 2015-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Discrete Dynamics in Nature and Society |
| spelling | doaj-art-027949cf31c8462f92737b169092cd342025-02-03T01:25:28ZengWileyDiscrete Dynamics in Nature and Society1026-02261607-887X2015-01-01201510.1155/2015/429219429219Timetable Design for Urban Rail Line with Capacity ConstraintsYu-Ting Zhu0Bao-Hua Mao1Lu Liu2Ming-Gao Li3MOE Key Laboratory for Urban Transportation Complex Systems Theory and Technology, Beijing Jiaotong University, Beijing 100044, ChinaMOE Key Laboratory for Urban Transportation Complex Systems Theory and Technology, Beijing Jiaotong University, Beijing 100044, ChinaMOE Key Laboratory for Urban Transportation Complex Systems Theory and Technology, Beijing Jiaotong University, Beijing 100044, ChinaMOE Key Laboratory for Urban Transportation Complex Systems Theory and Technology, Beijing Jiaotong University, Beijing 100044, ChinaTo design an efficient and economical timetable for a heavily congested urban rail corridor, a scheduling model is proposed in this paper. The objective of the proposed model is to find the departure time of trains at the start terminal to minimize the system cost, which includes passenger waiting cost and operating cost. To evaluate the performance of the timetable, a simulation model is developed to simulate the detailed movements of passengers and trains with strict constraints of station and train capacities. It assumes that passengers who arrive early will have more chances to access a station and board a train. The accessing and boarding processes of passengers are all based on a first-come-first-serve basis. When a station is full, passengers unable to access must wait outside until the number of waiting passengers at platform falls below a given value. When a train is full, passengers unable to board must wait at the platform for the next train to arrive. Then, based on the simulation results, a two-stage genetic algorithm is introduced to find the best timetable. Finally, a numerical example is given to demonstrate the effectiveness of the proposed model and solution method.http://dx.doi.org/10.1155/2015/429219 |
| spellingShingle | Yu-Ting Zhu Bao-Hua Mao Lu Liu Ming-Gao Li Timetable Design for Urban Rail Line with Capacity Constraints Discrete Dynamics in Nature and Society |
| title | Timetable Design for Urban Rail Line with Capacity Constraints |
| title_full | Timetable Design for Urban Rail Line with Capacity Constraints |
| title_fullStr | Timetable Design for Urban Rail Line with Capacity Constraints |
| title_full_unstemmed | Timetable Design for Urban Rail Line with Capacity Constraints |
| title_short | Timetable Design for Urban Rail Line with Capacity Constraints |
| title_sort | timetable design for urban rail line with capacity constraints |
| url | http://dx.doi.org/10.1155/2015/429219 |
| work_keys_str_mv | AT yutingzhu timetabledesignforurbanraillinewithcapacityconstraints AT baohuamao timetabledesignforurbanraillinewithcapacityconstraints AT luliu timetabledesignforurbanraillinewithcapacityconstraints AT minggaoli timetabledesignforurbanraillinewithcapacityconstraints |