Skip to main content
Log in

Satisfying user preferences in optimised ridesharing services:

A multi-agent multi-objective optimisation approach

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

Ridesharing services offer on-demand transportation solutions while improving the utilization of the available capacity of the vehicles on the road. Profit, travel time, and cost are the commonly optimized objectives in current ridesharing services. Existing multi-objective optimization-based services mainly focus on maximizing profit for service providers while minimizing the travel time for passengers. However, various personal preferences (e.g., co-riders’ gender for a passenger or preferred area of service for a driver) should be considered when offering such services. Such preferences are often conflicting with one another and with the objectives such as cost and travel time. Therefore finding an optimized solution and satisfying such preferences simultaneously is challenging. To address this challenge, this paper proposes a Multi-agent, Multi-objective, Preference-based ridesharing model (MaMoP) that offers an optimized ridesharing solution while satisfying users’ preferences simultaneously. MaMoP uses social-reasoning techniques to model preferences and their relations and employs evolutionary algorithms to find an optimized solution.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

Notes

  1. The proofs of all the equations can be found in [31].

  2. The formulation of this objective function is similar to RSP objective function, details in Section 3.2

  3. Queuing can be the result of delay in an expected service. In this context, the delay can be caused by the waiting time for matching a ride and the the time that takes the vehicles to return to the station after completing a journey. In many related work, service time is always considered exponentially distributed [28].

References

  1. Adra SF (2007) Improving convergence, diversity and pertinency in multiobjective optimisation. Ph.D. thesis, Department of Automatic Control and Systems Engineering The University of Sheffield

  2. Agatz N, Erera A, Savelsbergh M, Wang X (2012) Optimization for dynamic ride-sharing: a review. Eur J Oper Res 223(2):295–303

    Article  Google Scholar 

  3. Alisoltani N, Zargayouna M, Leclercq L (2020) Real-time autonomous taxi service: an agent-based simulation. In: Agents and multi-agent systems: Technologies and applications 2020. Springer, pp 199–207

  4. Atahran A, Lenté C, T’kindt V (2014) A multicriteria dial-a-ride problem with an ecological measure and heterogeneous vehicles. J Multi-Criteria Decis Anal 21(5-6):279–298. https://doi.org/10.1002/mcda.1518

    Article  Google Scholar 

  5. Bailey JM, Golpayegani F, Clarke S (2019) Comasig: a collaborative multi-agent signal control to support senior drivers. In: 2019 IEEE Intelligent transportation systems conf. (ITSC). IEEE, pp 1239–1244

  6. Bistaffa F, Farinelli A, Chalkiadakis G, Ramchurn SD (2017) A cooperative game-theoretic approach to the social ridesharing problem. Artif Intell 246:86–117

    Article  MathSciNet  Google Scholar 

  7. Boussaid I, Lepagnot J, Siarry P (2013) A survey on optimization metaheuristics. Inf Sci 237:82–117

    Article  MathSciNet  Google Scholar 

  8. Bradstreet L, Barone L, While L, Huband S, Hingston P (2007) Use of the wfg toolkit and pisa for comparison of moeas. In: 2007 IEEE Symp. on comput. Intell. in multi-criteria decision-making, pp 382–389

  9. Burke EK, Gendreau M, Hyde M, Kendall G, Ochoa G, Özcan E, Qu R (2013) Hyper-heuristics: a survey of the state of the art. J Oper Res Soc 64(12):1695–1724

    Article  Google Scholar 

  10. de Carvalho VR, Larson K, Brandão AAF, Sichman JSA (2020) Applying social choice theory to solve engineering multi-objective optimization problems. J Control Autom Electr Syst (JCAE) 31(6):119–128

    Article  Google Scholar 

  11. de Carvalho VR, Sichman JS (2017) Applying copeland voting to design an agent-based hyper-heuristic. In: Proc. of the 16th conf. on autonomous agents and multiagent systems, pp 972– 980

  12. Chan ND, Shaheen SA (2012) Ridesharing in north america: past, present, and future. Transp Rev 32(1):93–112

    Article  Google Scholar 

  13. Correia G, Viegas JM (2011) Carpooling and carpool clubs: Clarifying concepts and assessing value enhancement possibilities through a stated preference web survey in lisbon, portugal. Transp Res A Policy Pract 45 (2):81–90

    Article  Google Scholar 

  14. Cubillos C, Urra E, Rodríguez N (2009) Application of genetic algorithms for the darptw problem. Int J Comput Commun Control 4(2)

  15. Cui Y, Makhija RSMS, Chen RB, He Q, Khani A (2020) Understanding and modeling the social preferences for riders in rideshare matching. Transportation:1–27

  16. Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182–197

    Article  Google Scholar 

  17. Fuloria S (2020) Passenger demand forecasting in the ridesharing context: A comparison of statistical and deep learning approaches. IUP J Appl Econ 19(1)

  18. Furuhata M, Dessouky M, Ordóñez F, Brunet ME, Wang X, Koenig S (2013) Ridesharing: The state-of-the-art and future directions. Transp Res B Methodol 57:28–46

    Article  Google Scholar 

  19. Galland S, Knapen L, Gaud N, Janssens D, Lamotte O, Koukam A, Wets G, et al. (2014) Multi-agent simulation of individual mobility behavior in carpooling. Transp Res Part C: Emerging Technol 45:83–98

    Article  Google Scholar 

  20. Ghanadbashi S, Golpayegani F (2021) An ontology-based intelligent traffic signal control model. International Intelligent Transportation Systems Conference (ITSC)

  21. Ghanadbashi S, Golpayegani F (2021) Using ontology to guide reinforcement learning agents in unseen situations. Appl Intell:1–17

  22. Ghoseiri K, Haghani A, Hamed M, et al. (2010) Real-time rideshare matching problem. Technical report, Mid-Atlantic Universities Transportation Center

  23. Golpayegani F, Dusparic I, Clarke S (2019) Using social dependence to enable neighbourly behaviour in open multi-agent systems. ACM Trans Intell Syst Technol (TIST) 10(3):1–31

    Article  Google Scholar 

  24. Golpayegani F, et al. (2018) Co-ride: Collaborative preference-based taxi-sharing and taxi-dispatch. In: 2018 IEEE 30Th int. Conf. on tools with artificial intelligence (ICTAI). IEEE, pp 864–871

  25. Guériau M, Dusparic I (2018) Samod: Shared autonomous mobility-on-demand using decentralized reinforcement learning. In: 2018 21St international conference on intelligent transportation systems (ITSC). IEEE, pp 1558–1563

  26. Gurumurthy KM, Kockelman KM (2020) Modeling americans’ autonomous vehicle preferences: a focus on dynamic ride-sharing, privacy & long-distance mode choices. Technol Forecast Soc Chang 150:119792

    Article  Google Scholar 

  27. Herbawi W, Weber M (2011) Comparison of multiobjective evolutionary algorithms for solving the multiobjective route planning in dynamic multi-hop ridesharing. In: 2011 IEEE Congr. of evolutionary computation (CEC). IEEE, pp 2099–2106

  28. Hertini E, Harisbaya C, Nahar J, et al. (2019) Queuing model using sojourn time distribution with single working vacation and vacation interruption. In: IOP Conference series: Materials science and engineering, vol 567. IOP Publishing, pp 012036

  29. Ho SC, Szeto W, Kuo YH, Leung JM, Petering M, Tou TW (2018) A survey of dial-a-ride problems: Literature review and recent developments. Transp Res B Methodol 111:395–421

    Article  Google Scholar 

  30. Hou L, Li D, Zhang D (2018) Ride-matching and routing optimisation: Models and a large neighbourhood search heuristic. Transp Res Part E: Logist Transp Rev 118:143–162

    Article  Google Scholar 

  31. Jacob J, Roet-Green R (2018) Ride solo or pool: designing price-service menus for a ride-sharing platform. Tech. rep. Simon Business School

  32. Jacob J, Roet-Green R (2021) Ride solo or pool: Designing price-service menus for a ride-sharing platform. European Journal of Operational Research

  33. Jorgensen RM, Larsen J, Bergvinsdottir KB (2007) Solving the dial-a-ride problem using genetic algorithms. J Oper Res Soc 58(10):1321–1331. https://doi.org/10.1057/palgrave.jors.2602287

    Article  Google Scholar 

  34. Kukkonen S, Lampinen J (2005) Gde3: The third evolution step of generalized differential evolution. In: 2005. The 2005 IEEE congr. on Evolutionary computation, vol 1. IEEE, pp 443–450

  35. Lasmar EL, de Paula FO, Rosa RL, Abrahão JI, Rodríguez DZ (2019) Rsrs: Ridesharing recommendation system based on social networks to improve the user’s qoe. IEEE Trans Intell Transp Syst 20(12):4728–4740

    Article  Google Scholar 

  36. Li L, Lin D, Pantelidis T, Chow J, Jabari SE (2019) An agent-based simulation for shared automated electric vehicles with vehicle relocation. In: 2019 IEEE Intelligent transportation systems conference (ITSC). IEEE, pp 3308–3313

  37. Li M, Qin Z, Jiao Y, Yang Y, Wang J, Wang C, Wu G, Ye J (2019) Efficient ridesharing order dispatching with mean field multi-agent reinforcement learning. In: The world wide web conference, pp 983–994

  38. Li W, Özcan E, John R (2019) A learning automata-based multiobjective hyper-heuristic. IEEE Trans Evol Comput 23(1):59–73

    Article  Google Scholar 

  39. Lin Y, Li W, Qiu F, Xu H (2012) Research on optimization of vehicle routing problem for ride-sharing taxi. Procedia-Soc Behav Sci 43:494–502

    Article  Google Scholar 

  40. Lu W, Liu L, Wang F, Zhou X, Hu G (2020) Two-phase optimization model for ride-sharing with transfers in short-notice evacuations. Transp Res Part C: Emerging Technol 114:272–296

    Article  Google Scholar 

  41. Masmoudi M, Braekers K, Masmoudi M, Dammak A (2017) A hybrid genetic algorithm for the heterogeneous dial-a-ride problem. Comput Oper Res 81:1–13

  42. Montazery M, Wilson N (2016) Learning user preferences in matching for ridesharing. In: ICAART (2), pp 63–73

  43. Nabil M, Sherif A, Mahmoud M, Alsharif A, Abdallah M (2019) Efficient and privacy-preserving ridesharing organization for transferable and non-transferable services. IEEE Transactions on Dependable and Secure Computing

  44. Nebro AJ, Durillo JJ, Vergne M (2015) Redesigning the jmetal multi-objective optimization framework. In: Proc. of the companion publication of the 2015 annual conf. on genetic and evolutionary computation, GECCO companion ’15. ACM, New York, pp 1093–1100

  45. Nourinejad M, Roorda MJ (2016) Agent based model for dynamic ridesharing. Transp Res Part C: Emerging Technol 64:117–132

    Article  Google Scholar 

  46. Riad M, Golpayegani F (2021) Run-time norms synthesis in multi-objective multi-agent systems. 20th International Conference on Autonomous Agents and Multiagent Systems COINE Workshop

  47. Saisubramanian S, Basich C, Zilberstein S, Goldman CV (2019) Satisfying social preferences in ridesharing services. In: 2019 IEEE Intelligent transportation systems conf. (ITSC). IEEE, pp 3720–3725

  48. Simão JS, Demazeau Y (2001) On social reasoning in multi-agent systems. Inteligencia Artificial. Revista Iberoamer Intel Artif 5(13):0

    Google Scholar 

  49. Simonetto A, Monteil J, Gambella C (2019) Real-time city-scale ridesharing via linear assignment problems. Transp Res Part C: Emerging Technol 101:208–232

    Article  Google Scholar 

  50. Storn R, Price K (1997) Differential evolution – a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11(4):341–359

    Article  MathSciNet  Google Scholar 

  51. Thaithatkul P, Seo T, Kusakabe T, Asakura Y (2015) A passengers matching problem in ridesharing systems by considering user preference. J Eastern Asia Soc Transp Stud 11:1416– 1432

    Google Scholar 

  52. Xu Z, Li Z, Guan Q, Zhang D, Li Q, Nan J, Liu C, Bian W, Ye J (2018) Large-scale order dispatch in on-demand ride-hailing platforms: a learning and planning approach. In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp 905–913

  53. Zhang H, Zhao J (2018) Mobility sharing as a preference matching problem. IEEE Trans Intell Transp Syst 20(7):2584–2592

    Article  Google Scholar 

  54. Zhang Q, Li H (2007) MOEA/d: A multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput

  55. Zitzler E, Laumanns M, Thiele L (2001) SPEA2: Improving the strength pareto evolutionary algorithm for multiobjective optimization. In: Evolutionary methods for design optimization and control with applications to industrial problems. CIMNE, pp 95–100

  56. Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithms: A comparative case study and the strength pareto approach. Trans Evol Comput 3(4):257–271

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Vinicius Renan de Carvalho.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

de Carvalho, V.R., Golpayegani, F. Satisfying user preferences in optimised ridesharing services:. Appl Intell 52, 11257–11272 (2022). https://doi.org/10.1007/s10489-021-02887-1

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-021-02887-1

Keywords

Navigation