A Hybrid Firefly-DE algorithm for Ridesharing Systems with Cost Savings Allocation Schemes

Fu-Shiung Hsieh
{"title":"A Hybrid Firefly-DE algorithm for Ridesharing Systems with Cost Savings Allocation Schemes","authors":"Fu-Shiung Hsieh","doi":"10.1109/aiiot54504.2022.9817152","DOIUrl":null,"url":null,"abstract":"Ridesharing or shared mobility have been attracting significant attention in relevant research community. Most studies focus on how to match drivers and riders to minimize the overall travel distance based on their requirements. As cost savings is an essential function in ridesharing systems, allocation of cost savings has attracted researchers' attention recently. Several simple schemes have been proposed in the literature. For example, a simple scheme is to divide cost savings equally between driver and passengers in a ride. Another scheme is to allocate cost savings to participants proportional to their original travel distance. Although these simple schemes are easy to implement, there still lack a study that compare their effectiveness in ridesharing systems by applying different metaheuristic algorithms. In this paper, a hybrid meta-heuristic algorithm called hybrid Firefly-DE algorithm based on Differential Evolution and Firefly Algorithm will be adopted to match drivers and riders. We will compare three cost savings allocation schemes based on the numerical results. In our experiments, meta-heuristic algorithms are applied to find the matches to minimize the overall travel distance. The above schemes are then used to allocate cost savings among participants. The results indicate that the proportional cos savings allocation scheme is more effective than the other schemes to allocate cost savings equally between the drivers and the passengers.","PeriodicalId":409264,"journal":{"name":"2022 IEEE World AI IoT Congress (AIIoT)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE World AI IoT Congress (AIIoT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/aiiot54504.2022.9817152","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Ridesharing or shared mobility have been attracting significant attention in relevant research community. Most studies focus on how to match drivers and riders to minimize the overall travel distance based on their requirements. As cost savings is an essential function in ridesharing systems, allocation of cost savings has attracted researchers' attention recently. Several simple schemes have been proposed in the literature. For example, a simple scheme is to divide cost savings equally between driver and passengers in a ride. Another scheme is to allocate cost savings to participants proportional to their original travel distance. Although these simple schemes are easy to implement, there still lack a study that compare their effectiveness in ridesharing systems by applying different metaheuristic algorithms. In this paper, a hybrid meta-heuristic algorithm called hybrid Firefly-DE algorithm based on Differential Evolution and Firefly Algorithm will be adopted to match drivers and riders. We will compare three cost savings allocation schemes based on the numerical results. In our experiments, meta-heuristic algorithms are applied to find the matches to minimize the overall travel distance. The above schemes are then used to allocate cost savings among participants. The results indicate that the proportional cos savings allocation scheme is more effective than the other schemes to allocate cost savings equally between the drivers and the passengers.
具有成本节约分配方案的拼车系统的混合萤火虫- de算法
拼车或共享出行已经引起了相关研究界的极大关注。大多数研究都集中在如何根据司机和乘客的需求进行匹配,以最小化总行程。由于成本节约是拼车系统的一个重要功能,成本节约的分配问题近年来引起了研究者的关注。文献中提出了几种简单的方案。例如,一个简单的方案是将节省的成本在司机和乘客之间平均分配。另一种方案是将节省的费用按参与者的原始旅行距离成比例分配给他们。虽然这些简单的方案很容易实现,但目前还没有研究通过应用不同的元启发式算法来比较它们在拼车系统中的有效性。本文将采用一种混合元启发式算法,即基于差分进化和萤火虫算法的混合萤火虫- de算法,对司机和乘客进行匹配。我们将根据数值结果比较三种成本节约分配方案。在我们的实验中,采用元启发式算法来寻找匹配,以最小化总旅行距离。然后使用上述方案在参与者之间分配节省的成本。结果表明,成本节约比例分配方案比其他方案更能有效地在司机和乘客之间平均分配成本节约。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信