Hyper pooling private trips into high occupancy transit like attractive shared rides

Rafał Kucharski, Oded Cats
{"title":"Hyper pooling private trips into high occupancy transit like attractive shared rides","authors":"Rafał Kucharski, Oded Cats","doi":"10.1038/s44333-024-00006-4","DOIUrl":null,"url":null,"abstract":"The size of the solution space associated with the trip-matching problem has made the search for high-order ride-pooling prohibitive. We introduce hyper-pooled rides along with a method to identify them within urban demand patterns. Travellers of hyper-pooled rides walk to common pick-up points, travel with a shared vehicle along a sequence of stops and are dropped off at stops from which they walk to their destinations. While closely resembling classical mass transit, hyper-pooled rides are purely demand-driven, with itineraries (stop locations, sequences, timings) optimised for all co-travellers. For 2000 trips in Amsterdam the algorithm generated 40 hyper-pooled rides transporting 225 travellers. They would require 52.5 vehicle hours to travel solo, whereas in the hyper-pooled multi-stop rides, it is reduced sixfold to 9 vehicle hours only. This efficiency gain is made possible by achieving an average occupancy of 5.8 (and a maximum of 14) while remaining attractive for all co-travellers.","PeriodicalId":501714,"journal":{"name":"npj Sustainable Mobility and Transport","volume":" ","pages":"1-14"},"PeriodicalIF":0.0000,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.nature.com/articles/s44333-024-00006-4.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"npj Sustainable Mobility and Transport","FirstCategoryId":"1085","ListUrlMain":"https://www.nature.com/articles/s44333-024-00006-4","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The size of the solution space associated with the trip-matching problem has made the search for high-order ride-pooling prohibitive. We introduce hyper-pooled rides along with a method to identify them within urban demand patterns. Travellers of hyper-pooled rides walk to common pick-up points, travel with a shared vehicle along a sequence of stops and are dropped off at stops from which they walk to their destinations. While closely resembling classical mass transit, hyper-pooled rides are purely demand-driven, with itineraries (stop locations, sequences, timings) optimised for all co-travellers. For 2000 trips in Amsterdam the algorithm generated 40 hyper-pooled rides transporting 225 travellers. They would require 52.5 vehicle hours to travel solo, whereas in the hyper-pooled multi-stop rides, it is reduced sixfold to 9 vehicle hours only. This efficiency gain is made possible by achieving an average occupancy of 5.8 (and a maximum of 14) while remaining attractive for all co-travellers.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
将私人出行过度集中到高乘座率的公交系统中,如极具吸引力的共享乘车服务
与出行匹配问题相关的求解空间之大,使得寻找高阶合乘问题变得困难重重。我们引入了超级合乘,以及在城市需求模式中识别超级合乘的方法。超级合乘的乘客步行到共同的上车点,乘坐合乘车辆沿一系列站点行驶,然后在站点下车,再步行前往目的地。虽然超级拼车与传统的公共交通非常相似,但它纯粹是由需求驱动的,其行程(停靠站点、顺序、时间安排)是为所有共同出行的人优化的。在阿姆斯特丹的 2000 次旅行中,该算法生成了 40 次超级拼车,共运送 225 名乘客。单人出行需要 52.5 个车时,而超级拼车的多站搭乘则减少了六倍,仅需 9 个车时。这种效率的提高得益于平均载客量达到 5.8 人(最多 14 人),同时对所有共乘者保持吸引力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
The long journey towards a shift to rail in the European long-distance passenger transport market. How gasoline prices influence the effectiveness of interventions targeting sustainable transport modes? Systemic risk approach to mitigate delay cascading in railway networks Estimating emissions reductions with carpooling and vehicle dispatching in ridesourcing mobility Karma economies for sustainable urban mobility – a fair approach to public good value pricing
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1