Abstract
The dramatic increment in the number of cars in cities makes numerous challenges including either air or noise pollution and traffic congestion. Outweighing these problems needs essential planning in urban management such as using new procedures in transportation systems. Sharing vehicles is one of the most useful methods which some countries have been experiencing it. In this issue, 2 or 3 people share a car, and it decreases running vehicles, and the urban traffic will be declined. This article uses a novel method to share cars based on Ant Colony Optimization Algorithm. The proposed model tries to find the best matching of passengers in cars so that the maximum of shared cars is found. Consequently, some vehicles will be switched off, and this helps to decrease the traffic. The results depict the proposed method turns off 41.8% of cars; besides, 27.8% of them carry 2, 3 or 4 passengers.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Böckmann, M.: The shared economy: it is time to start caring about sharing; value creating factors in the shared economy. Univ. Twente Fac. Manag. Gov. 350 (2013)
Fahnenschreiber, S., Gündling, F., Keyhani, M.H., Schnee, M.: A multi-modal routing approach combining dynamic ride-sharing and public transport. Transp. Res. Procedia 13, 176–183 (2016)
Wei, X., Dai, J., Sun, B.: Routing for taxi-pooling problem based on ant colony optimization algorithm. Rev. Fac. Ing. U. C. 31(7), 234–246 (2016)
Nourinejad, M., Roorda, M.J.: Agent based model for dynamic ridesharing. Transp. Res. Part C Emerg. Technol. 64, 117–132 (2016)
Huang, C., Zhang, D., Si, Y.W., Leung, S.C.: Tabu search for the real-world carpooling problem. J. Comb. Optim. 32(2), 492–512 (2016)
Rayle, L., Dai, D., Chan, N., Cervero, R., Shaheen, S.: Just a better taxi? A survey-based comparison of taxis, transit, and ridesourcing services in San Francisco. Transp. Policy 45, 168–178 (2016)
Santos, D.O., Xavier, E.C.: Taxi and ride sharing: A dynamic dial-a-ride problem with money as an incentive. Expert Syst. Appl. 42(19), 6728–6737 (2015)
Zhan, X., Szeto, W.Y., Sam, S.: An artificial bee colony algorithm for the dynamic taxi sharing problem (No. 19-03116) (2019)
Stiglic, M., Agatz, N., Savelsbergh, M., Gradisar, M.: Enhancing urban mobility: integrating ride-sharing and public transit. Comput. Oper. Res. 90, 12–21 (2018)
Simonetto, A., Monteil, J., Gambella, C.: Real-time city-scale ridesharing via linear assignment problems. Transp. Res. Part C Emerg. Technol. 101, 208–232 (2019)
Huang, S.C., Jiau, M.K., Liu, Y.P.: An ant path-oriented carpooling allocation approach to optimize the carpool service problem with time windows. IEEE Syst. J. 13(1), 994–1005 (2018)
Van Zuylen, H.J., Willumsen, L.G.: The most likely trip matrix estimated from traffic counts. Transp. Res. Part B Methodol. 14(3), 281–293 (1980)
Davoodi, M., Mesgari, M.S.: GIS-based route finding using ant colony optimization and urban traffic data from different sources. Int. Arch. Photogrammetry Remote Sens. Spat. Inf. Sci. 1, 129–133 (2015)
Claes, R., Holvoet, T.: Ant colony optimization applied to route planning using link travel time predictions. In: 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum, pp. 358–365 (2011)
Lipowski, A., Lipowska, D.: Roulette-wheel selection via stochastic acceptance. Phys. Stat. Mech. Appl. 391(6), 2193–2196 (2012)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Davoodi, M., Hasani, S. (2020). A Novel Car-Pooling Optimization Method Using Ant Colony Optimization Based on Network Analysis (Case Study: Tehran). In: Khalaf, M., Al-Jumeily, D., Lisitsa, A. (eds) Applied Computing to Support Industry: Innovation and Technology. ACRIT 2019. Communications in Computer and Information Science, vol 1174. Springer, Cham. https://doi.org/10.1007/978-3-030-38752-5_14
Download citation
DOI: https://doi.org/10.1007/978-3-030-38752-5_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-38751-8
Online ISBN: 978-3-030-38752-5
eBook Packages: Computer ScienceComputer Science (R0)