Abstract
The ridesharing problem is to share personal vehicles by individuals (participants) with similar itineraries. A trip in the ridesharing problem is a participant and his/her itinerary. To realize a trip is to deliver the participant to his/her destination by a vehicle satisfying the itinerary requirement. We study two optimization problems in ridesharing: minimize the number of vehicles and minimize the total travel distance of vehicles to realize all trips. The minimization problems are complex and NP-hard because of many parameters. We simplify the problems by considering only the source, destination, vehicle capacity, detour distance and preferred path parameters. We prove that the simplified minimization problems are still NP-hard while a further simplified variant is polynomial time solvable. These suggest a boundary between the NP-hard and polynomial time solvable cases.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Agatz, N., Erera, A., Savelsbergh, M., Wang, X.: Dynamic ride-sharing: a simulation study in metro Atlanta. Transp. Res. Part B 45(9), 1450–1464 (2011)
Agatz, N., Erera, A., Savelsbergh, M., Wang, X.: Optimization for dynamic ride-sharing: a review. Eur. J. Oper. Res. 223, 295–303 (2012)
Antoon, K., Lenstra, J.K., Papadimitriou, C., Spieksma, F.: Interval scheduling: a survey. Naval Res. Logistics 54(5), 530–543 (2007)
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)
Brucker, P., Nordmann, L.: The k-track assignment problem. Computing 54, 97–122 (1994)
Chan, N.D., Shaheen, S.A.: Ridesharing in North America: past, present, and future. Transp. Rev. 32(1), 93–112 (2012)
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., Wang, X., Koenig, S.: Ridesharing: the state-of-the-art and future directions. Transp. Res. Part B: Methodol. 57, 28–46 (2013)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)
Ghoseiri, K., Haghani, A., Hamedi, M.: Real-time rideshare matching problem. Final report of UMD-2009-05. U.S. Department of Transportation (2011)
Herbawi, W., Weber, M.: The ridematching problem with time windows in dynamic ridesharing: a model and a genetic algorithm. In: Proceedings of ACM Genetic and Evolutionary Computation Conference (GECCO), pp. 1–8 (2012)
Huang, Y., Bastani, F., Jin, R., Wang, X.S.: Large scale real-time ridesharing with service guarantee on road networks. Proc. VLDB Endowment 7(14), 2017–2028 (2014)
Kelley, K.: Casual carpooling enhanced. J. Public Transp. 10(4), 119–130 (2007)
Morency, C.: The ambivalence of ridesharing. Transportation 34(2), 239–253 (2007)
Santos, A., McGuckin, N., Nakamoto, H.Y., Gray, D., Liss, S.: Summary of travel trends: 2009 national household travel survey. Technical report, US Department of Transportation Federal Highway Administration (2011)
Acknowledgment
The authors thank anonymous reviewers for their constructive comments. The work was partially supported by Canada NSERC Engage/Discovery Grants and China NSFC Grant 11531014.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
Gu, QP., Liang, J.L., Zhang, G. (2016). Algorithmic Analysis for Ridesharing of Personal Vehicles. In: Chan, TH., Li, M., Wang, L. (eds) Combinatorial Optimization and Applications. COCOA 2016. Lecture Notes in Computer Science(), vol 10043. Springer, Cham. https://doi.org/10.1007/978-3-319-48749-6_32
Download citation
DOI: https://doi.org/10.1007/978-3-319-48749-6_32
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-48748-9
Online ISBN: 978-3-319-48749-6
eBook Packages: Computer ScienceComputer Science (R0)