Assigning Passenger Flows on a Metro Network Based on Automatic Fare Collection Data and Timetable
Assigning passenger flows on a metro network plays an important role in passenger flow analysis that is the foundation of metro operation. Traditional transit assignment models are becoming increasingly complex and inefficient. These models may even not be valid in case of sudden changes in the time...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2017-01-01
|
| Series: | Discrete Dynamics in Nature and Society |
| Online Access: | http://dx.doi.org/10.1155/2017/4373871 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832560958869864448 |
|---|---|
| author | Ling Hong Wei Li Wei Zhu |
| author_facet | Ling Hong Wei Li Wei Zhu |
| author_sort | Ling Hong |
| collection | DOAJ |
| description | Assigning passenger flows on a metro network plays an important role in passenger flow analysis that is the foundation of metro operation. Traditional transit assignment models are becoming increasingly complex and inefficient. These models may even not be valid in case of sudden changes in the timetable or disruptions in the metro system. We propose a methodology for assigning passenger flows on a metro network based on automatic fare collection (AFC) data and realized timetable. We find that the routes connecting a given origin and destination (O-D) pair are related to their observed travel times (OTTs) especially their pure travel times (PTTs) abstracted from AFC data combined with the realized timetable. A novel clustering algorithm is used to cluster trips between a given O-D pair based on PTTs/OTTs and complete the assignment. An initial application to categorical O-D pairs on the Shanghai metro system, which is one of the largest systems in the world, shows that the proposed methodology works well. Accompanying the initial application, an interesting approach is also provided for determining the theoretical maximum accuracy of the new assignment model. |
| format | Article |
| id | doaj-art-9eb3ebadd2784dd7b6ae5f1d2dec57a2 |
| institution | Kabale University |
| issn | 1026-0226 1607-887X |
| language | English |
| publishDate | 2017-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Discrete Dynamics in Nature and Society |
| spelling | doaj-art-9eb3ebadd2784dd7b6ae5f1d2dec57a22025-02-03T01:26:19ZengWileyDiscrete Dynamics in Nature and Society1026-02261607-887X2017-01-01201710.1155/2017/43738714373871Assigning Passenger Flows on a Metro Network Based on Automatic Fare Collection Data and TimetableLing Hong0Wei Li1Wei Zhu2Key Laboratory of Road and Traffic Engineering of Ministry of Education, Tongji University, Shanghai 201804, ChinaKey Laboratory of Road and Traffic Engineering of Ministry of Education, Tongji University, Shanghai 201804, ChinaKey Laboratory of Road and Traffic Engineering of Ministry of Education, Tongji University, Shanghai 201804, ChinaAssigning passenger flows on a metro network plays an important role in passenger flow analysis that is the foundation of metro operation. Traditional transit assignment models are becoming increasingly complex and inefficient. These models may even not be valid in case of sudden changes in the timetable or disruptions in the metro system. We propose a methodology for assigning passenger flows on a metro network based on automatic fare collection (AFC) data and realized timetable. We find that the routes connecting a given origin and destination (O-D) pair are related to their observed travel times (OTTs) especially their pure travel times (PTTs) abstracted from AFC data combined with the realized timetable. A novel clustering algorithm is used to cluster trips between a given O-D pair based on PTTs/OTTs and complete the assignment. An initial application to categorical O-D pairs on the Shanghai metro system, which is one of the largest systems in the world, shows that the proposed methodology works well. Accompanying the initial application, an interesting approach is also provided for determining the theoretical maximum accuracy of the new assignment model.http://dx.doi.org/10.1155/2017/4373871 |
| spellingShingle | Ling Hong Wei Li Wei Zhu Assigning Passenger Flows on a Metro Network Based on Automatic Fare Collection Data and Timetable Discrete Dynamics in Nature and Society |
| title | Assigning Passenger Flows on a Metro Network Based on Automatic Fare Collection Data and Timetable |
| title_full | Assigning Passenger Flows on a Metro Network Based on Automatic Fare Collection Data and Timetable |
| title_fullStr | Assigning Passenger Flows on a Metro Network Based on Automatic Fare Collection Data and Timetable |
| title_full_unstemmed | Assigning Passenger Flows on a Metro Network Based on Automatic Fare Collection Data and Timetable |
| title_short | Assigning Passenger Flows on a Metro Network Based on Automatic Fare Collection Data and Timetable |
| title_sort | assigning passenger flows on a metro network based on automatic fare collection data and timetable |
| url | http://dx.doi.org/10.1155/2017/4373871 |
| work_keys_str_mv | AT linghong assigningpassengerflowsonametronetworkbasedonautomaticfarecollectiondataandtimetable AT weili assigningpassengerflowsonametronetworkbasedonautomaticfarecollectiondataandtimetable AT weizhu assigningpassengerflowsonametronetworkbasedonautomaticfarecollectiondataandtimetable |