{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:49:04Z","timestamp":1757314144733,"version":"3.37.3"},"reference-count":60,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,10,9]],"date-time":"2018-10-09T00:00:00Z","timestamp":1539043200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"European Regional Development Fund under the Innovative Economy Operational Programme","award":["POIG.01.01.02-00-062\/09"],"award-info":[{"award-number":["POIG.01.01.02-00-062\/09"]}]},{"name":"National Centre for Research and Development, Smart Infrastructure Road Innovation","award":["DZP\/RID-I-68\/14\/NCBIR\/2016"],"award-info":[{"award-number":["DZP\/RID-I-68\/14\/NCBIR\/2016"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Multimed Tools Appl"],"published-print":{"date-parts":[[2019,2]]},"DOI":"10.1007\/s11042-018-6714-x","type":"journal-article","created":{"date-parts":[[2018,10,9]],"date-time":"2018-10-09T04:33:33Z","timestamp":1539059613000},"page":"4693-4721","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Intelligent route planning system based on interval computing"],"prefix":"10.1007","volume":"78","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4773-9123","authenticated-orcid":false,"given":"Wojciech","family":"Chmiel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Iwona","family":"Skalna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stanis\u0142aw","family":"J\u0119drusik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,10,9]]},"reference":[{"key":"6714_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.trb.2016.08.015","volume":"94","author":"E Angelelli","year":"2016","unstructured":"Angelelli E, Arsik I, Morandi V, Savelsbergh M, Speranza M (2016) Proactive route guidance to avoid congestion. Transp Res B Methodol 94:1\u201321. \n                    https:\/\/doi.org\/10.1016\/J.TRB.2016.08.015","journal-title":"Transp Res B Methodol"},{"issue":"1","key":"6714_CR2","doi-asserted-by":"publisher","first-page":"12,710","DOI":"10.1016\/j.ifacol.2017.08.2267","volume":"50","author":"I Arvanitakis","year":"2017","unstructured":"Arvanitakis I, Tzes A, Giannousakis K (2017) Mobile robot navigation under pose uncertainty in unknown environments. IFAC-PapersOnLine 50 (1):12,710\u201312,714. \n                    https:\/\/doi.org\/10.1016\/J.IFACOL.2017.08.2267","journal-title":"IFAC-PapersOnLine"},{"key":"6714_CR3","doi-asserted-by":"crossref","unstructured":"Bader R, Dees J, Geisberger R, Sanders P (2011) Alternative route graphs in road networks. In: Marchetti-Spaccamela A, Segal M (eds) Theory and practice of algorithms in (computer) systems, lecture notes in computer science, vol 6595. Springer, Berlin, pp 21\u201332","DOI":"10.1007\/978-3-642-19754-3_5"},{"key":"6714_CR4","doi-asserted-by":"crossref","unstructured":"Bast H, Funke S, Matijevic D, Sanders P, Schultes D (2007) In transit to constant time shortest-path queries in road networks","DOI":"10.1137\/1.9781611972870.5"},{"key":"6714_CR5","doi-asserted-by":"publisher","unstructured":"Bast H, Delling D, Goldberg A, M\u00fcller-Hannemann M, Pajor T, Sanders P, Wagner D, Werneck RF (2016) Route planning in transportation networks. Springer International Publishing, Cham, pp 19\u201380. \n                    https:\/\/doi.org\/10.1007\/978-3-319-49487-6_2","DOI":"10.1007\/978-3-319-49487-6_2"},{"key":"6714_CR6","volume-title":"Dynamic programming","author":"R Bellman","year":"1957","unstructured":"Bellman R (1957) Dynamic programming, 1st edn. Princeton University Press, Princeton","edition":"1"},{"key":"6714_CR7","doi-asserted-by":"publisher","unstructured":"Buchhold V, Sanders P, Wagner D (2018) Real-time traffic assignment using fast queries in customizable contraction hierarchies. In: 17th international symposium on experimental algorithms, SEA 2018, June 27-29, 2018, L\u2019Aquila, Italy, pp 27:1\u201327:15. \n                    https:\/\/doi.org\/10.4230\/LIPIcs.SEA.2018.27","DOI":"10.4230\/LIPIcs.SEA.2018.27"},{"key":"6714_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/J.TRC.2017.06.007","volume":"82","author":"M Chen","year":"2017","unstructured":"Chen M, Yu G, Chen P, Wang Y (2017) A copula-based approach for estimating the travel time reliability of urban arterial. Transp Res Part C: Emerg Technol 82:1\u201323. \n                    https:\/\/doi.org\/10.1016\/J.TRC.2017.06.007","journal-title":"Transp Res Part C: Emerg Technol"},{"key":"6714_CR9","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.eswa.2018.05.022","volume":"110","author":"P Chen","year":"2018","unstructured":"Chen P, Tong R, Lu G, Wang Y (2018) The \u03b1-reliable path problem in stochastic road networks with link correlations: a moment-matching-based path finding algorithm. Expert Syst Appl 110:20\u201332. \n                    https:\/\/doi.org\/10.1016\/J.ESWA.2018.05.022","journal-title":"Expert Syst Appl"},{"key":"6714_CR10","doi-asserted-by":"crossref","unstructured":"Chmiel W, Szwed P (2015) Learning fuzzy cognitive map for traffic prediction using an evolutionary algorithm. In: Proceedings of the 8th international conference on multimedia communications, services and security, MCSS 2015, November 24, 2015. Springer International Publishing, Krak\u00f3w, Poland, pp 195\u2013209","DOI":"10.1007\/978-3-319-26404-2_16"},{"issue":"17","key":"6714_CR11","doi-asserted-by":"publisher","first-page":"10,529","DOI":"10.1007\/s11042-016-3367-5","volume":"75","author":"W Chmiel","year":"2016","unstructured":"Chmiel W, Da\u0144da J, Dziech A, Ernst S, Kad\u0142uczka P, Mikrut Z, Pawlik P, Szwed P, Wojnicki I (2016) Insigma: an intelligent transportation system for urban mobility enhancement. Multimed Tools Appl 75(17):10,529\u201310,560","journal-title":"Multimed Tools Appl"},{"key":"6714_CR12","doi-asserted-by":"crossref","unstructured":"Delling D, Goldberg AV, Pajor T, Werneck RF (2011) Customizable route planning. In: Pardalos PM, Rebennack S (eds) Experimental algorithms. Springer, Berlin, pp 376\u2013387","DOI":"10.1007\/978-3-642-20662-7_32"},{"key":"6714_CR13","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1016\/j.cor.2015.11.010","volume":"78","author":"O Dib","year":"2017","unstructured":"Dib O, Manier MA, Moalic L, Caminada A (2017) Combining VNS with genetic algorithm to solve the one-to-one routing issue in road networks. Comput Oper Res 78:420\u2013430. \n                    https:\/\/doi.org\/10.1016\/J.COR.2015.11.010","journal-title":"Comput Oper Res"},{"key":"6714_CR14","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.jda.2017.01.001","volume":"42","author":"Y Dinitz","year":"2017","unstructured":"Dinitz Y, Itzhak R (2017) Hybrid Bellman\u2013Ford\u2013Dijkstra algorithm. J Discrete Algo 42:35\u201344. \n                    https:\/\/doi.org\/10.1016\/J.JDA.2017.01.001","journal-title":"J Discrete Algo"},{"key":"6714_CR15","unstructured":"Flinsenberg I (2004) Route planning algorithms for car navigation. PhD thesis, Technische Universiteit Eindhoven"},{"key":"6714_CR16","unstructured":"Goldberg AV, Harrelson C (2004) Computing the shortest path: A* search meets graph theory. Tech. Rep. MSR-TR-2004-24 Microsoft Research, Vancouver, Canada"},{"issue":"2","key":"6714_CR17","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1088\/0964-1726\/2\/2\/006","volume":"2","author":"AD Grosso","year":"1993","unstructured":"Grosso AD, Zucchini A (1993) Applications of interval arithmetic to the analysis and control of structural systems. Smart Mater Struct 2(2):103","journal-title":"Smart Mater Struct"},{"key":"6714_CR18","unstructured":"Gutman R (2004) Reach-based routing: a new approach to shortest path algorithms optimized for road networks. In: Proceedings 6th workshop on algorithm engineering and experiments (ALENEX), SIAM, pp 100\u2013111"},{"key":"6714_CR19","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.ins.2018.03.035","volume":"450","author":"J Han","year":"2018","unstructured":"Han J, Seo Y (2018) Path regeneration decisions in a dynamic environment. Inform Sci 450:39\u201352. \n                    https:\/\/doi.org\/10.1016\/J.INS.2018.03.035","journal-title":"Inform Sci"},{"key":"6714_CR20","volume-title":"Temporal and spatial variability of travel time. Tech rep.","author":"R He","year":"2002","unstructured":"He R, Liu H, Kornhauser A, Ran B (2002) Temporal and spatial variability of travel time. Tech rep. Center for Traffic Simulation Studies, UC Irvine"},{"key":"6714_CR21","doi-asserted-by":"publisher","first-page":"5:2.5","DOI":"10.1145\/1412228.1412239","volume":"13","author":"M Holzer","year":"2009","unstructured":"Holzer M, Schulz F, Wagner D (2009) Engineering multilevel overlay graphs for shortest-path queries. J Exp Algorithmics 13:5:2.5\u20135:2.26","journal-title":"J Exp Algorithmics"},{"issue":"2","key":"6714_CR22","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1162\/EVCO_a_00156","volume":"24","author":"XB Hu","year":"2016","unstructured":"Hu XB, Wang M, Leeson MS, Di Paolo EA, Liu H (2016) Deterministic agent-based path optimization by mimicking the spreading of ripples. Evol Comput 24(2):319\u2013346. \n                    https:\/\/doi.org\/10.1162\/EVCO_a_00156","journal-title":"Evol Comput"},{"key":"6714_CR23","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1016\/j.trb.2017.06.007","volume":"106","author":"XB Hu","year":"2017","unstructured":"Hu XB, Zhang MK, Zhang Q, Liao JQ (2017) Co-evolutionary path optimization by Ripple-Spreading algorithm. Trans Res Part B: Method 106:411\u2013432. \n                    https:\/\/doi.org\/10.1016\/J.TRB.2017.06.007","journal-title":"Trans Res Part B: Method"},{"key":"6714_CR24","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.neunet.2017.03.002","volume":"90","author":"W Huang","year":"2017","unstructured":"Huang W, Yan C, Wang J, Wang W (2017) A time-delay neural network for solving time-dependent shortest path problem. Neural Netw 90:21\u201328. \n                    https:\/\/doi.org\/10.1016\/j.neunet.2017.03.002","journal-title":"Neural Netw"},{"key":"6714_CR25","doi-asserted-by":"publisher","first-page":"692","DOI":"10.1016\/j.procs.2017.05.379","volume":"109","author":"A Idri","year":"2017","unstructured":"Idri A, Oukarfi M, Boulmakoul A, Zeitouni K, Masri A (2017) A new time-dependent shortest path algorithm for multimodal transportation network. Procedia Comput Sci 109:692\u2013697. \n                    https:\/\/doi.org\/10.1016\/J.PROCS.2017.05.379","journal-title":"Procedia Comput Sci"},{"issue":"1","key":"6714_CR26","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1023\/A:1017987931447","volume":"10","author":"M Jerrel","year":"1997","unstructured":"Jerrel M (1997) Interval arithmetic for input-output models with inexact data. Comput Econ 10(1):89\u2013100","journal-title":"Comput Econ"},{"key":"6714_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2007.03.031","volume":"188","author":"C Jiang","year":"2008","unstructured":"Jiang C, Han X, Liu G, Liu G (2008) A nonlinear interval number programming method for uncertain optimization problems. Eur J Oper Res 188:1\u201313","journal-title":"Eur J Oper Res"},{"key":"6714_CR28","unstructured":"Kampen EV, Chu P, Mulder B (2010) Optimization of spacecraft rendezvous and docking using interval analysis. Optimization of Spacecraft Rendezvous and Docking using Interval Analysis AIAA Guidance, Navigation, and Control Conference 2-5 August 2010, American Institute of Aeronautics and Astronautics"},{"key":"6714_CR29","unstructured":"Lauther U (2004) An extremely fast, exact algorithm for finding shortest paths in static networks with geographical background. In: Geoinformation und mobilit\u00e4t \u2013 von der forschung zur praktischen anwendung, vol 22, pp 219\u2013230"},{"key":"6714_CR30","doi-asserted-by":"publisher","unstructured":"Lee SB, Lee SM, Lee KY (2017), A Gini coefficient based evaluation on the reliability of travel time forecasting. Journal of King Saud University - Engineering Sciences. \n                    https:\/\/doi.org\/10.1016\/J.JKSUES.2017.12.001","DOI":"10.1016\/J.JKSUES.2017.12.001"},{"issue":"1-4","key":"6714_CR31","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/BF01553908","volume":"4","author":"M Luby","year":"1989","unstructured":"Luby M, Ragde P (1989) A bidirectional shortest-path algorithm with good average-case behavior. Algorithmica 4(1-4):551\u2013567","journal-title":"Algorithmica"},{"key":"6714_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.trc.2016.11.008","volume":"74","author":"Z Ma","year":"2017","unstructured":"Ma Z, Koutsopoulos HN, Ferreira L, Mesbah M (2017) Estimation of trip travel time distribution using a generalized Markov chain approach. Trans Res Part C: Emerg Technol 74:1\u201321. \n                    https:\/\/doi.org\/10.1016\/j.trc.2016.11.008","journal-title":"Trans Res Part C: Emerg Technol"},{"issue":"3","key":"6714_CR33","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1016\/j.ejor.2017.03.031","volume":"261","author":"Y Marinakis","year":"2017","unstructured":"Marinakis Y, Migdalas A, Sifaleras A (2017) A hybrid particle swarm optimization \u2013 variable neighborhood search algorithm for constrained shortest path problems. Euro J Oper Res 261(3):819\u2013834. \n                    https:\/\/doi.org\/10.1016\/J.EJOR.2017.03.031","journal-title":"Euro J Oper Res"},{"key":"6714_CR34","first-page":"2:3.2","volume":"14","author":"J Maue","year":"2010","unstructured":"Maue J, Sanders P, Matijevic D (2010) Goal\u2013directed shortest-path queries using precomputed cluster distances. J Exp Algorithmics 14:2:3.2\u20132:3.27","journal-title":"J Exp Algorithmics"},{"key":"6714_CR35","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/j.trc.2018.04.014","volume":"91","author":"C Miao","year":"2018","unstructured":"Miao C, Liu H, Zhu GG, Chen H (2018) Connectivity-based optimization of vehicle route and speed for improved fuel economy. Trans Res Part C: Emerg Technol 91:353\u2013368","journal-title":"Trans Res Part C: Emerg Technol"},{"key":"6714_CR36","unstructured":"Montemanni R, Gambardella L (2008) Robust shortest path problems with uncertain costs. Tech. rep., IDSIA-03-08"},{"issue":"3","key":"6714_CR37","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/j.orl.2003.08.002","volume":"32","author":"R Montemanni","year":"2004","unstructured":"Montemanni R, Gambardella L, Donati A (2004) A branch and bound algorithm for the robust shortest path problem with interval data. Oper Res Lett 32(3):225\u2013232","journal-title":"Oper Res Lett"},{"key":"6714_CR38","volume-title":"Interval analysis. Prentice-Hall series in automatic computation","author":"R Moore","year":"1966","unstructured":"Moore R (1966) Interval analysis. Prentice-Hall series in automatic computation. Prentice-Hall, Upper Saddle River"},{"issue":"2","key":"6714_CR39","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1080\/19439962.2010.488316","volume":"2","author":"H Naghawi","year":"2010","unstructured":"Naghawi H, Wolshon B (2010) Transit-based emergency evacuation simulation modeling. J Trans Safety Secur 2(2):184\u2013201","journal-title":"J Trans Safety Secur"},{"key":"6714_CR40","doi-asserted-by":"publisher","unstructured":"Patle B, Pandey A, Jagadeesh A, Parhi D (2018) Path planning in uncertain environment by using firefly algorithm. Defence Technology. \n                    https:\/\/doi.org\/10.1016\/J.DT.2018.06.004","DOI":"10.1016\/J.DT.2018.06.004"},{"key":"6714_CR41","unstructured":"Pshikhopov V, Guzik V, Pyavchenko A, Pereverzev V, Saprykin R, Pshikhopov V (2017) Neural networking path planning based on neural-like structures. Path Planning for Vehicles Operating in Uncertain 2D Environments, pp 25\u201396"},{"key":"6714_CR42","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1016\/j.trc.2017.10.012","volume":"85","author":"M Rahmani","year":"2017","unstructured":"Rahmani M, Koutsopoulos HN, Jenelius E (2017) Travel time estimation from sparse floating car data with consistent path inference: a fixed point approach. Trans Res Part C: Emerg Technol 85:628\u2013643. \n                    https:\/\/doi.org\/10.1016\/J.TRC.2017.10.012","journal-title":"Trans Res Part C: Emerg Technol"},{"key":"6714_CR43","doi-asserted-by":"crossref","unstructured":"Sanders PDS (2006) Engineering highway hierarchies. In: Proceedings of the 14th conference on annual European symposium, ESA\u201906, vol 14. Springer-Verlag, London, UK, pp 804\u2013816","DOI":"10.1007\/11841036_71"},{"key":"6714_CR44","doi-asserted-by":"crossref","unstructured":"Sanders P, Schultes D (2005) Highway hierarchies hasten exact shortest path queries. In: Proceedings of the 13th annual European conference on algorithms, ESA\u201905. Springer-Verlag, Berlin, Heidelberg, pp 568\u2013579","DOI":"10.1007\/11561071_51"},{"key":"6714_CR45","doi-asserted-by":"publisher","unstructured":"Sarbazi-Azad H, Chapuis G, Djidjev H, Lavenier D, Andonov R (2017) GPU-accelerated shortest paths computations for planar graphs. Advances in GPU Research and Practice, pp 273\u2013306. \n                    https:\/\/doi.org\/10.1016\/B978-0-12-803738-6.00011-2","DOI":"10.1016\/B978-0-12-803738-6.00011-2"},{"key":"6714_CR46","unstructured":"Schultes D (2008) Route planning in road networks. PhD thesis, Universit\u00e4t Fridericiana zu Karlsruhe"},{"key":"6714_CR47","doi-asserted-by":"crossref","unstructured":"Schultes D, Sanders P (2007) Dynamic highway-node routing. In: Demetrescu C (ed) Experimental algorithms, lecture notes in computer science, vol 4525. Springer, Berlin, Heidelberg, pp 66\u201379","DOI":"10.1007\/978-3-540-72845-0_6"},{"key":"6714_CR48","doi-asserted-by":"crossref","unstructured":"Schulz F, Wagner D, Weihe K (1999) Dijkstra\u2019s algorithm on-line: an empirical case study from public railroad transport. In: Proceedings of the 3rd international workshop on algorithm engineering, WAE \u201999. Springer-Verlag, London, UK, pp 110\u2013123","DOI":"10.1007\/3-540-48318-7_11"},{"issue":"1","key":"6714_CR49","first-page":"147","volume":"7","author":"P Sevastjanov","year":"2003","unstructured":"Sevastjanov P, R\u00f3g P (2003) A probabilistic approach to fuzzy and crisp interval ordering. Task Quarterly 7(1):147\u2013156","journal-title":"Task Quarterly"},{"issue":"2","key":"6714_CR50","first-page":"45","volume":"2","author":"P Sevastjanov","year":"2002","unstructured":"Sevastjanov P, R\u00f3g P, Karczewski K (2002) A probabilistic method for ordering group of intervals. Comput Sci 2(2):45\u201353","journal-title":"Comput Sci"},{"key":"6714_CR51","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.trc.2018.04.018","volume":"92","author":"D Sever","year":"2018","unstructured":"Sever D, Zhao L, Dellaert N, Demir E, Van Woensel T, De Kok T (2018) The dynamic shortest path problem with time-dependent stochastic disruptions. Transp Res Part C: Emerg Technol 92:42\u201357. \n                    https:\/\/doi.org\/10.1016\/J.TRC.2018.04.018","journal-title":"Transp Res Part C: Emerg Technol"},{"issue":"4","key":"6714_CR52","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1504\/IJRS.2007.016260","volume":"1","author":"M Stadtherr","year":"2007","unstructured":"Stadtherr M, Xu G, Burgos-Solorzano G, Haynes W (2007) Reliable computation of phase stability and equilibrium using interval methods. Int J Reliab Saf 1(4):465\u2013488","journal-title":"Int J Reliab Saf"},{"key":"6714_CR53","unstructured":"Szwed P, Kadluczka P, Chmiel W, Glowacz A, Sliwa J (2012) Ontology based integration and decision support in the insigma route planning subsystem. In: Proceedings of federated conference on computer science and information systems - FedCSIS, Wroclaw, Poland 2012, pp 141\u2013148"},{"key":"6714_CR54","doi-asserted-by":"crossref","unstructured":"Wagner D, Willhalm T (2003) Geometric speed-up techniques for finding shortest paths in large sparse graphs. In: Battista G D, Zwick U (eds) Proceedings of the 13th annual European conference on algorithms, ESA\u201903, LNCS, pp 776\u2013787","DOI":"10.1007\/978-3-540-39658-1_69"},{"key":"6714_CR55","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.autcon.2018.05.024","volume":"93","author":"CH Yang","year":"2018","unstructured":"Yang CH, Tsai MH, Kang SC, Hung CY (2018) UAV path planning method for digital terrain model reconstruction \u2013 A debris fan example. Autom Construc 93:214\u2013230. \n                    https:\/\/doi.org\/10.1016\/J.AUTCON.2018.05.024","journal-title":"Autom Construc"},{"issue":"3","key":"6714_CR56","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1016\/S0019-9958(65)90241-X","volume":"8","author":"L Zadeh","year":"1965","unstructured":"Zadeh L (1965) Fuzzy sets. Inf Control 8(3):338\u2013353","journal-title":"Inf Control"},{"key":"6714_CR57","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.trc.2018.05.027","volume":"93","author":"X Zeng","year":"2018","unstructured":"Zeng X, Wang J (2018) Globally energy-optimal speed planning for road vehicles on a given route. Transp Res Part C: Emerg Technol 93:148\u2013160","journal-title":"Transp Res Part C: Emerg Technol"},{"key":"6714_CR58","doi-asserted-by":"crossref","unstructured":"Zhang Q, Xiong S (2018) Routing optimization of emergency grain distribution vehicles using the immune ant colony optimization algorithm. Applied Soft Computing","DOI":"10.1016\/j.asoc.2018.07.050"},{"key":"6714_CR59","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.knosys.2018.05.033","volume":"158","author":"Y Zhao","year":"2018","unstructured":"Zhao Y, Zheng Z, Liu Y (2018) Survey on computational-intelligence-based UAV path planning. Knowl-Based Syst 158:54\u201364. \n                    https:\/\/doi.org\/10.1016\/J.KNOSYS.2018.05.033","journal-title":"Knowl-Based Syst"},{"key":"6714_CR60","unstructured":"Zhu SQ (2004) Stochastic time-dependent route planning in car navigation systems. Master\u2019s thesis, Technische Universiteit Eindhoven"}],"container-title":["Multimedia Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-018-6714-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11042-018-6714-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-018-6714-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,8]],"date-time":"2019-10-08T19:09:36Z","timestamp":1570561776000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11042-018-6714-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,9]]},"references-count":60,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,2]]}},"alternative-id":["6714"],"URL":"https:\/\/doi.org\/10.1007\/s11042-018-6714-x","relation":{},"ISSN":["1380-7501","1573-7721"],"issn-type":[{"type":"print","value":"1380-7501"},{"type":"electronic","value":"1573-7721"}],"subject":[],"published":{"date-parts":[[2018,10,9]]},"assertion":[{"value":"1 September 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 August 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 September 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 October 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}