{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T09:33:54Z","timestamp":1782812034101,"version":"3.54.5"},"reference-count":75,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,9,14]],"date-time":"2021-09-14T00:00:00Z","timestamp":1631577600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,9,14]],"date-time":"2021-09-14T00:00:00Z","timestamp":1631577600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100008559","name":"Klima- und Energiefonds","doi-asserted-by":"publisher","award":["853767"],"award-info":[{"award-number":["853767"]}],"id":[{"id":"10.13039\/100008559","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["P 31366"],"award-info":[{"award-number":["P 31366"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Johannes Kepler University Linz"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2022,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The aim of the bi-objective multimodal car-sharing problem (BiO-MMCP) is to determine the optimal mode of transport assignment for trips and to schedule the routes of available cars and users whilst minimizing cost and maximizing user satisfaction. We investigate the BiO-MMCP from a user-centred point of view. As user satisfaction is a crucial aspect in shared mobility systems, we consider user preferences in a second objective. Users may choose and rank their preferred modes of transport for different times of the day. In this way, we account for, e.g., different traffic conditions throughout the planning horizon. We study different variants of the problem. In the base problem, the sequence of tasks a user has to fulfil is fixed in advance and travel times as well as preferences are constant over the planning horizon. In variant 2, time-dependent travel times and preferences are introduced. In variant 3, we examine the challenges when allowing additional routing decisions. Variant 4 integrates variants 2 and 3. For this last variant, we develop a branch-and-cut algorithm which is embedded in two bi-objective frameworks, namely the <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\epsilon $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>\u03f5<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-constraint method and a weighting binary search method. Computational experiments show that the branch-and cut algorithm outperforms the MIP formulation and we discuss changing solutions along the Pareto frontier.<\/jats:p>","DOI":"10.1007\/s00291-021-00631-2","type":"journal-article","created":{"date-parts":[[2021,9,14]],"date-time":"2021-09-14T10:02:51Z","timestamp":1631613771000},"page":"307-348","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["The bi-objective multimodal car-sharing problem"],"prefix":"10.1007","volume":"44","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4891-1594","authenticated-orcid":false,"given":"Miriam","family":"Enzi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sophie N.","family":"Parragh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jakob","family":"Puchinger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,9,14]]},"reference":[{"key":"631_CR1","doi-asserted-by":"publisher","first-page":"784","DOI":"10.1016\/j.jclepro.2018.05.046","volume":"193","author":"HKE Abad","year":"2018","unstructured":"Abad HKE, Vahdani B, Sharifi M, Etebari F (2018) A bi-objective model for pickup and delivery pollution-routing problem with integration and consolidation shipments in cross-docking system. J Clean Prod 193:784\u2013801. https:\/\/doi.org\/10.1016\/j.jclepro.2018.05.046","journal-title":"J Clean Prod"},{"key":"631_CR2","unstructured":"Adelgren N, Gupte A (2017) Branch-and-bound for biobjective mixed integer programming. https:\/\/arxiv.org\/abs\/1709.03668"},{"key":"631_CR3","doi-asserted-by":"publisher","first-page":"r7","DOI":"10.1017\/dsj.2019.6","volume":"5","author":"O Al Maghraoui","year":"2019","unstructured":"Al Maghraoui O, Vallet F, Puchinger J, Yannou B (2019) Modeling traveler experience for designing urban mobility systems. Des Sci 5:r7. https:\/\/doi.org\/10.1017\/dsj.2019.6","journal-title":"Des Sci"},{"issue":"2","key":"631_CR4","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s12351-015-0173-1","volume":"15","author":"D Alexiou","year":"2015","unstructured":"Alexiou D, Katsavounis S (2015) A multi-objective transportation routing problem. Oper Res Int Journal 15(2):199\u2013211. https:\/\/doi.org\/10.1007\/s12351-015-0173-1","journal-title":"Oper Res Int Journal"},{"key":"631_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2019.07.049","author":"A Anderluh","year":"2019","unstructured":"Anderluh A, Nolz PC, Hemmelmayr VC, Crainic TG (2019) Multi-objective optimization of a two-echelon vehicle routing problem with vehicle synchronization and 'grey zone' customers arising in urban logistics. Eur J Oper Res. https:\/\/doi.org\/10.1016\/j.ejor.2019.07.049","journal-title":"Eur J Oper Res"},{"key":"631_CR7","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/j.trc.2017.06.013","volume":"82","author":"KN Androutsopoulos","year":"2017","unstructured":"Androutsopoulos KN, Zografos KG (2017) An integrated modelling approach for the bicriterion vehicle routing and scheduling problem with environmental considerations. Transp Res Part C Emerg Technol 82:180\u2013209. https:\/\/doi.org\/10.1016\/j.trc.2017.06.013","journal-title":"Transp Res Part C Emerg Technol"},{"issue":"1","key":"631_CR8","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1287\/mnsc.25.1.73","volume":"25","author":"YP Aneja","year":"1979","unstructured":"Aneja YP, Nair KPK (1979) Bicriteria transportation problem. Manag Sci 25(1):73\u201378","journal-title":"Manag Sci"},{"issue":"2","key":"631_CR9","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1002\/1097-0037(200009)36:2%3c69::AID-NET1%3e3.0.CO;2-Q","volume":"36","author":"N Ascheuer","year":"2000","unstructured":"Ascheuer N, Fischetti M, Gr\u00f6tschel M (2000) A polyhedral study of the asymmetric traveling salesman problem with time windows. Networks 36(2):69\u201379. https:\/\/doi.org\/10.1002\/1097-0037(200009)36:2<69::AID-NET1>3.0.CO;2-Q","journal-title":"Networks"},{"key":"631_CR10","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.cor.2017.06.024","volume":"88","author":"H Ben Ticha","year":"2017","unstructured":"Ben Ticha H, Absi N, Feillet D, Quilliot A (2017) Empirical analysis for the VRPTW with a multigraph representation for the road network. Comput Oper Res 88:103\u2013116","journal-title":"Comput Oper Res"},{"key":"631_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2018.11.001","author":"H Ben Ticha","year":"2018","unstructured":"Ben Ticha H, Absi N, Feillet D, Quilliot A (2018) Multigraph modeling and adaptive large neighborhood search for the vehicle routing problem with time windows. Comput Oper Res. https:\/\/doi.org\/10.1016\/j.cor.2018.11.001","journal-title":"Comput Oper Res"},{"key":"631_CR12","doi-asserted-by":"publisher","DOI":"10.1002\/net.21852","author":"H Ben Ticha","year":"2019","unstructured":"Ben Ticha H, Absi N, Feillet D, Quilliot A, van Woensel T (2019) A branch-and-price algorithm for the vehicle routing problem with time windows on a road network. Networks. https:\/\/doi.org\/10.1002\/net.21852","journal-title":"Networks"},{"issue":"1","key":"631_CR13","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.ejor.2007.12.014","volume":"194","author":"JF B\u00e9rub\u00e9","year":"2009","unstructured":"B\u00e9rub\u00e9 JF, Gendreau M, Potvin JY (2009) An exact $$\\epsilon $$-constraint method for bi-objective combinatorial optimization problems: application to the traveling salesman problem with profits. Eur J Oper Res 194(1):39\u201350","journal-title":"Eur J Oper Res"},{"issue":"4","key":"631_CR14","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1287\/ijoc.2015.0657","volume":"27","author":"N Boland","year":"2015","unstructured":"Boland N, Charkhgard H, Savelsbergh M (2015) A criterion space search algorithm for biobjective integer programming: The balanced box method. Inf J Comput 27(4):735\u2013754. https:\/\/doi.org\/10.1287\/ijoc.2015.0657","journal-title":"Inf J Comput"},{"issue":"2","key":"631_CR15","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1016\/j.ejor.2015.07.028","volume":"248","author":"K Braekers","year":"2016","unstructured":"Braekers K, Hartl RF, Parragh SN, Tricoire F (2016) A bi-objective home care scheduling problem: analyzing the trade-off between costs and client inconvenience. Eur J Oper Res 248(2):428\u2013443. https:\/\/doi.org\/10.1016\/j.ejor.2015.07.028","journal-title":"Eur J Oper Res"},{"key":"631_CR16","unstructured":"Bundesverband CarSharing eV (2020) CarSharing in Deutschland. https:\/\/www.carsharing.de\/sites\/default\/files\/uploads\/infografiken_jahresbericht_2020-02.jpg. Last accessed on 28 May 2020"},{"issue":"13","key":"631_CR17","doi-asserted-by":"publisher","first-page":"2263","DOI":"10.1016\/S0305-0548(03)00186-2","volume":"31","author":"RW Calvo","year":"2004","unstructured":"Calvo RW, de Luigi F, Haastrup P, Maniezzo V (2004) A distributed geographic information system for the daily car pooling problem. Comput Oper Res 31(13):2263\u20132278","journal-title":"Comput Oper Res"},{"issue":"3","key":"631_CR18","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1016\/j.omega.2008.02.001","volume":"37","author":"M Caramia","year":"2009","unstructured":"Caramia M, Guerriero F (2009) A heuristic approach to long-haul freight transportation with multiple objective functions. Omega 37(3):600\u2013614","journal-title":"Omega"},{"key":"631_CR19","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s10288-016-0306-2","volume":"14(3):223\u2013259","author":"D Cattaruzza","year":"2016","unstructured":"Cattaruzza D, Absi N, Feillet D (2016) Vehicle routing problems with multiple trips. 4OR 14(3):223\u2013259:223\u2013259. https:\/\/doi.org\/10.1007\/s10288-016-0306-2","journal-title":"4OR"},{"issue":"1","key":"631_CR20","doi-asserted-by":"publisher","first-page":"37","DOI":"10.3141\/2416-05","volume":"2416","author":"F Ciari","year":"2014","unstructured":"Ciari F, Bock B, Balmer M (2014) Modeling station-based and free-floating carsharing demand: test case study for Berlin. Transp Res Rec 2416(1):37\u201347","journal-title":"Transp Res Rec"},{"key":"631_CR21","unstructured":"CIVITAS 202 (2020) Eccentric. https:\/\/civitas.eu\/eccentric. Last accessed on 27 May 2020"},{"issue":"1","key":"631_CR5","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/j.tre.2011.06.003","volume":"48","author":"GH de Almeida Correia","year":"2012","unstructured":"de Almeida Correia GH, Antunes AP (2012) Optimization approach to depot location and trip selection in one-way carsharing systems. Transp Res Part E Logist Transp Rev 48(1):233\u2013247","journal-title":"Transp Res Part E Logist Transp Rev"},{"key":"631_CR22","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1007\/3-540-45356-3_83","volume-title":"Parallel problem solving from nature PPSN VI","author":"K Deb","year":"2000","unstructured":"Deb K, Agrawal S, Pratap A, Meyarivan T (2000) A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: Nsga-ii. In: Schoenauer M, Deb K, Rudolph G, Yao X, Lutton E, Merelo JJ, Schwefel HP (eds) Parallel problem solving from nature PPSN VI. Springer, Berlin, Heidelberg, pp 849\u2013858"},{"issue":"3","key":"631_CR23","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1016\/j.ejor.2013.08.002","volume":"232","author":"E Demir","year":"2014","unstructured":"Demir E, Bekta\u015f T, Laporte G (2014) The bi-objective pollution-routing problem. Eur J Oper Res 232(3):464\u2013478. https:\/\/doi.org\/10.1016\/j.ejor.2013.08.002","journal-title":"Eur J Oper Res"},{"issue":"3","key":"631_CR24","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1016\/j.ejor.2016.03.006","volume":"253","author":"C Doppstadt","year":"2016","unstructured":"Doppstadt C, Koberstein A, Vigo D (2016) The hybrid electric vehicle - traveling salesman problem. Eur J Oper Res 253(3):825\u2013842. https:\/\/doi.org\/10.1016\/j.ejor.2016.03.006","journal-title":"Eur J Oper Res"},{"issue":"2","key":"631_CR25","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1049\/iet-its.2013.0156","volume":"9","author":"PM d\u2019Orey","year":"2014","unstructured":"d\u2019Orey PM, Ferreira M (2014) Can ride-sharing become attractive? a case study of taxi-sharing employing a simulation modelling approach. IET Intel Transp Syst 9(2):210\u2013220","journal-title":"IET Intel Transp Syst"},{"key":"631_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/0-306-48107-3_8","volume-title":"Multiobjective combinatorial optimization\u2013theory, methodology, and applications","author":"M Ehrgott","year":"2003","unstructured":"Ehrgott M, Gandibleux X (2003) Multiobjective combinatorial optimization\u2013theory, methodology, and applications. Springer, Boston, MA. https:\/\/doi.org\/10.1007\/0-306-48107-3_8"},{"issue":"3","key":"631_CR27","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1016\/j.ejor.2017.02.004","volume":"260","author":"M Ehrgott","year":"2017","unstructured":"Ehrgott M, Ljubi\u0107 I, Parragh SN (2017) Feature cluster: recent advances in exact methods for multi-objective optimisation. Eur J Oper Res 260(3):805\u2013806. https:\/\/doi.org\/10.1016\/j.ejor.2017.02.004","journal-title":"Eur J Oper Res"},{"issue":"4","key":"631_CR28","doi-asserted-by":"publisher","first-page":"1472","DOI":"10.1016\/j.cie.2009.05.009","volume":"57","author":"B Eksioglu","year":"2009","unstructured":"Eksioglu B, Vural AV, Reisman A (2009) The vehicle routing problem: a taxonomic review. Comput Ind Eng 57(4):1472\u20131483. https:\/\/doi.org\/10.1016\/j.cie.2009.05.009","journal-title":"Comput Ind Eng"},{"key":"631_CR29","unstructured":"Enzi M, Parragh SN, Pisinger D (2020a) Modeling and solving a vehicle-sharing problem. https:\/\/arxiv.org\/abs\/2003.08207"},{"key":"631_CR30","doi-asserted-by":"crossref","unstructured":"Enzi M, Parragh SN, Pisinger D, Prandtstetter M (2020b) Modeling and solving the multimodal car- and ride-sharing problem. https:\/\/arxiv.org\/abs\/2001.05490","DOI":"10.1007\/s00291-021-00631-2"},{"issue":"2","key":"631_CR31","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1016\/j.ejor.2019.02.048","volume":"277","author":"M Eskandarpour","year":"2019","unstructured":"Eskandarpour M, Ouelhadj D, Hatami S, Juan AA, Khosravi B (2019) Enhanced multi-directional local search for the bi-objective heterogeneous vehicle routing problem with multiple driving ranges. Eur J Oper Res 277(2):479\u2013491. https:\/\/doi.org\/10.1016\/j.ejor.2019.02.048","journal-title":"Eur J Oper Res"},{"key":"631_CR32","unstructured":"Fahrrad W (2020) Radfahren in Zahlen. https:\/\/www.fahrradwien.at\/radfahren-in-zahlen\/radzahlen-2019\/. Last accessed on 27 May 2020"},{"key":"631_CR33","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1016\/j.scs.2017.09.020","volume":"37","author":"F Ferrero","year":"2018","unstructured":"Ferrero F, Perboli G, Rosano M, Vesco A (2018) Car-sharing services: an annotated review. Sustain Cities Soc 37:501\u2013518. https:\/\/doi.org\/10.1016\/j.scs.2017.09.020","journal-title":"Sustain Cities Soc"},{"issue":"1","key":"631_CR34","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.ejor.2009.10.002","volume":"204","author":"T Garaix","year":"2010","unstructured":"Garaix T, Artigues C, Feillet D, Josselin D (2010) Vehicle routing problems with alternative paths: an application to on-demand transportation. Eur J Oper Res 204(1):62\u201375. https:\/\/doi.org\/10.1016\/j.ejor.2009.10.002","journal-title":"Eur J Oper Res"},{"key":"631_CR35","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.cor.2015.06.001","volume":"64","author":"M Gendreau","year":"2015","unstructured":"Gendreau M, Ghiani G, Guerriero E (2015) Time-dependent routing problems: a review. Comput Oper Res 64:189\u2013197. https:\/\/doi.org\/10.1016\/j.cor.2015.06.001","journal-title":"Comput Oper Res"},{"key":"631_CR36","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1016\/j.swevo.2018.08.012","volume":"44","author":"SF Ghannadpour","year":"2019","unstructured":"Ghannadpour SF, Zarrabi A (2019) Multi-objective heterogeneous vehicle routing and scheduling problem with energy minimizing. Swarm Evol Comput 44:728\u2013747. https:\/\/doi.org\/10.1016\/j.swevo.2018.08.012","journal-title":"Swarm Evol Comput"},{"issue":"5","key":"631_CR37","doi-asserted-by":"publisher","first-page":"1126","DOI":"10.1016\/j.net.2016.04.004","volume":"48","author":"R Gharari","year":"2016","unstructured":"Gharari R, Poursalehi N, Abbasi M, Aghaie M (2016) Implementation of strength pareto evolutionary algorithm ii in the multiobjective burnable poison placement optimization of kwu pressurized water reactor. Nucl Eng Technol 48(5):1126\u20131139. https:\/\/doi.org\/10.1016\/j.net.2016.04.004","journal-title":"Nucl Eng Technol"},{"key":"631_CR38","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/j.cor.2018.11.013","volume":"110","author":"K Govindan","year":"2019","unstructured":"Govindan K, Jafarian A, Nourbakhsh V (2019) Designing a sustainable supply chain network integrated with vehicle routing: a comparison of hybrid swarm intelligence metaheuristics. Comput Oper Res 110:220\u2013235. https:\/\/doi.org\/10.1016\/j.cor.2018.11.013","journal-title":"Comput Oper Res"},{"issue":"3","key":"631_CR39","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/s10696-017-9297-3","volume":"30","author":"J Grabenschweiger","year":"2018","unstructured":"Grabenschweiger J, Tricoire F, Doerner KF (2018) Finding the trade-off between emissions and disturbance in an urban context. Flex Serv Manuf J 30(3):554\u2013591. https:\/\/doi.org\/10.1007\/s10696-017-9297-3","journal-title":"Flex Serv Manuf J"},{"key":"631_CR40","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.trb.2016.10.013","volume":"95","author":"Y Huang","year":"2017","unstructured":"Huang Y, Zhao L, van Woensel T, Gross JP (2017) Time-dependent vehicle routing problem with path flexibility. Transp Res Part B Methodol 95:169\u2013175. https:\/\/doi.org\/10.1016\/j.trb.2016.10.013","journal-title":"Transp Res Part B Methodol"},{"issue":"2","key":"631_CR41","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/j.ejor.2007.05.055","volume":"189","author":"N Jozefowiez","year":"2008","unstructured":"Jozefowiez N, Semet F, Talbi EG (2008) Multi-objective vehicle routing problems. Eur J Oper Res 189(2):293\u2013309. https:\/\/doi.org\/10.1016\/j.ejor.2007.05.055","journal-title":"Eur J Oper Res"},{"key":"631_CR42","unstructured":"MA 18 - Stadtentwicklung und Stadtplanung Wien (2015) Carsharing wien evaluierung. https:\/\/www.wien.gv.at\/stadtentwicklung\/studien\/pdf\/b008470.pdf. Last accessed on 28 May 2020"},{"key":"631_CR43","unstructured":"MA 46 (2020) Entwicklung des Radverkehrsnetzes in Wien (2000-2019). https:\/\/www.wien.gv.at\/verkehr\/radfahren\/pdf\/fakten-1.pdf. Last accessed on 27 May 2020"},{"issue":"3","key":"631_CR44","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/s12652-016-0366-3","volume":"7","author":"M Maciejewski","year":"2016","unstructured":"Maciejewski M, Salanova JM, Bischoff J, Estrada M (2016) Large-scale microscopic simulation of taxi services. Berlin and barcelona case studies. J Ambient Intell Humaniz Comput 7(3):385\u2013393","journal-title":"J Ambient Intell Humaniz Comput"},{"key":"631_CR45","unstructured":"Martin K (2020) Pkw-bestand in wien bis 2019. https:\/\/de.statista.com\/statistik\/daten\/studie\/683923\/umfrage\/pkw-bestand-in-wien\/. Last accessed on 27 May 2020"},{"key":"631_CR46","doi-asserted-by":"publisher","DOI":"10.1057\/jors.2014.92","author":"I Mart\u00ednez-Salazar","year":"2015","unstructured":"Mart\u00ednez-Salazar I, \u00c1ngel Bello F, Alvarez A (2015) A customer-centric routing problem with multiple trips of a single vehicle. J Oper Res Soc. https:\/\/doi.org\/10.1057\/jors.2014.92","journal-title":"J Oper Res Soc"},{"issue":"4","key":"631_CR47","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1002\/net.21876","volume":"73","author":"P Matl","year":"2019","unstructured":"Matl P, Hartl RF, Vidal T (2019) Leveraging single-objective heuristics to solve bi-objective problems: heuristic box splitting and its application to vehicle routing. Networks 73(4):382\u2013400. https:\/\/doi.org\/10.1002\/net.21876","journal-title":"Networks"},{"key":"631_CR48","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/j.trb.2019.02.003","volume":"123","author":"A Mourad","year":"2019","unstructured":"Mourad A, Puchinger J, Chu C (2019) A survey of models and algorithms for optimizing shared mobility. Transp Res Part B Methodol 123:323\u2013346. https:\/\/doi.org\/10.1016\/j.trb.2019.02.003","journal-title":"Transp Res Part B Methodol"},{"issue":"1","key":"631_CR49","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.ejor.2013.09.019","volume":"235","author":"R Nair","year":"2014","unstructured":"Nair R, Miller-Hooks E (2014) Equilibrium network design of shared-vehicle systems. Eur J Oper Res 235(1):47\u201361","journal-title":"Eur J Oper Res"},{"key":"631_CR50","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-1-4419-1306-7_11","volume-title":"A hybrid tabu search for the m-peripatetic vehicle routing problem","author":"SU Ngueveu","year":"2010","unstructured":"Ngueveu SU, Prins C, Calvo RW (2010) A hybrid tabu search for the m-peripatetic vehicle routing problem. Springer, Boston, MA, pp 253\u2013266. https:\/\/doi.org\/10.1007\/978-1-4419-1306-7_11"},{"issue":"5\u20136","key":"631_CR51","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1002\/mcda.1519","volume":"21","author":"PC Nolz","year":"2014","unstructured":"Nolz PC, Absi N, Feillet D (2014) A bi-objective inventory routing problem for sustainable waste management under uncertainty. J Multi-Criteria Decis Anal 21(5\u20136):299\u2013314. https:\/\/doi.org\/10.1002\/mcda.1519","journal-title":"J Multi-Criteria Decis Anal"},{"key":"631_CR52","doi-asserted-by":"crossref","unstructured":"Paris en Selle (2020) Plan v\u00e9lo. https:\/\/planvelo.paris\/. Last accessed on 27 May 2020","DOI":"10.22233\/20412495.0820.26"},{"issue":"4","key":"631_CR53","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1287\/ijoc.2018.0856","volume":"31","author":"SN Parragh","year":"2019","unstructured":"Parragh SN, Tricoire F (2019) Branch-and-bound for bi-objective integer programming. Inf J Comput 31(4):805\u2013822. https:\/\/doi.org\/10.1287\/ijoc.2018.0856","journal-title":"Inf J Comput"},{"issue":"3","key":"631_CR54","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1016\/j.ejor.2003.10.003","volume":"160","author":"J Riera-Ledesma","year":"2005","unstructured":"Riera-Ledesma J, Salazar-Gonz\u00e1lez JJ (2005) The biobjective travelling purchaser problem. Eur J Oper Res 160(3):599\u2013613. https:\/\/doi.org\/10.1016\/j.ejor.2003.10.003","journal-title":"Eur J Oper Res"},{"key":"631_CR55","unstructured":"SEAMLESS (2020) SEAMLESS - sustainable, efficient austrian mobility with low-emission shared systems. http:\/\/www.seamless-project.at\/projekt\/. Last accessed on 02 May 2020"},{"issue":"3","key":"631_CR56","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1016\/j.ejor.2012.03.044","volume":"221","author":"MM Silva","year":"2012","unstructured":"Silva MM, Subramanian A, Vidal T, Ochi LS (2012) A simple and effective metaheuristic for the minimum latency problem. Eur J Oper Res 221(3):513\u2013520. https:\/\/doi.org\/10.1016\/j.ejor.2012.03.044","journal-title":"Eur J Oper Res"},{"issue":"1","key":"631_CR57","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1080\/15568318.2012.660109","volume":"7","author":"L Sioui","year":"2013","unstructured":"Sioui L, Morency C, Tr\u00e9panier M (2013) How carsharing affects the travel behavior of households: a case study of montr\u00e9al, canada. Int J Sustain Transp 7(1):52\u201369","journal-title":"Int J Sustain Transp"},{"issue":"4","key":"631_CR58","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1002\/nav.3800230402","volume":"23","author":"V Srinivasan","year":"1976","unstructured":"Srinivasan V, Thompson GL (1976) Algorithms for minimizing total cost, bottleneck time and bottleneck shipment in transportation problems. Naval Res Logists Q 23(4):567\u2013595. https:\/\/doi.org\/10.1002\/nav.3800230402","journal-title":"Naval Res Logists Q"},{"key":"631_CR59","unstructured":"Stadtentwicklung Wien (2020) STEP2025 stadtentwicklungsplan wien. https:\/\/www.wien.gv.at\/stadtentwicklung\/studien\/pdf\/b008379a.pdf. Last accessed on 27 May 2020"},{"key":"631_CR60","unstructured":"Statistik W (2020) Wiener Bev\u00f6lkerungsstand. https:\/\/www.wien.gv.at\/statistik\/bevoelkerung\/bevoelkerungsstand\/index.html. Last accessed on 27 May 2020"},{"issue":"4","key":"631_CR61","doi-asserted-by":"publisher","first-page":"1009","DOI":"10.1287\/mnsc.2013.1802","volume":"60","author":"T Stidsen","year":"2014","unstructured":"Stidsen T, Andersen KA, Dammann B (2014) A branch and bound algorithm for a class of biobjective mixed integer programs. Manag Sci 60(4):1009\u20131032. https:\/\/doi.org\/10.1287\/mnsc.2013.1802","journal-title":"Manag Sci"},{"key":"631_CR62","doi-asserted-by":"publisher","first-page":"42868","DOI":"10.1038\/srep42868","volume":"7","author":"R Tachet","year":"2017","unstructured":"Tachet R, Sagarra O, Santi P, Resta G, Szell M, Strogatz S, Ratti C (2017) Scaling law of urban ride sharing. Sci Rep 7:42868","journal-title":"Sci Rep"},{"key":"631_CR63","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.cie.2017.05.013","volume":"110","author":"EM Toro","year":"2017","unstructured":"Toro EM, Franco JF, Echeverri MG, Guimar\u00e3es FG (2017) A multi-objective model for the green capacitated location-routing problem considering environmental impact. Comput Ind Eng 110:114\u2013125. https:\/\/doi.org\/10.1016\/j.cie.2017.05.013","journal-title":"Comput Ind Eng"},{"key":"631_CR64","doi-asserted-by":"crossref","unstructured":"Toth P, Vigo D (2002) The vehicle routing problem. Society for Industrial and Applied Mathematics. doi:10(1137\/1):9780898718515","DOI":"10.1137\/1.9780898718515"},{"key":"631_CR65","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.trb.2017.03.006","volume":"103","author":"F Tricoire","year":"2017","unstructured":"Tricoire F, Parragh SN (2017) Investing in logistics facilities today to reduce routing emissions tomorrow. Transp Res Part B Methodol 103:56\u201367 (green Urban Transportation)","journal-title":"Transp Res Part B Methodol"},{"key":"631_CR66","unstructured":"United Nations - Department of Economic and Social Affairs (2018) 68% of the world population projected to live in urban areas by 2050, says un. https:\/\/www.un.org\/development\/desa\/en\/news\/population\/2018-revision-of-world-urbanization-prospects.html. Last accessed on 28 May 2020"},{"key":"631_CR67","unstructured":"VC\u00d6 - Mobilit\u00e4t der Zukunft (2020) VC\u00d6-Factsheet 2018-10 - Gro\u00dfes Potenzial f\u00fcr Sharing und neue Mobilit\u00e4tsservices. https:\/\/www.vcoe.at\/files\/vcoe\/uploads\/News\/VCOe-Factsheets\/2018\/2018-10%20Sharing%20und%20neue%20Mobilitaetsloesungen\/VCO%CC%88-Factsheet%20Sharing%20und%20neue%20Mobilita%CC%88tslo%CC%88sungen.pdf. Last accessed on 27 May 2020"},{"key":"631_CR68","unstructured":"Vidal T, Laporte G, Matl P (2019) A concise guide to existing and emerging vehicle routing problem variants. CoRR abs\/1906.06750, http:\/\/arxiv.org\/abs\/1906.06750"},{"issue":"1","key":"631_CR69","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1016\/j.cor.2012.08.003","volume":"40","author":"T Vincent","year":"2013","unstructured":"Vincent T, Seipp F, Ruzika S, Przybylski A, Gandibleux X (2013) Multiple objective branch and bound for mixed 0\u20131 linear programming: corrections and improvements for the biobjective case. Comput Oper Res 40(1):498\u2013509. https:\/\/doi.org\/10.1016\/j.cor.2012.08.003","journal-title":"Comput Oper Res"},{"key":"631_CR70","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1023\/A:1008258310679","volume":"12","author":"M Vis\u00e9e","year":"1998","unstructured":"Vis\u00e9e M, Teghem J, Pirlot M, Ulungu E (1998) Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem. J Global Optim 12:139\u2013155","journal-title":"J Global Optim"},{"issue":"4","key":"631_CR71","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/MITS.2013.2267810","volume":"5","author":"S Weikl","year":"2013","unstructured":"Weikl S, Bogenberger K (2013) Relocation strategies and algorithms for free-floating car sharing systems. IEEE Intell Transp Syst Mag 5(4):100\u2013111","journal-title":"IEEE Intell Transp Syst Mag"},{"key":"631_CR72","unstructured":"Wiener L (2010) Wahl der Verkehrsmittel und Anteil des \u00f6ffentlichen Verkehrs. https:\/\/www.wien.gv.at\/presse\/bilder\/2011\/02\/15\/839-mio-fahrgaeste-fahrgastrekord-2010-fuer-die-wiener-linien. Last accessed on 27 May 2020"},{"key":"631_CR73","unstructured":"Wiener L (2019) Modal split 2019. https:\/\/www.wien.gv.at\/presse\/bilder\/2020\/02\/12\/modal-split-2019_wiener-linien-png. Last accessed on 27 May 2020"},{"key":"631_CR74","first-page":"296","volume":"3","author":"YV Yh","year":"1971","unstructured":"Yh YV, Lasdon LS, Da Wismer D (1971) On a bicriterion formation of the problems of integrated system identification and system optimization. IEEE Trans Syst Man Cybern 3:296\u2013297","journal-title":"IEEE Trans Syst Man Cybern"},{"issue":"3","key":"631_CR75","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1080\/15568311003717181","volume":"5","author":"B Zhou","year":"2011","unstructured":"Zhou B, Kockelman KM (2011) Opportunities for and impacts of carsharing: a survey of the austin, texas market. Int J Sustain Transp 5(3):135\u2013152","journal-title":"Int J Sustain Transp"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-021-00631-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00291-021-00631-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-021-00631-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,23]],"date-time":"2022-05-23T08:21:17Z","timestamp":1653294077000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00291-021-00631-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,14]]},"references-count":75,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["631"],"URL":"https:\/\/doi.org\/10.1007\/s00291-021-00631-2","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9,14]]},"assertion":[{"value":"23 June 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 April 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 September 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 February 2022","order":4,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Update","order":5,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The Funding note has been corrected in the original version of the article.","order":6,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}