{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T14:54:34Z","timestamp":1777388074172,"version":"3.51.4"},"reference-count":41,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2023,12,25]],"date-time":"2023-12-25T00:00:00Z","timestamp":1703462400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Science and Technology Council, Taiwan","award":["NSTC 111-2410-H-324-003"],"award-info":[{"award-number":["NSTC 111-2410-H-324-003"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.3390\/a17010009","type":"journal-article","created":{"date-parts":[[2023,12,25]],"date-time":"2023-12-25T23:00:12Z","timestamp":1703545212000},"page":"9","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"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"],"prefix":"10.3390","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0208-9937","authenticated-orcid":false,"given":"Fu-Shiung","family":"Hsieh","sequence":"first","affiliation":[{"name":"Department of Computer Science and Information Engineering, Chaoyang University of Technology, Taichung 413310, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2023,12,25]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1016\/j.sbspro.2011.08.062","article-title":"PoliUniPool: A carpooling system for universities","volume":"20","author":"Bruglieri","year":"2011","journal-title":"Procedia-Soc. Behav. Sci."},{"key":"ref_2","unstructured":"Hwang, K., and Giuliano, G. (2023, November 29). The Determinants of Ridesharing: Literature Review. Working Paper UCTC No. 38, The University of California Transportation Center. Available online: https:\/\/escholarship.org\/uc\/item\/3r91r3r4."},{"key":"ref_3","unstructured":"Uber (2023, November 29). Available online: https:\/\/www.uber.com."},{"key":"ref_4","unstructured":"Lyft (2023, November 29). Available online: https:\/\/www.lyft.com."},{"key":"ref_5","unstructured":"BlaBlaCar (2023, November 29). Available online: https:\/\/www.blablacar.com."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/j.ejor.2012.05.028","article-title":"Optimization for dynamic ride-sharing: A review","volume":"223","author":"Agatz","year":"2012","journal-title":"Eur. J. Oper. Res."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.trb.2013.08.012","article-title":"Ridesharing: The state-of-the-art and future direc-tions","volume":"57","author":"Furuhata","year":"2013","journal-title":"Transp. Res. Part B Methodol."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/j.trb.2019.02.003","article-title":"A survey of models and algorithms for optimizing shared mobility","volume":"123","author":"Mourad","year":"2019","journal-title":"Transp. Res. Part B Methodol."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"107080","DOI":"10.1016\/j.cie.2020.107080","article-title":"Optimizing ride-sharing operations in smart sustainable cities: Challenges and the need for agile algorithms","volume":"153","author":"Martins","year":"2021","journal-title":"Comput. Ind. Eng."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Ting, K.H., Lee, L.S., Pickl, S., and Seow, H.-V. (2021). Shared Mobility Problems: A Systematic Review on Types, Variants, Characteristics, and Solution Approaches. Appl. Sci., 11.","DOI":"10.3390\/app11177996"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1007\/s10489-018-1288-x","article-title":"A solution methodology for carpooling systems based on double auctions and cooperative coevolutionary particle swarms","volume":"49","author":"Hsieh","year":"2019","journal-title":"Appl. Intell."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Hsieh, F.S. (2020). A Comparative Study of Several Metaheuristic Algorithms to Optimize Monetary Incentive in Ridesharing Systems. ISPRS Int. J. Geo-Inf., 9.","DOI":"10.3390\/ijgi9100590"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Hsieh, F.-S. (2022). Development and Comparison of Ten Differential-Evolution and Particle Swarm-Optimization Based Algorithms for Discount-Guaranteed Ridesharing Systems. Appl. Sci., 12.","DOI":"10.3390\/app12199544"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Hsieh, F.S. (2022). Trust-Based Recommendation for Shared Mobility Systems Based on a Discrete Self-Adaptive Neighborhood Search Differential Evolution Algorithm. Electronics, 11.","DOI":"10.3390\/electronics11050776"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Hsieh, F.-S. (2021). A Comparison of Three Ridesharing Cost Savings Allocation Schemes Based on the Number of Acceptable Shared Rides. Energies, 14.","DOI":"10.3390\/en14216931"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Hsieh, F.-S. (2023). Improving Acceptability of Cost Savings Allocation in Ridesharing Systems Based on Analysis of Proportional Methods. Systems, 11.","DOI":"10.3390\/systems11040187"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/S0045-7825(99)00389-8","article-title":"An efficient constraint handling method for genetic algorithms","volume":"186","author":"Deb","year":"2000","journal-title":"Comput. Methods Appl. Mech. Eng."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/j.tra.2020.02.017","article-title":"Operational benefits and challenges of shared-ride automated mobility-on-demand services","volume":"134","author":"Hyland","year":"2020","journal-title":"Transp. Res. Part A Policy Pract."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Michalewicz, Z. (1992). Genetic Algorithms + Data Structures = Evolution Programs, Springer.","DOI":"10.1007\/978-3-662-02830-8"},{"key":"ref_20","unstructured":"Kennedy, J., and Eberhart, R.C. (December, January 27). Particle swarm optimization. Proceedings of the IEEE International Conference on Neural Networks, Perth, WA, Australia."},{"key":"ref_21","first-page":"169","article-title":"Firefly algorithms for multimodal optimization","volume":"Volume 5792","author":"Yang","year":"2009","journal-title":"Stochastic Algorithms: Foundations and Applications. SAGA 2009"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1023\/A:1008202821328","article-title":"Differential evolution\u2014A simple and efficient heuristic for global optimization over continuous spaces","volume":"11","author":"Storn","year":"1997","journal-title":"J. Global Optim."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"8091","DOI":"10.1007\/s11042-020-10139-6","article-title":"A review on genetic algorithm: Past, present, and future","volume":"80","author":"Katoch","year":"2021","journal-title":"Multimed. Tools Appl."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"10031","DOI":"10.1109\/ACCESS.2022.3142859","article-title":"Particle Swarm Optimization: A Comprehensive Survey","volume":"10","author":"Shami","year":"2022","journal-title":"IEEE Access"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1016\/j.neucom.2022.05.100","article-title":"A survey on firefly algorithms","volume":"500","author":"Li","year":"2022","journal-title":"Neurocomputing"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"3831","DOI":"10.1016\/j.aej.2021.09.013","article-title":"Differential evolution: A recent review based on state-of-the-art works","volume":"61","author":"Ahmad","year":"2022","journal-title":"Alex. Eng. J."},{"key":"ref_27","first-page":"611","article-title":"Comparison between genetic algorithms and particle swarm optimization","volume":"Volume 1447","author":"Porto","year":"1998","journal-title":"Evolutionary Programming VII, Proceedings of the 7th International Conference, ep98, San Diego, CA, USA, 25\u201327 March 1998"},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Hassan, R., Cohanim, B., and Weck, O.D. (2005, January 18\u201321). A comparison of particle swarm optimization and the genetic algorithm. Proceedings of the 46th AIAA\/ASME\/ASCE\/AHS\/ASC Structures, Structural Dynamics and Materials Conference, Structures, Structural Dynamics, and Materials and Collocated Conferences, Austin, TX, USA.","DOI":"10.2514\/6.2005-1897"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/978-3-540-70928-2_22","article-title":"Differential Evolution versus Genetic Algorithms in Multiobjective Optimization","volume":"Volume 4403","author":"Obayashi","year":"2007","journal-title":"Evolutionary Multi-Criterion Optimization"},{"key":"ref_30","first-page":"1784","article-title":"Self-adaptive Differential Evolution Algorithm for Numerical Optimization","volume":"2","author":"Qin","year":"2005","journal-title":"Proc. IEEE Congr. Evol. Comput."},{"key":"ref_31","first-page":"192","article-title":"Self-adaptive differential evolution","volume":"3801","author":"Omran","year":"2005","journal-title":"Proc. Comput. Intell. Secur. Lect. Notes Artif. Intell."},{"key":"ref_32","unstructured":"Huang, V.L., Qin, A.K., and Suganthan, P.N. (2006, January 16\u201321). Self-adaptive differential evolution algorithm for constrained real-parameter optimization. Proceedings of the 2006 IEEE International Conference on Evolutionary Computation, Vancouver, BC, Canada."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1109\/TEVC.2008.927706","article-title":"Differential evolution algorithm with strategy adaptation for global numerical optimization","volume":"13","author":"Qin","year":"2009","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1109\/TSMCB.2011.2167966","article-title":"An adaptive differential evolution algorithm with novel mutation and crossover strategies for global numerical optimization","volume":"42","author":"Islam","year":"2011","journal-title":"IEEE Trans. Syst. Man Cybern. Part B Cybern."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.future.2017.10.047","article-title":"Workload prediction in cloud using artificial neural network and adaptive differential evolution","volume":"81","author":"Kumar","year":"2021","journal-title":"Future Generation Comput. Syst."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"5559","DOI":"10.1007\/s00500-020-05554-8","article-title":"An improved adaptive hybrid firefly differential evolution algorithm for passive target localization","volume":"25","year":"2021","journal-title":"Soft. Comput."},{"key":"ref_37","unstructured":"Yang, Z., Tang, K., and Yao, X. (2008, January 1\u20136). Self-adaptive differential evolution with neighborhood search. Proceedings of the 2008 IEEE Congress on Evolutionary Computation, Hong Kong, China."},{"key":"ref_38","unstructured":"Michalewicz, Z., and Siarry, P. (2007). Advances in Metaheuristics for Hard Optimization, Springer."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/j.ejor.2003.11.018","article-title":"Solving the combinatorial double auction problem","volume":"164","author":"Xia","year":"2005","journal-title":"Eur. J. Oper. Res."},{"key":"ref_40","unstructured":"(2022, August 11). Data of Test Cases 1\u201310. Available online: https:\/\/drive.google.com\/drive\/folders\/19Zj69lRsQP8z0uuiJOqfkHBegCvZE2Pe?usp=sharing."},{"key":"ref_41","unstructured":"(2023, July 08). Data of Test Cases 11\u201314. Available online: https:\/\/drive.google.com\/drive\/folders\/1FxECvDt_5ZuXCuL0zNQUXza2Bg82G2Ds?usp=sharing."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/17\/1\/9\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T21:41:46Z","timestamp":1760132506000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/17\/1\/9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,25]]},"references-count":41,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,1]]}},"alternative-id":["a17010009"],"URL":"https:\/\/doi.org\/10.3390\/a17010009","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,25]]}}}