Homa Motvallian Naeini, Yousef Shafahi, Mohammad SafariTaherkhani
{"title":"基于停跳策略的城市地铁网络时刻表优化与同步","authors":"Homa Motvallian Naeini, Yousef Shafahi, Mohammad SafariTaherkhani","doi":"10.1016/j.jrtpm.2022.100301","DOIUrl":null,"url":null,"abstract":"<div><p><span>Stop-skipping and timetable synchronization are two effective strategies to reduce total passengers’ travel time in a transit network for </span>subway<span> operation. However, the majority of studies conducted on the topic do not consider stop-skipping strategy and timetable synchronization simultaneously. Thus, this article proposes a mixed-integer programming model considering both strategies simultaneously. The model is based on passenger smart-card data concerning the trains’ capacity to minimize total passengers’ waiting time and in-vehicle time and maximize the number of passengers who successfully reach their destination in a specific study horizon. Since increasing the number of trains, stations, or the study horizon, exponentially increases the size of the problem, seeking efficient methods to solve real-sized problems is inevitable. Therefore, a heuristic algorithm based<span> on a genetic algorithm (GA) was developed to solve the model. A hypothetical example was solved with GAMS (CPLEX) in order to evaluate the performance of both the model and the used algorithm. Then, the results were compared with the results of GA. Finally, a large-scale, real-life case study based on Tehran rail transit network was used to evaluate the proposed models in this study and the genetic algorithm approach. The results indicated that the proposed model reduced each passenger’s travel time by approximately 4.78%, on average, and it also reduced each passenger’s transfer waiting time by approximately 32.4%, on average in a peak hour. Finally, it maximized the number of passengers who reached their destination successfully in the considered study horizon.</span></span></p></div>","PeriodicalId":51821,"journal":{"name":"Journal of Rail Transport Planning & Management","volume":"22 ","pages":"Article 100301"},"PeriodicalIF":2.6000,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Optimizing and synchronizing timetable in an urban subway network with stop-skip strategy\",\"authors\":\"Homa Motvallian Naeini, Yousef Shafahi, Mohammad SafariTaherkhani\",\"doi\":\"10.1016/j.jrtpm.2022.100301\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p><span>Stop-skipping and timetable synchronization are two effective strategies to reduce total passengers’ travel time in a transit network for </span>subway<span> operation. However, the majority of studies conducted on the topic do not consider stop-skipping strategy and timetable synchronization simultaneously. Thus, this article proposes a mixed-integer programming model considering both strategies simultaneously. The model is based on passenger smart-card data concerning the trains’ capacity to minimize total passengers’ waiting time and in-vehicle time and maximize the number of passengers who successfully reach their destination in a specific study horizon. Since increasing the number of trains, stations, or the study horizon, exponentially increases the size of the problem, seeking efficient methods to solve real-sized problems is inevitable. Therefore, a heuristic algorithm based<span> on a genetic algorithm (GA) was developed to solve the model. A hypothetical example was solved with GAMS (CPLEX) in order to evaluate the performance of both the model and the used algorithm. Then, the results were compared with the results of GA. Finally, a large-scale, real-life case study based on Tehran rail transit network was used to evaluate the proposed models in this study and the genetic algorithm approach. The results indicated that the proposed model reduced each passenger’s travel time by approximately 4.78%, on average, and it also reduced each passenger’s transfer waiting time by approximately 32.4%, on average in a peak hour. Finally, it maximized the number of passengers who reached their destination successfully in the considered study horizon.</span></span></p></div>\",\"PeriodicalId\":51821,\"journal\":{\"name\":\"Journal of Rail Transport Planning & Management\",\"volume\":\"22 \",\"pages\":\"Article 100301\"},\"PeriodicalIF\":2.6000,\"publicationDate\":\"2022-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Rail Transport Planning & Management\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2210970622000051\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"TRANSPORTATION\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Rail Transport Planning & Management","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2210970622000051","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"TRANSPORTATION","Score":null,"Total":0}
Optimizing and synchronizing timetable in an urban subway network with stop-skip strategy
Stop-skipping and timetable synchronization are two effective strategies to reduce total passengers’ travel time in a transit network for subway operation. However, the majority of studies conducted on the topic do not consider stop-skipping strategy and timetable synchronization simultaneously. Thus, this article proposes a mixed-integer programming model considering both strategies simultaneously. The model is based on passenger smart-card data concerning the trains’ capacity to minimize total passengers’ waiting time and in-vehicle time and maximize the number of passengers who successfully reach their destination in a specific study horizon. Since increasing the number of trains, stations, or the study horizon, exponentially increases the size of the problem, seeking efficient methods to solve real-sized problems is inevitable. Therefore, a heuristic algorithm based on a genetic algorithm (GA) was developed to solve the model. A hypothetical example was solved with GAMS (CPLEX) in order to evaluate the performance of both the model and the used algorithm. Then, the results were compared with the results of GA. Finally, a large-scale, real-life case study based on Tehran rail transit network was used to evaluate the proposed models in this study and the genetic algorithm approach. The results indicated that the proposed model reduced each passenger’s travel time by approximately 4.78%, on average, and it also reduced each passenger’s transfer waiting time by approximately 32.4%, on average in a peak hour. Finally, it maximized the number of passengers who reached their destination successfully in the considered study horizon.