Abstract
Ride-sharing schemes attempt to reduce road traffic by matching prospective passengers to drivers with spare seats in their cars. To be successful, such schemes require a critical mass of drivers and passengers. In current deployed implementations, the possible matches are based on heuristics, rather than real route times or distances. In some cases, the heuristics propose infeasible matches; in others, feasible matches are omitted. Poor ride matching is likely to deter participants from using the system. We develop a constraint-based model for acceptable ride matches which incorporates route plans and time windows. Through data analytics on a history of advertised schedules and agreed shared trips, we infer parameters for this model that account for 90 % of agreed trips. By applying the inferred model to the advertised schedules, we demonstrate that there is an imbalance between riders and passengers. We assess the potential benefits of persuading existing drivers to switch to becoming passengers if appropriate matches can be found, by solving the inferred model with and without switching. We demonstrate that flexible participation has the potential to reduce the number of unmatched participants by up to 80 %.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Agatz, N., Erera, A., Savelsbergh, M., Wang, X.: Optimization for dynamic ride-sharing: a review. Eur. J. Oper. Res. 223(2), 295–303 (2012)
Agatz, N.A., Erera, A.L., Savelsbergh, M.W., Wang, X.: Dynamic ride-sharing: a simulation study in metro atlanta. Transp. Res. Part B Methodol. 45(9), 1450–1464 (2011)
Armant, V., Brown, K.N.: Minimizing the driving distance in ride sharing systems. In: 26th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2014, Limassol, November 10–12, 2014, pp. 568–575 (2014)
Attanasio, A., Cordeau, J.F., Ghiani, G., Laporte, G.: Parallel tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem. Parallel Comput. 30(3), 377–387 (2004)
Berbeglia, G., Cordeau, J.F., Laporte, G.: Dynamic pickup and delivery problems. Eur. J. Oper. Res. 202(1), 8–15 (2010)
Cordeau, J.F., Laporte, G.: The dial-a-ride problem: models and algorithms. Ann. Oper. Res. 153(1), 29–46 (2007)
Furuhata, M., Dessouky, M., Ordóñez, F., Brunet, M.E., Wang, X., Koenig, S.: Ridesharing: the state-of-the-art and future directions. Transp. Res. Part B Methodol. 57(C), 28–46 (2013). http://ideas.repec.org/a/eee/transb/v57y2013icp28-46.html
Kamar, E., Horvitz, E.: Collaboration and shared plans in the open world: Studies of ridesharing. In: Proceedings of the 21st International Jont Conference on Artifical Intelligence, IJCAI 2009, pp. 187–194. Morgan Kaufmann Publishers Inc., San Francisco (2009)
Manna, C., Prestwich, S.: Online stochastic planning for taxi and ridesharing. In: 26th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2014, Limassol, November 10–12, 2014, pp. 906–913 (2014)
Muelas, S., LaTorre, A., Pena, J.M.: A variable neighborhood search algorithm for the optimization of a dial-a-ride problem in a large city. Expert Syst. Appl. 40(14), 5516–5531 (2013)
Schilde, M., Doerner, K.F., Hartl, R.F.: Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports. Comput. Oper. Res. 38(12), 1719–1730 (2011)
Simonin, G., O’Sullivan, B.: Optimisation for the ride-sharing problem: a complexity-based approach. In: ECAI 2014–21st European Conference on Artificial Intelligence, 18–22 August 2014, Czech Republic - Including Prestigious Applications of Intelligent Systems (PAIS 2014), pp. 831–836 (2014)
Yousaf, J., Li, J., Chen, L., Tang, J., Dai, X., Du, J.: Ride-Sharing: a multi source-destination path planning approach. In: Thielscher, M., Zhang, D. (eds.) AI 2012. LNCS, vol. 7691, pp. 815–826. Springer, Heidelberg (2012)
Acknowledgements
This work is funded by Science Foundation Ireland (SFI) under Grant Number SFI/12/RC/2289. Moreover, we would like to acknowledge our industrial partner Carma, and the reviewers for their fruitful remarks.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Armant, V., Horan, J., Mabub, N., Brown, K.N. (2015). Data Analytics and Optimisation for Assessing a Ride Sharing System. In: Fromont, E., De Bie, T., van Leeuwen, M. (eds) Advances in Intelligent Data Analysis XIV. IDA 2015. Lecture Notes in Computer Science(), vol 9385. Springer, Cham. https://doi.org/10.1007/978-3-319-24465-5_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-24465-5_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-24464-8
Online ISBN: 978-3-319-24465-5
eBook Packages: Computer ScienceComputer Science (R0)