{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T05:14:07Z","timestamp":1776402847182,"version":"3.51.2"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030122546","type":"print"},{"value":"9783030122553","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-12255-3_2","type":"book-chapter","created":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T05:50:06Z","timestamp":1557985806000},"page":"9-22","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Urban Mobility in Multi-Modal Networks Using Multi-Objective Algorithms"],"prefix":"10.1007","author":[{"given":"J\u00falia","family":"Silva","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Priscila Berbert","family":"Rampazzo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akebo","family":"Yamakami","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,17]]},"reference":[{"key":"2_CR1","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Upper Saddle River (1993)"},{"key":"2_CR2","unstructured":"Ambrosino, D., Sciomachen, A.: A shortest path algorithm in multimodal networks: a case study with time varying costs. In: Proceedings of International Network Optimization Conference, Pisa (2009)"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Belhaiza, S., M\u2019Hallah, R., Ben Brahim, G.: A new hybrid genetic variable neighborhood search heuristic for the vehicle routing problem with multiple time windows. In: IEEE Congress on Evolutionary Computation (CEC) (2017)","DOI":"10.1109\/CEC.2017.7969457"},{"key":"2_CR4","volume-title":"Parallel Problem Solving from Nature PPSN VI. PPSN 2000","author":"K Deb","year":"2000","unstructured":"Deb, K., Agrawal, S., Pratap, A., et al.: A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II. In: Schoenauer, M., et al. (eds.) Parallel Problem Solving from Nature PPSN VI. PPSN 2000. Lecture Notes in Computer Science. Springer, Berlin (2000)"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1016\/j.trpro.2015.09.028","volume":"10","author":"O Dib","year":"2015","unstructured":"Dib, O., Manier, M.A., Caminada, A.: Memetic algorithm for computing shortest paths in multimodal transportation networks. Transp. Res. Procedia 10, 745\u2013755 (2015)","journal-title":"Transp. Res. Procedia"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1, 269\u2013271 (1959)","journal-title":"Numer. Math."},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Dotoli, M., Epicoco, N., Falagario, M.: A technique for efficient multimodal transport planning with conflicting objectives under uncertainty. In: IEEE In Control Conference (ECC) (2016)","DOI":"10.1109\/ECC.2016.7810656"},{"key":"2_CR8","unstructured":"Kirchler, D.: Efficient routing on multi-modal transportation networks. Ecole Polytechnique X (2013)"},{"issue":"3","key":"2_CR9","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1007\/s10845-014-1018-0","volume":"28","author":"L Liu","year":"2017","unstructured":"Liu, L., Mu, H., Yang, J.: Toward algorithms for multi-modal shortest path problem and their extension in urban transit network. J. Intell. Manuf. 28(3), 767\u2013781 (2017)","journal-title":"J. Intell. Manuf."},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"1670","DOI":"10.1016\/j.procs.2017.08.189","volume":"112","author":"M Mnif","year":"2017","unstructured":"Mnif, M., Bouamama, S.: Firework algorithm for multi-objective optimization of a multimodal transportation network problem. Procedia Comput. Sci. 112, 1670\u20131682 (2017)","journal-title":"Procedia Comput. Sci."},{"issue":"3","key":"2_CR11","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1016\/S0377-2217(99)00388-4","volume":"125","author":"A Ziliaskopoulos","year":"2000","unstructured":"Ziliaskopoulos, A., Wardell, W.: An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays. Eur. J. Oper. Res. 125(3), 486\u2013502 (2000)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Urban Computing","Smart and Digital Cities"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-12255-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,27]],"date-time":"2020-10-27T19:54:15Z","timestamp":1603828455000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-12255-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030122546","9783030122553"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-12255-3_2","relation":{},"ISSN":["2510-2575","2510-2583"],"issn-type":[{"value":"2510-2575","type":"print"},{"value":"2510-2583","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"17 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}