混合预定和按需乘客的广义拼车馈线服务的实时再优化

IF 6.3 2区 工程技术 Q1 ECONOMICS
Yanjie Yi , Zheyong Bian , Bijun Wang
{"title":"混合预定和按需乘客的广义拼车馈线服务的实时再优化","authors":"Yanjie Yi ,&nbsp;Zheyong Bian ,&nbsp;Bijun Wang","doi":"10.1016/j.jtrangeo.2025.104329","DOIUrl":null,"url":null,"abstract":"<div><div>Ridesharing revolutionizes feeder services by seamlessly connecting dispersed passengers to common destinations, such as train stations, bus terminals, airports, special event locations, and post-disaster shelters. This paper develops real-time re-optimization methodologies for generalized dynamic ridesharing feeder service operation. Such ridesharing feeder service typically encompasses a mix of scheduled and on-demand service, in which riders can schedule the request early in advance or send on-demand request for immediate service, and both types of riders are possible to share the ride. The developed methodologies enable the system to continuously re-optimize and re-adjust the vehicle routing plan that achieves the primary objective of maximizing the total number of served riders and the secondary objective of minimizing the total vehicle miles or hours traveled, simultaneously accounting for mixed types of riders' mobility requirements. This paper develops a re-optimization model implemented by a rolling horizon planning approach. An efficient heuristic algorithm, namely Large Neighborhood Search by Tabu Search algorithm (LNS-TS), is developed to solve large-scale problems. To validate the methodology, a simulation is developed to model rider activity, as well as the ridesharing process. This paper presents two case studies in Houston, Texas: a first-mile ridesharing service improving transit connectivity and a post-disaster cooling shelter access service addressing emergency transport under extreme heat. These cases represent two distinct operational contexts—everyday urban mobility and emergency disaster response—demonstrating the model's adaptability across diverse scenarios. The results generated by the re-optimization methodologies are compared with those from a periodic optimization approach, where matching and routing optimizations are conducted in isolation at different time intervals. The simulation results demonstrate that the routing plan obtained by the real-time re-optimization methodologies can serve more riders and save more vehicle miles or hours traveled compared with the periodic optimization methods. The proposed real-time, dynamic re-optimization approach for ridesharing feeder services not only demonstrates practical benefits but also holds promise for applications in autonomous vehicle systems.</div></div>","PeriodicalId":48413,"journal":{"name":"Journal of Transport Geography","volume":"128 ","pages":"Article 104329"},"PeriodicalIF":6.3000,"publicationDate":"2025-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Real-time re-optimization for generalized ridesharing feeder service with mixed scheduled and on-demand riders\",\"authors\":\"Yanjie Yi ,&nbsp;Zheyong Bian ,&nbsp;Bijun Wang\",\"doi\":\"10.1016/j.jtrangeo.2025.104329\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Ridesharing revolutionizes feeder services by seamlessly connecting dispersed passengers to common destinations, such as train stations, bus terminals, airports, special event locations, and post-disaster shelters. This paper develops real-time re-optimization methodologies for generalized dynamic ridesharing feeder service operation. Such ridesharing feeder service typically encompasses a mix of scheduled and on-demand service, in which riders can schedule the request early in advance or send on-demand request for immediate service, and both types of riders are possible to share the ride. The developed methodologies enable the system to continuously re-optimize and re-adjust the vehicle routing plan that achieves the primary objective of maximizing the total number of served riders and the secondary objective of minimizing the total vehicle miles or hours traveled, simultaneously accounting for mixed types of riders' mobility requirements. This paper develops a re-optimization model implemented by a rolling horizon planning approach. An efficient heuristic algorithm, namely Large Neighborhood Search by Tabu Search algorithm (LNS-TS), is developed to solve large-scale problems. To validate the methodology, a simulation is developed to model rider activity, as well as the ridesharing process. This paper presents two case studies in Houston, Texas: a first-mile ridesharing service improving transit connectivity and a post-disaster cooling shelter access service addressing emergency transport under extreme heat. These cases represent two distinct operational contexts—everyday urban mobility and emergency disaster response—demonstrating the model's adaptability across diverse scenarios. The results generated by the re-optimization methodologies are compared with those from a periodic optimization approach, where matching and routing optimizations are conducted in isolation at different time intervals. The simulation results demonstrate that the routing plan obtained by the real-time re-optimization methodologies can serve more riders and save more vehicle miles or hours traveled compared with the periodic optimization methods. The proposed real-time, dynamic re-optimization approach for ridesharing feeder services not only demonstrates practical benefits but also holds promise for applications in autonomous vehicle systems.</div></div>\",\"PeriodicalId\":48413,\"journal\":{\"name\":\"Journal of Transport Geography\",\"volume\":\"128 \",\"pages\":\"Article 104329\"},\"PeriodicalIF\":6.3000,\"publicationDate\":\"2025-06-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Transport Geography\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0966692325002200\",\"RegionNum\":2,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"ECONOMICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Transport Geography","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0966692325002200","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ECONOMICS","Score":null,"Total":0}
引用次数: 0

摘要

拼车通过无缝连接分散的乘客到共同的目的地,如火车站、公交总站、机场、特殊活动地点和灾后避难所,彻底改变了支线服务。本文研究了广义动态共乘馈线服务运行的实时再优化方法。这种拼车接驳服务通常包括预定服务和按需服务的混合服务,乘客可以提前安排请求或发送按需服务请求,两种类型的乘客都可以共享乘车。所开发的方法使系统能够不断地重新优化和重新调整车辆路线计划,以实现最大限度地增加服务乘客总数的主要目标和最小化车辆总行驶里程或行驶小时的次要目标,同时考虑到不同类型乘客的移动性需求。本文建立了一个用滚动水平规划方法实现的再优化模型。针对大规模问题,提出了一种高效的启发式算法——禁忌搜索大邻域搜索算法(Large Neighborhood Search by Tabu Search algorithm, LNS-TS)。为了验证该方法,开发了一个仿真模型来模拟乘客的活动,以及拼车过程。本文介绍了德克萨斯州休斯顿的两个案例研究:改善交通连通性的第一英里拼车服务和解决极端高温下紧急运输问题的灾后冷却避难所接入服务。这些案例代表了两种不同的操作环境——日常城市交通和紧急灾害响应——展示了该模型在不同场景下的适应性。将重新优化方法产生的结果与周期性优化方法产生的结果进行比较,周期性优化方法在不同的时间间隔隔离地进行匹配和路由优化。仿真结果表明,与周期优化方法相比,采用实时再优化方法得到的路径规划可以服务更多的乘客,节省更多的车辆行驶里程或行驶小时。所提出的实时、动态的拼车馈线服务再优化方法不仅展示了实际效益,而且在自动驾驶汽车系统中也有应用前景。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Real-time re-optimization for generalized ridesharing feeder service with mixed scheduled and on-demand riders
Ridesharing revolutionizes feeder services by seamlessly connecting dispersed passengers to common destinations, such as train stations, bus terminals, airports, special event locations, and post-disaster shelters. This paper develops real-time re-optimization methodologies for generalized dynamic ridesharing feeder service operation. Such ridesharing feeder service typically encompasses a mix of scheduled and on-demand service, in which riders can schedule the request early in advance or send on-demand request for immediate service, and both types of riders are possible to share the ride. The developed methodologies enable the system to continuously re-optimize and re-adjust the vehicle routing plan that achieves the primary objective of maximizing the total number of served riders and the secondary objective of minimizing the total vehicle miles or hours traveled, simultaneously accounting for mixed types of riders' mobility requirements. This paper develops a re-optimization model implemented by a rolling horizon planning approach. An efficient heuristic algorithm, namely Large Neighborhood Search by Tabu Search algorithm (LNS-TS), is developed to solve large-scale problems. To validate the methodology, a simulation is developed to model rider activity, as well as the ridesharing process. This paper presents two case studies in Houston, Texas: a first-mile ridesharing service improving transit connectivity and a post-disaster cooling shelter access service addressing emergency transport under extreme heat. These cases represent two distinct operational contexts—everyday urban mobility and emergency disaster response—demonstrating the model's adaptability across diverse scenarios. The results generated by the re-optimization methodologies are compared with those from a periodic optimization approach, where matching and routing optimizations are conducted in isolation at different time intervals. The simulation results demonstrate that the routing plan obtained by the real-time re-optimization methodologies can serve more riders and save more vehicle miles or hours traveled compared with the periodic optimization methods. The proposed real-time, dynamic re-optimization approach for ridesharing feeder services not only demonstrates practical benefits but also holds promise for applications in autonomous vehicle systems.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
11.50
自引率
11.50%
发文量
197
期刊介绍: A major resurgence has occurred in transport geography in the wake of political and policy changes, huge transport infrastructure projects and responses to urban traffic congestion. The Journal of Transport Geography provides a central focus for developments in this rapidly expanding sub-discipline.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信