高速铁路枢纽区需求响应支线交通静态与动态调度方法

Q Engineering
Yiqi Hou, Min Yang, Lichao Wang, Mingye Zhang, Da Lei
{"title":"高速铁路枢纽区需求响应支线交通静态与动态调度方法","authors":"Yiqi Hou, Min Yang, Lichao Wang, Mingye Zhang, Da Lei","doi":"10.1061/jtepbs.teeng-7838","DOIUrl":null,"url":null,"abstract":"Demand-responsive feeder transit (DRFT) is an emerging urban public transport mode with the advantage of offering flexible door-to-door services in the high-speed railway hub area. However, the existing bus scheduling schemes can hardly meet personalized and diversified passenger transfer demands in the station-city integrated high-speed railway hub, reducing the attractiveness of DRFT. This paper studies the DRFT scheduling problem considering static and dynamic travel demands under the background of mobility as a service (MaaS). An information-based DRFT system framework is proposed, where the K-means clustering algorithm is implemented to select target bus stops from regional road networks for passengers to get on and off. A two-stage mixed integer programming model is first formulated to generate operational routes and optimize the static and dynamic scheduling before and after departure. The objective functions reflect the operating benefits of public transport enterprises and the travel costs of passengers, and the demand characteristics in different driving directions are taken into account in the model. Then, an improved genetic algorithm is developed to solve the model, which is called the genetic algorithm-exact algorithm (GA-EA) in this paper. Finally, the proposed model and algorithm are evaluated using the case study of the Nanjingnan Railway Station area. The experiment results show that the optimal scheme can provide a 100% demand-response rate, reasonable service time, and valid driving routes. In addition, compared with GA, the average search time of GA-EA is shortened by 43.5% and the total objective function value is increased by 2.16%. The findings in this paper can provide practical guidance on DRFT scheduling and improve the efficiency of bus feeder service.","PeriodicalId":49972,"journal":{"name":"Journal of Transportation Engineering","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2023-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Static and Dynamic Scheduling Method of Demand-Responsive Feeder Transit for High-Speed Railway Hub Area\",\"authors\":\"Yiqi Hou, Min Yang, Lichao Wang, Mingye Zhang, Da Lei\",\"doi\":\"10.1061/jtepbs.teeng-7838\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Demand-responsive feeder transit (DRFT) is an emerging urban public transport mode with the advantage of offering flexible door-to-door services in the high-speed railway hub area. However, the existing bus scheduling schemes can hardly meet personalized and diversified passenger transfer demands in the station-city integrated high-speed railway hub, reducing the attractiveness of DRFT. This paper studies the DRFT scheduling problem considering static and dynamic travel demands under the background of mobility as a service (MaaS). An information-based DRFT system framework is proposed, where the K-means clustering algorithm is implemented to select target bus stops from regional road networks for passengers to get on and off. A two-stage mixed integer programming model is first formulated to generate operational routes and optimize the static and dynamic scheduling before and after departure. The objective functions reflect the operating benefits of public transport enterprises and the travel costs of passengers, and the demand characteristics in different driving directions are taken into account in the model. Then, an improved genetic algorithm is developed to solve the model, which is called the genetic algorithm-exact algorithm (GA-EA) in this paper. Finally, the proposed model and algorithm are evaluated using the case study of the Nanjingnan Railway Station area. The experiment results show that the optimal scheme can provide a 100% demand-response rate, reasonable service time, and valid driving routes. In addition, compared with GA, the average search time of GA-EA is shortened by 43.5% and the total objective function value is increased by 2.16%. The findings in this paper can provide practical guidance on DRFT scheduling and improve the efficiency of bus feeder service.\",\"PeriodicalId\":49972,\"journal\":{\"name\":\"Journal of Transportation Engineering\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Transportation Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1061/jtepbs.teeng-7838\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q\",\"JCRName\":\"Engineering\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Transportation Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1061/jtepbs.teeng-7838","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q","JCRName":"Engineering","Score":null,"Total":0}
引用次数: 0

摘要

需求响应式支线交通(DRFT)是一种新兴的城市公共交通方式,具有在高速铁路枢纽地区提供灵活的门到门服务的优势。然而,现有的公交调度方案难以满足站城一体化高铁枢纽个性化、多样化的换乘需求,降低了DRFT的吸引力。研究了移动即服务(MaaS)背景下考虑静态和动态出行需求的DRFT调度问题。提出了一种基于信息的DRFT系统框架,利用k均值聚类算法从区域路网中选择目标公交站点供乘客上下车。首先建立了两阶段混合整数规划模型,生成运行路线,优化出发前后的静态和动态调度。目标函数反映了公共交通企业的经营效益和乘客的出行成本,并考虑了不同行驶方向的需求特征。然后,提出了一种改进的遗传算法来求解该模型,本文称之为遗传算法-精确算法(GA-EA)。最后,以南京火车站区域为例,对所提出的模型和算法进行了评价。实验结果表明,该优化方案能够提供100%的需求响应率、合理的服务时间和有效的行驶路线。与遗传算法相比,GA- ea算法的平均搜索时间缩短43.5%,总目标函数值提高2.16%。本文的研究结果可为公交接驳调度提供实用指导,提高公交接驳服务效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Static and Dynamic Scheduling Method of Demand-Responsive Feeder Transit for High-Speed Railway Hub Area
Demand-responsive feeder transit (DRFT) is an emerging urban public transport mode with the advantage of offering flexible door-to-door services in the high-speed railway hub area. However, the existing bus scheduling schemes can hardly meet personalized and diversified passenger transfer demands in the station-city integrated high-speed railway hub, reducing the attractiveness of DRFT. This paper studies the DRFT scheduling problem considering static and dynamic travel demands under the background of mobility as a service (MaaS). An information-based DRFT system framework is proposed, where the K-means clustering algorithm is implemented to select target bus stops from regional road networks for passengers to get on and off. A two-stage mixed integer programming model is first formulated to generate operational routes and optimize the static and dynamic scheduling before and after departure. The objective functions reflect the operating benefits of public transport enterprises and the travel costs of passengers, and the demand characteristics in different driving directions are taken into account in the model. Then, an improved genetic algorithm is developed to solve the model, which is called the genetic algorithm-exact algorithm (GA-EA) in this paper. Finally, the proposed model and algorithm are evaluated using the case study of the Nanjingnan Railway Station area. The experiment results show that the optimal scheme can provide a 100% demand-response rate, reasonable service time, and valid driving routes. In addition, compared with GA, the average search time of GA-EA is shortened by 43.5% and the total objective function value is increased by 2.16%. The findings in this paper can provide practical guidance on DRFT scheduling and improve the efficiency of bus feeder service.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Transportation Engineering
Journal of Transportation Engineering 工程技术-工程:土木
CiteScore
1.22
自引率
0.00%
发文量
0
审稿时长
3.6 months
期刊介绍: Information not localized
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信