Skip to main content
Top
Published in:
Cover of the book

2018 | OriginalPaper | Chapter

A New Approach for Learning User Preferences for a Ridesharing Application

Authors : Mojtaba Montazery, Nic Wilson

Published in: Transactions on Computational Collective Intelligence XXVIII

Publisher: Springer International Publishing

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

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.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Footnotes
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).
 
Literature
go back to reference Agatz, N., Erera, A., Savelsbergh, M., Wang, X.: Optimization for dynamic ride-sharing: a review. Eur. J. Oper. Res. 223(2), 295–303 (2012)CrossRefMATH Agatz, N., Erera, A., Savelsbergh, M., Wang, X.: Optimization for dynamic ride-sharing: a review. Eur. J. Oper. Res. 223(2), 295–303 (2012)CrossRefMATH
go back to reference 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)CrossRef 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)CrossRef
go back to reference Aiserman, M., Braverman, E., Rozonoer, L.: Theoretical foundations of the potential function method in pattern recognition. Avtomat. i Telemeh 25, 917–936 (1964) Aiserman, M., Braverman, E., Rozonoer, L.: Theoretical foundations of the potential function method in pattern recognition. Avtomat. i Telemeh 25, 917–936 (1964)
go back to reference 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)CrossRef 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)CrossRef
go back to reference 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)CrossRefMATH 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)CrossRefMATH
go back to reference Ben-Hur, A., Weston, J.: A User’s Guide to Support Vector Machines, pp. 223–239. Humana Press, Totowa (2010) Ben-Hur, A., Weston, J.: A User’s Guide to Support Vector Machines, pp. 223–239. Humana Press, Totowa (2010)
go back to reference Bergstra, J., Bengio, Y.: Random search for hyper-parameter optimization. J. Mach. Learn. Res. 13(1), 281–305 (2012)MathSciNetMATH Bergstra, J., Bengio, Y.: Random search for hyper-parameter optimization. J. Mach. Learn. Res. 13(1), 281–305 (2012)MathSciNetMATH
go back to reference Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)CrossRefMATH Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)CrossRefMATH
go back to reference Burges, C.J.: A tutorial on support vector machines for pattern recognition. Data Mining Knowl. Discov. 2(2), 121–167 (1998)CrossRef Burges, C.J.: A tutorial on support vector machines for pattern recognition. Data Mining Knowl. Discov. 2(2), 121–167 (1998)CrossRef
go back to reference 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)CrossRefMATH 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)CrossRefMATH
go back to reference Chan, N.D., Shaheen, S.A.: Ridesharing in North America: past, present, and future. Transp. Rev. 32(1), 93–112 (2012)CrossRef Chan, N.D., Shaheen, S.A.: Ridesharing in North America: past, present, and future. Transp. Rev. 32(1), 93–112 (2012)CrossRef
go back to reference 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) 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)
go back to reference 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)CrossRef 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)CrossRef
go back to reference Ghoseiri, K., Haghani, A.E., Hamedi, M.: Real-time rideshare matching problem (2011) Ghoseiri, K., Haghani, A.E., Hamedi, M.: Real-time rideshare matching problem (2011)
go back to reference Gönen, M., Heller, G.: Concordance probability and discriminatory power in proportional hazards regression. Biometrika 92(4), 965–970 (2005)MathSciNetCrossRefMATH Gönen, M., Heller, G.: Concordance probability and discriminatory power in proportional hazards regression. Biometrika 92(4), 965–970 (2005)MathSciNetCrossRefMATH
go back to reference 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) 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)
go back to reference Hwang, M., Kemp, J., Lerner-Lam, E., Neuerburg, N., Okunieff, P.: Advanced public transportation systems: state of the art update 2006. Technical report (2006) Hwang, M., Kemp, J., Lerner-Lam, E., Neuerburg, N., Okunieff, P.: Advanced public transportation systems: state of the art update 2006. Technical report (2006)
go back to reference Järvelin, K., Kekäläinen, J.: Cumulated gain-based evaluation of IR techniques. ACM Trans. Inf. Syst. (TOIS) 20(4), 422–446 (2002)CrossRef Järvelin, K., Kekäläinen, J.: Cumulated gain-based evaluation of IR techniques. ACM Trans. Inf. Syst. (TOIS) 20(4), 422–446 (2002)CrossRef
go back to reference 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) 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)
go back to reference Winter, S., Nittel, S.: Ad hoc shared-ride trip planning by mobile geosensor networks. Int. J. Geog. Inf. Sci. 20(8), 899–916 (2006)CrossRef Winter, S., Nittel, S.: Ad hoc shared-ride trip planning by mobile geosensor networks. Int. J. Geog. Inf. Sci. 20(8), 899–916 (2006)CrossRef
Metadata
Title
A New Approach for Learning User Preferences for a Ridesharing Application
Authors
Mojtaba Montazery
Nic Wilson
Copyright Year
2018
DOI
https://doi.org/10.1007/978-3-319-78301-7_1

Premium Partner