Nature-Inspired Optimal Route Network Design for Shared Autonomous Vehicles

Theodoros Alpos, C. Iliopoulou, K. Kepaptsoglou
{"title":"Nature-Inspired Optimal Route Network Design for Shared Autonomous Vehicles","authors":"Theodoros Alpos, C. Iliopoulou, K. Kepaptsoglou","doi":"10.3390/vehicles5010002","DOIUrl":null,"url":null,"abstract":"Emerging forms of shared mobility call for new vehicle routing models that take into account vehicle sharing, ride sharing and autonomous vehicle fleets. This study deals with the design of an optimal route network for autonomous vehicles, considering both vehicle sharing and ride sharing. The problem is modeled as a one-to-many-to-one vehicle routing problem with vehicle capacity and range constraints. An ant colony optimization algorithm is applied to the problem in order to construct a set of routes that satisfies user requests under operational constraints. Results show that the algorithm is able to produce solutions in relatively short computational times, while exploiting the possibility of ride sharing to reduce operating costs. Results also underline the potential of exploiting shared autonomous vehicles in the context of a taxi service for booking trips through electronic reservation systems.","PeriodicalId":73282,"journal":{"name":"IEEE Intelligent Vehicles Symposium. IEEE Intelligent Vehicles Symposium","volume":"9 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2022-12-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Intelligent Vehicles Symposium. IEEE Intelligent Vehicles Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3390/vehicles5010002","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Emerging forms of shared mobility call for new vehicle routing models that take into account vehicle sharing, ride sharing and autonomous vehicle fleets. This study deals with the design of an optimal route network for autonomous vehicles, considering both vehicle sharing and ride sharing. The problem is modeled as a one-to-many-to-one vehicle routing problem with vehicle capacity and range constraints. An ant colony optimization algorithm is applied to the problem in order to construct a set of routes that satisfies user requests under operational constraints. Results show that the algorithm is able to produce solutions in relatively short computational times, while exploiting the possibility of ride sharing to reduce operating costs. Results also underline the potential of exploiting shared autonomous vehicles in the context of a taxi service for booking trips through electronic reservation systems.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于自然的共享自动驾驶汽车最优路径网络设计
新兴的共享出行形式需要考虑到车辆共享、拼车和自动驾驶车队的新型车辆路线模型。本文研究了考虑车辆共享和拼车的自动驾驶汽车最优路线网络的设计。将该问题建模为具有车辆容量和距离约束的一对多对一车辆路径问题。为了在操作约束下构造一组满足用户请求的路由,将蚁群优化算法应用于该问题。结果表明,该算法能够在相对较短的计算时间内产生解决方案,同时利用拼车的可能性来降低运营成本。研究结果还强调了利用共享自动驾驶汽车在出租车服务背景下通过电子预订系统预订行程的潜力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Comparison of Feedback Field-Weakening Techniques for Synchronous Machines with Permanent Magnets Synthetic Drivers’ Performance Measures Related to Vehicle Dynamics to Control Road Safety in Curves Diesel Particle Filter Requirements for Euro 7 Technology Continuously Regenerating Heavy-Duty Applications Hybridisation Concept of Light Vehicles Utilising an Electrified Planetary Gear Set A Co-Simulation Platform with Tire and Brake Thermal Model for the Analysis and Reproduction of Blanking
×
引用
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