{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:34:33Z","timestamp":1759336473278},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,11,14]],"date-time":"2016-11-14T00:00:00Z","timestamp":1479081600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Geoinformatica"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s10707-016-0274-x","type":"journal-article","created":{"date-parts":[[2016,11,14]],"date-time":"2016-11-14T08:16:50Z","timestamp":1479111410000},"page":"89-117","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Constrained energy-efficient routing in time-aware road networks"],"prefix":"10.1007","volume":"21","author":[{"given":"Yaqiong","family":"Liu","sequence":"first","affiliation":[]},{"given":"Hock Soon","family":"Seah","sequence":"additional","affiliation":[]},{"given":"Guochu","family":"Shou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,11,14]]},"reference":[{"key":"274_CR1","doi-asserted-by":"crossref","unstructured":"Andersen O, Jensen CS, Torp K, Yang B (2013) Ecotour: Reducing the environmental footprint of vehicles using eco-routes. In: IEEEInternational conference on mobile data management, pp 338\u2013340","DOI":"10.1109\/MDM.2013.50"},{"key":"274_CR2","doi-asserted-by":"crossref","unstructured":"Artmeier A, Haselmayr J, Leucker M, Sachenbacher M (2010) The shortest path problem revisited: Optimal routing for electric vehicles. In: KI 2010: Advances In artificial intelligence, pp 309\u2013316. Springer","DOI":"10.1007\/978-3-642-16111-7_35"},{"key":"274_CR3","doi-asserted-by":"crossref","unstructured":"Batz GV, Delling D, Sanders P, Vetter C (2009) Time-dependent contraction hierarchies. In: ALENEX, vol. 9. SIAM","DOI":"10.1137\/1.9781611972894.10"},{"key":"274_CR4","unstructured":"Baum M, Dibbelt J, H\u00fcbschle-Schneider L., Pajor T, Wagner D (2014) Speed-consumption tradeoff for electric vehicle route planning. In: 14Th workshop on algorithmic approaches for transportation modelling, optimization, and systems, p 138"},{"key":"274_CR5","doi-asserted-by":"crossref","unstructured":"Baum M, Dibbelt J, Pajor T, Wagner D (2013) Energy-optimal routes for electric vehicles. In: Proceedings of the 21st ACM SIGSPATIAL international conference on advances in geographic information systems, pp 54\u201363. ACM","DOI":"10.1145\/2525314.2525361"},{"issue":"11","key":"274_CR6","doi-asserted-by":"crossref","first-page":"1136","DOI":"10.14778\/2350229.2350234","volume":"5","author":"X Cao","year":"2012","unstructured":"Cao X, Chen L, Cong G, Xiao X (2012) Keyword-aware optimal route search. Proceedings of the VLDB Endowment 5(11):1136\u20131147","journal-title":"Proceedings of the VLDB Endowment"},{"key":"274_CR7","doi-asserted-by":"crossref","unstructured":"Delling D, Goldberg AV, Pajor T, Werneck RF (2011) Customizable route planning. In: Experimental algorithms, pp 376\u2013387. Springer","DOI":"10.1007\/978-3-642-20662-7_32"},{"key":"274_CR8","unstructured":"Demestichas K, Masikos M, Adamopoulou E, Dreher S, Diaz de Arkaya A (2012) Machine-learning methodology for energy efficient routing. In: 19Th ITS world congress"},{"issue":"3","key":"274_CR9","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1080\/03155986.1988.11732063","volume":"26","author":"M Desrochers","year":"1988","unstructured":"Desrochers M, Soumis F, Desrochers M (1988) A generalized permanent labeling algorithm for the shortest path problem with time windows. Information Systems & Operational Research 26(3):191\u2013212","journal-title":"Information Systems & Operational Research"},{"key":"274_CR10","doi-asserted-by":"crossref","unstructured":"Ding B, Yu JX, Qin L (2008) Finding time-dependent shortest paths over large graphs. In: Proceedings of the 11th international conference on extending database technology: Advances in database technology, pp 205\u2013216. ACM","DOI":"10.1145\/1353343.1353371"},{"key":"274_CR11","doi-asserted-by":"crossref","unstructured":"Duckham M, Kulik L (2003) simplest paths: Automated route selection for navigation. In: Spatial information theory. Foundations of geographic information science, pp 169\u2013185. Springer","DOI":"10.1007\/978-3-540-39923-0_12"},{"issue":"1","key":"274_CR12","doi-asserted-by":"crossref","first-page":"15C29","DOI":"10.1111\/1475-3995.00003","volume":"8","author":"I Dumitrescu","year":"2001","unstructured":"Dumitrescu I., Boland N. (2001) Algorithms for the weight constrained shortest path problem. Int Trans Oper Res 8(1):15C29","journal-title":"Int Trans Oper Res"},{"key":"274_CR13","doi-asserted-by":"crossref","unstructured":"Eisner J, Funke S, Storandt S (2011) Optimal route planning for electric vehicles in large networks. In: AAAI","DOI":"10.1609\/aaai.v25i1.7991"},{"key":"274_CR14","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of np-completeness. In: W.h. Freeman and company"},{"issue":"3","key":"274_CR15","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1287\/trsc.1110.0401","volume":"46","author":"R Geisberger","year":"2012","unstructured":"Geisberger R, Sanders P, Schultes D, Vetter C (2012) Exact routing in large road networks using contraction hierarchies. Transp Sci 46(3):388\u2013404","journal-title":"Transp Sci"},{"key":"274_CR16","doi-asserted-by":"crossref","unstructured":"Geisberger R, Vetter C (2011) Efficient routing in road networks with turn costs. In: Experimental algorithms, pp 100\u2013111. Springer","DOI":"10.1007\/978-3-642-20662-7_9"},{"issue":"3","key":"274_CR17","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1007\/s10707-014-0221-7","volume":"19","author":"C Guo","year":"2015","unstructured":"Guo C, Yang B, Andersen O, Jensen CS, Torp K (2015) Ecomark 2.0: empowering eco-routing with vehicular environmental models and actual vehicle fuel consumption data. Geoinformatica 19(3):567\u2013599","journal-title":"Geoinformatica"},{"key":"274_CR18","doi-asserted-by":"crossref","unstructured":"Hartmann F, Funke S (2014) Energy-efficient routing: Taking speed into account. In: KI 2014: Advances In artificial intelligence, pp 86\u201397. Springer","DOI":"10.1007\/978-3-319-11206-0_10"},{"key":"274_CR19","first-page":"5","volume":"13","author":"M Holzer","year":"2009","unstructured":"Holzer M, Schulz F, Wagner D (2009) Engineering multilevel overlay graphs for shortest-path queries. Journal of Experimental Algorithmics (JEA) 13:5","journal-title":"Journal of Experimental Algorithmics (JEA)"},{"issue":"5","key":"274_CR20","doi-asserted-by":"crossref","first-page":"1029","DOI":"10.1109\/TKDE.2002.1033772","volume":"14","author":"S Jung","year":"2002","unstructured":"Jung S, Pramanik S (2002) An efficient path computation model for hierarchically structured topographical road maps. IEEE Trans Knowl Data Eng 14(5):1029\u20131046","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"274_CR21","doi-asserted-by":"crossref","unstructured":"Kanoulas E, Du Y, Xia T, Zhang D (2006) Finding fastest paths on A road network with speed patterns. In: Proceedings of the 22nd international conference on data engineering, ICDE, p 10","DOI":"10.1109\/ICDE.2006.71"},{"key":"274_CR22","doi-asserted-by":"crossref","unstructured":"Kriegel HP, Renz M, Schubert M (2010) Route skyline queries: a multi-preference path planning approach. In: 2010 IEEE 26Th international conference on data engineering (ICDE), pp 261\u2013272. IEEE","DOI":"10.1109\/ICDE.2010.5447845"},{"key":"274_CR23","doi-asserted-by":"crossref","unstructured":"Luxen D, Vetter C (2011) Real-time routing with openstreetmap data. In: Proceedings of the 19th ACM SIGSPATIAL international conference on advances in geographic information systems, pp 513\u2013516. ACM","DOI":"10.1145\/2093973.2094062"},{"issue":"2","key":"274_CR24","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1002\/net.20077","volume":"46","author":"W Matthew Carlyle","year":"2005","unstructured":"Matthew Carlyle W, Kevin Wood R (2005) Near-shortest and k-shortest simple paths. Networks 46(2):98\u2013109","journal-title":"Networks"},{"key":"274_CR25","doi-asserted-by":"crossref","unstructured":"Schulz F, Wagner D, Zaroliagis C (2002) Using multi-level graphs for timetable information in railway systems. In: Algorithm engineering and experiments, pp 43\u201359. Springer","DOI":"10.1007\/3-540-45643-0_4"},{"key":"274_CR26","doi-asserted-by":"crossref","unstructured":"Shang J, Zheng Y, Tong W, Chang E, Yu Y (2014) Inferring gas consumption and pollution emission of vehicles throughout a city. In: Proceedings of the 20th ACM SIGKDD international conference on knowledge discovery and data mining, pp 1027\u20131036. ACM","DOI":"10.1145\/2623330.2623653"},{"key":"274_CR27","doi-asserted-by":"crossref","unstructured":"Song YY, Yao EJ, Zuo T, Lang ZF (2013) Emissions and fuel consumption modeling for evaluating environmental effectiveness of its strategies. Discret Dyn Nat Soc","DOI":"10.1155\/2013\/581945"},{"key":"274_CR28","unstructured":"Storandt S (2012) Algorithms for vehicle navigation"},{"key":"274_CR29","doi-asserted-by":"crossref","unstructured":"Storandt S (2012) Quick and energy-efficient routes: computing constrained shortest paths for electric vehicles. In: Proceedings of the 5th ACM SIGSPATIAL international workshop on computational transportation science, pp 20\u201325. ACM","DOI":"10.1145\/2442942.2442947"},{"key":"274_CR30","doi-asserted-by":"crossref","unstructured":"Tielert T, Rieger D, Hartenstein H, Luz R, Hausberger S (2012) Can v2x communication help electric vehicles save energy?. In: 12Th international conference on ITS telecommunications, pp 232\u2013237","DOI":"10.1109\/ITST.2012.6425172"},{"key":"274_CR31","doi-asserted-by":"crossref","unstructured":"Wang Y, Zheng Y, Xue Y (2014) Travel time estimation of a path using sparse trajectories. In: ACM SIGKDD International conference on knowledge discovery and data mining, pp 25\u201334","DOI":"10.1145\/2623330.2623656"},{"issue":"4","key":"274_CR32","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1023\/A:1020853410145","volume":"6","author":"S Winter","year":"2002","unstructured":"Winter S (2002) Modeling costs of turns in route planning. GeoInformatica 6 (4):345\u2013361","journal-title":"GeoInformatica"},{"issue":"2","key":"274_CR33","first-page":"467","volume":"65","author":"B Wu","year":"2013","unstructured":"Wu B (2013) A simpler and more efficient algorithm for the next-to-shortest path problem. Algorithmica 65(2):467\u2013479. doi: 10.1007\/s00453-011-9601-7","journal-title":"Algorithmica"},{"key":"274_CR34","doi-asserted-by":"crossref","unstructured":"Yuan J, Zheng Y, Xie X, Sun G (2011) Driving with knowledge from the physical world. Kdd:316\u2013324","DOI":"10.1145\/2020408.2020462"}],"container-title":["GeoInformatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-016-0274-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10707-016-0274-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-016-0274-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,20]],"date-time":"2023-08-20T22:14:03Z","timestamp":1692569643000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10707-016-0274-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,14]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["274"],"URL":"https:\/\/doi.org\/10.1007\/s10707-016-0274-x","relation":{},"ISSN":["1384-6175","1573-7624"],"issn-type":[{"value":"1384-6175","type":"print"},{"value":"1573-7624","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,11,14]]}}}