Skip to main content

A New Approach for Learning User Preferences for a Ridesharing Application

  • Chapter
  • First Online:
Transactions on Computational Collective Intelligence XXVIII

Abstract

Ridesharing has the potential to relieve some transportational issues such as traffic congestion, pollution and high travel costs. In this paper, we focus on the process of matching drivers and prospective riders more effectively, which is a crucial challenge in ridesharing. A novel approach is proposed in ride-matching which involves learning user preferences regarding the desirability of a choice of matching; this could then maintain high user satisfaction, thus encouraging repeat usage of the system. An SVM inspired method is developed which is able to learn a scoring function from a set of pairwise comparisons, and predicts the satisfaction degree of the user with respect to specific matches. To assess the proposed approach, we conducted some experiments on a commercial ridesharing data set. We compare the proposed approach with five rival strategies and methods, and the results clearly show the merits of our approach.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    https://www.gocarma.com/.

  2. 2.

    The original formula is \(\text {DCG}_p=rel_1+\sum _{i=2}^{p}\frac{rel_i}{\log _2(i)}\). It can be seen that the coefficient of the first term (\(rel_1\)) and the second term’s (\(rel_2\)) are equal. To give a smaller penalty value to the first term, we divided \(rel_1\) by 0.4 (instead of 1).

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)

    Article  MATH  Google Scholar 

  • 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)

    Article  Google Scholar 

  • Aiserman, M., Braverman, E., Rozonoer, L.: Theoretical foundations of the potential function method in pattern recognition. Avtomat. i Telemeh 25, 917–936 (1964)

    Google Scholar 

  • Amey, A., Attanucci, J., Mishalani, R.: Real-time ridesharing - the opportunities and challenges of utilizing mobile phone technology to improve rideshare services. Transp. Res. Rec. J. Transp. Res. Board 2217(1), 103–110 (2011)

    Article  Google Scholar 

  • Baldacci, R., Maniezzo, V., Mingozzi, A.: An exact method for the car pooling problem based on Lagrangean column generation. Oper. Res. 52(3), 422–439 (2004)

    Article  MATH  Google Scholar 

  • Ben-Hur, A., Weston, J.: A User’s Guide to Support Vector Machines, pp. 223–239. Humana Press, Totowa (2010)

    Google Scholar 

  • Bergstra, J., Bengio, Y.: Random search for hyper-parameter optimization. J. Mach. Learn. Res. 13(1), 281–305 (2012)

    MathSciNet  MATH  Google Scholar 

  • Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)

    Book  MATH  Google Scholar 

  • Burges, C.J.: A tutorial on support vector machines for pattern recognition. Data Mining Knowl. Discov. 2(2), 121–167 (1998)

    Article  Google Scholar 

  • Calvo, R.W., de Luigi, F., Haastrup, P., Maniezzo, V.: A distributed geographic information system for the daily car pooling problem. Comput. Oper. Res. 31(13), 2263–2278 (2004)

    Article  MATH  Google Scholar 

  • Chan, N.D., Shaheen, S.A.: Ridesharing in North America: past, present, and future. Transp. Rev. 32(1), 93–112 (2012)

    Article  Google Scholar 

  • Chaube, V., Kavanaugh, A.L., Perez-Quinones, M.A.: Leveraging social networks to embed trust in rideshare programs. In: 2010 43rd Hawaii International Conference on System Sciences (HICSS), pp. 1–8. IEEE (2010)

    Google Scholar 

  • Duggan, M., Smith, A.: Cell internet use 2013. Pew Research Center (2013). http://www.pewinternet.org/2013/09/16/cell-internet-use-2013/

  • Emarketer. 2 billion consumers worldwide to get smart(phones) by 2016 (2016). http://www.emarketer.com/Article/2-Billion-Consumers-Worldwide-Smartphones-by-2016/1011694

  • 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, 28–46 (2013)

    Article  Google Scholar 

  • Ghoseiri, K., Haghani, A.E., Hamedi, M.: Real-time rideshare matching problem (2011)

    Google Scholar 

  • Gönen, M., Heller, G.: Concordance probability and discriminatory power in proportional hazards regression. Biometrika 92(4), 965–970 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  • Herbawi, W.M., Weber, M.: A genetic and insertion heuristic algorithm for solving the dynamic ridematching problem with time windows. In: Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation. ACM, pp. 385–392 (2012)

    Google Scholar 

  • Hwang, M., Kemp, J., Lerner-Lam, E., Neuerburg, N., Okunieff, P.: Advanced public transportation systems: state of the art update 2006. Technical report (2006)

    Google Scholar 

  • Järvelin, K., Kekäläinen, J.: Cumulated gain-based evaluation of IR techniques. ACM Trans. Inf. Syst. (TOIS) 20(4), 422–446 (2002)

    Article  Google Scholar 

  • Joachims, T.: Optimizing search engines using clickthrough data. In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2002, pp. 133–142. ACM, New York (2002)

    Google Scholar 

  • Saranow, J.: Carpooling for grown-ups—high gas prices, new services give ride-sharing a boost; rating your fellow rider. Wall Street J. 2 Feb 2006. https://www.wsj.com/articles/SB113884611734062840

  • Smith, A.: US smartphone use in 2015. Pew Research Center (2015). http://www.pewinternet.org/2015/04/01/us-smartphone-use-in-2015/

  • Winter, S., Nittel, S.: Ad hoc shared-ride trip planning by mobile geosensor networks. Int. J. Geog. Inf. Sci. 20(8), 899–916 (2006)

    Article  Google Scholar 

  • Zickuhr, K.: Three-quarters of smartphone owners use location-based services. Pew Research Center (2012). http://www.pewinternet.org/2012/05/11/three-quarters-of-smartphone-owners-use-location-based-services/

Download references

Acknowledgment

This publication has emanated from research supported in part by a research grant from Science Foundation Ireland (SFI) under Grant Number SFI/12/RC/2289, and also supported by Carma (http://carmacarpool.com). We are grateful for helpful discussions with Vincent Armant, Cristina Cornelio, Martin Gerner, Barry O’Sullivan, Conor Roche and Gilles Simonin.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mojtaba Montazery .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Montazery, M., Wilson, N. (2018). A New Approach for Learning User Preferences for a Ridesharing Application. In: Nguyen, N., Kowalczyk, R., van den Herik, J., Rocha, A., Filipe, J. (eds) Transactions on Computational Collective Intelligence XXVIII. Lecture Notes in Computer Science(), vol 10780. Springer, Cham. https://doi.org/10.1007/978-3-319-78301-7_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-78301-7_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-78300-0

  • Online ISBN: 978-3-319-78301-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics