A Self-Adaptive Meta-Heuristic Algorithm Based on Success Rate and Differential Evolution for Improving the Performance of Ridesharing Systems with a Discount Guarantee

IF 1.8 Q3 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Algorithms Pub Date : 2023-12-25 DOI:10.3390/a17010009
Fu-Shiung Hsieh
{"title":"A Self-Adaptive Meta-Heuristic Algorithm Based on Success Rate and Differential Evolution for Improving the Performance of Ridesharing Systems with a Discount Guarantee","authors":"Fu-Shiung Hsieh","doi":"10.3390/a17010009","DOIUrl":null,"url":null,"abstract":"One of the most significant financial benefits of a shared mobility mode such as ridesharing is cost savings. For this reason, a lot of studies focus on the maximization of cost savings in shared mobility systems. Cost savings provide an incentive for riders to adopt ridesharing. However, if cost savings are not properly allocated to riders or the financial benefit of cost savings is not sufficient to attract riders to use a ridesharing mode, riders will not accept a ridesharing mode even if the overall cost savings is significant. In a recent study, the concept of discount-guaranteed ridesharing has been proposed to provide an incentive for riders to accept ridesharing services through ensuring a minimal discount for drivers and passengers. In this study, an algorithm is proposed to improve the performance of the discount-guaranteed ridesharing systems. Our approach combines a success rate-based self-adaptation scheme with an evolutionary computation approach. We propose a new self-adaptive metaheuristic algorithm based on success rate and differential evolution for the Discount-Guaranteed Ridesharing Problem (DGRP). We illustrate effectiveness of the proposed algorithm by comparing the results obtained using our proposed algorithm with other competitive algorithms developed for this problem. Preliminary results indicate that the proposed algorithm outperforms other competitive algorithms in terms of performance and convergence rate. The results of this study are consistent with the empirical experience that two people working together are more likely to come to a correct decision than they would if working alone.","PeriodicalId":7636,"journal":{"name":"Algorithms","volume":"19 10","pages":""},"PeriodicalIF":1.8000,"publicationDate":"2023-12-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Algorithms","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3390/a17010009","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

One of the most significant financial benefits of a shared mobility mode such as ridesharing is cost savings. For this reason, a lot of studies focus on the maximization of cost savings in shared mobility systems. Cost savings provide an incentive for riders to adopt ridesharing. However, if cost savings are not properly allocated to riders or the financial benefit of cost savings is not sufficient to attract riders to use a ridesharing mode, riders will not accept a ridesharing mode even if the overall cost savings is significant. In a recent study, the concept of discount-guaranteed ridesharing has been proposed to provide an incentive for riders to accept ridesharing services through ensuring a minimal discount for drivers and passengers. In this study, an algorithm is proposed to improve the performance of the discount-guaranteed ridesharing systems. Our approach combines a success rate-based self-adaptation scheme with an evolutionary computation approach. We propose a new self-adaptive metaheuristic algorithm based on success rate and differential evolution for the Discount-Guaranteed Ridesharing Problem (DGRP). We illustrate effectiveness of the proposed algorithm by comparing the results obtained using our proposed algorithm with other competitive algorithms developed for this problem. Preliminary results indicate that the proposed algorithm outperforms other competitive algorithms in terms of performance and convergence rate. The results of this study are consistent with the empirical experience that two people working together are more likely to come to a correct decision than they would if working alone.
基于成功率和差分进化的自适应元算法,用于提高有折扣保证的共享乘车系统的性能
共享出行等共享交通模式最重要的经济效益之一就是节约成本。因此,很多研究都关注如何在共享交通系统中最大限度地节约成本。成本节约为乘客采用共享出行提供了动力。然而,如果节约的成本没有适当地分配给乘客,或者节约成本带来的经济利益不足以吸引乘客使用共乘模式,那么即使整体成本节约效果显著,乘客也不会接受共乘模式。最近的一项研究提出了 "折扣保证共乘 "的概念,通过确保司机和乘客获得最低折扣,激励乘客接受共乘服务。本研究提出了一种算法来提高折扣保证共享乘车系统的性能。我们的方法结合了基于成功率的自适应方案和进化计算方法。我们针对折扣保证共乘问题(DGRP)提出了一种基于成功率和差分进化的新的自适应元启发式算法。我们将所提算法的结果与针对该问题开发的其他竞争性算法进行比较,以说明所提算法的有效性。初步结果表明,所提出的算法在性能和收敛速度方面都优于其他竞争性算法。这项研究的结果与经验是一致的,即两个人一起工作比单独工作更有可能做出正确的决定。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Algorithms
Algorithms Mathematics-Numerical Analysis
CiteScore
4.10
自引率
4.30%
发文量
394
审稿时长
11 weeks
×
引用
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学术官方微信