Abstract
The paper concerns a joint problem of matching carpoolers and planning common routes as a multiple criteria optimization problem. The model of the optimization problem, as well as the concept of solution procedure, is presented. The solution algorithm uses dynamic programming method and Dijkstra algorithm to obtain matches of the carpoolers and routes. The solution is evaluated by aggregated quality index taking into account preferences of carpoolers equally, concerning all the criteria. Preferences are obtained by AHP method.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
We use \( \overline{{1,{\rm Z}}} \;\mathop = \limits^{\Delta } \;\{ 1,2,3, \ldots ,{\rm Z}\} \) notation for a set of natural numbers from 1 to Z.
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)
Jorge, D., Correia, G.: Carsharing systems demand estimation and defined operations: a literature review. Eur. J. Transp. Infrastruct. Res. 13(3) (2013)
Hwang, K., Giuliano, G.: The Determinants of Ridesharing: Literature Review. Berkeley, California, UCTC Working Paper no 38 (1990)
Oliphant, M., Amey, A.: Dynamic Ridesharing: Carpooling Meets the Information Age (2010)
Turnbull, K.F.: HOV project case studies: history and institutional arrangements. Washington, D.C.: U.S. Department of Transportation ; Distributed in Cooperation with Technology Sharing Program (1992). Accessed 26 April 2012
Wauters, R.: Ride-sharing has arrived in Europe, and the race is on between BlaBlaCar and Carpooling.com (2014). http://tech.eu/features/481/ride-sharing-europe-carpooling-blablacar/. Accessed 11 June 2016
Amey, A., Attanucci, J., Mishalani, R.: Real-time ridesharing: opportunities and challenges in using mobile phone technology to improve rideshare services. Transp. Res. Rec.: J. Transp. Res. Board 2217, 103–110 (2011)
Shakshuki, E., Younas, M., Cho, S., Yasar, A.-U.-H., Knapen, L., Bellemans, T., Wets, G.: A conceptual design of an agent-based interaction model for the carpooling application. Procedia Comput. Sci. 10, 801–807 (2012)
Qian, Z., Zhang, M.H.: Modeling multi-modal morning commute in a one-to-one corridor network. Transp. Res. Part C: Emerg. Technol. 19(2), 254–269 (2011)
Androutsopoulos, K.N., Zografos, K.G.: Solving the multi-criteria time-dependent routing and scheduling problem in a multimodal fixed scheduled network. Eur. J. Oper. Res. 192(1), 18–28 (2009)
Bozkurt, S., Yazici, A., Keskin, K.: A multicriteria route planning approach considering driver preferences. In: 2012 IEEE International Conference on Vehicular Electronics and Safety (ICVES), pp. 324–328 (2012)
Granat, J., Guerriero, F.: The interactive analysis of the multicriteria shortest path problem by the reference point method. Eur. J. Oper. Res. 151(1), 103–118 (2003)
Guerriero, F., Musmanno, R.: Label correcting methods to solve multicriteria shortest path problems. J. Optim. Theory Appl. 111(3), 589–613 (2001)
Horn, M.E.T.: Multi-modal and demand-responsive passenger transport systems: a modelling framework with embedded control systems. Transp. Res. Part A: Policy Pract. 36(2), 167–188 (2002)
Jozefowicz, N., Semet, F., Talbi, E.-G.: Multi-objective vehicle routing problems. Eur. J. Oper. Res. 189(2), 293–309 (2008)
Nadi, S., Delavar, M.R.: Multi-criteria, personalized route planning using quantifier-guided ordered weighted averaging operators. Int. J. Appl. Earth Obs. Geoinf. 13(3), 322–335 (2011)
Niaraki, A.S., Kim, K.: Ontology based personalized route planning system using a multi-criteria decision making approach. Expert Syst. Appl. 36 (2, Part 1), 2250–2259 (2009)
Opasanon, S., Miller-Hooks, E.: Multicriteria adaptive paths in stochastic, time-varying networks. Eur. J. Oper. Res. 173(1), 72–91 (2006)
Pajor, T.: Multi-modal route planning. Master thesis, Univ. Karlsruhe (TH) (2009)
Yu, H.C., Lu, F.: A multi-modal route planning approach with an improved genetic algorithm. In: Advances in Geo-Spatial Information Science, vol. 1–0, pp. 193–202. CRC Press (2012)
Filcek, G., Gąsior, D.: Common Route Planning for Carpoolers – Model and Exact Algorithm. In J. Swiątek, A. Grzech, P. Swiątek, J. M. Tomczak (Eds.), Advances in Systems Science, pp. 543–551. Springer International Publishing (2014)
Shakshuki, E., Younas, M., Knapen, L., Keren, D., Yasar, A.-U.-H., Cho, S., Wets, G.: ANT 2012 and MobiWIS 2012 analysis of the co-routing problem in agent-based carpooling simulation. Procedia Comput. Sci. 10, 821–826 (2012)
Saaty, T.L.: Decision making with the analytic hierarchy process. Int. J. Serv. Sci. 1(1), 83 (2008)
Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 269–271 (1959)
Sniedovich, M.: Dynamic Programming: Foundations and Principles, Second Edition vol. 20105564. CRC Press (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Filcek, G., Żak, J. (2017). The Multiple Criteria Optimization Problem of Joint Matching Carpoolers and Common Route Planning. In: Świątek, J., Wilimowska, Z., Borzemski, L., Grzech, A. (eds) Information Systems Architecture and Technology: Proceedings of 37th International Conference on Information Systems Architecture and Technology – ISAT 2016 – Part III. Advances in Intelligent Systems and Computing, vol 523. Springer, Cham. https://doi.org/10.1007/978-3-319-46589-0_18
Download citation
DOI: https://doi.org/10.1007/978-3-319-46589-0_18
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-46588-3
Online ISBN: 978-3-319-46589-0
eBook Packages: EngineeringEngineering (R0)