{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T04:32:01Z","timestamp":1775190721415,"version":"3.50.1"},"reference-count":23,"publisher":"World Scientific Pub Co Pte Lt","issue":"06","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Info. Tech. Dec. Mak."],"published-print":{"date-parts":[[2016,11]]},"abstract":"<jats:p> Travel costs on road networks always change over time which implies road networks are time dependent. Most studies on time-dependent road networks simply find the shortest path with the least travel time without considering waiting at some nodes, or fuel consumption and toll fee. In real-world applications or computer games, waiting may be allowed at some nodes but disallowed at other nodes; a user can traverse an edge at different speeds; monetary travel cost contains fuel cost and toll fees; and users usually prefer the minimum-cost route under time and speed constraints. Therefore, we study Cost-Optimal Time-dEpendent Routing (COTER) problem with time and speed constraints. We utilize two fuel consumption models and compute the minimum fuel consumption with given travel time for highway edges via nonlinear optimization. We allow the toll fee function to be an arbitrary single-valued time-dependent function. We define an Optimal Cost (OC) function for each candidate node [Formula: see text], and derive the recurrence relation formula between [Formula: see text]\u2019s incoming neighbors\u2019 OC-functions and [Formula: see text]\u2019s OC-functions. To solve COTER, we propose a five-step algorithm, namely, ALG-COTER, which uses Fibonacci-heap optimized Dijkstra, topological sorting, dynamic programming, binary min-heap optimization, nonlinear optimization, and backtracking algorithms. Experimental results on three real-world road networks of different sizes demonstrate that our algorithm finds the optimal route efficiently and is scalable to different parameters. <\/jats:p>","DOI":"10.1142\/s0219622016500437","type":"journal-article","created":{"date-parts":[[2016,10,14]],"date-time":"2016-10-14T11:18:10Z","timestamp":1476443890000},"page":"1413-1450","source":"Crossref","is-referenced-by-count":1,"title":["Cost-Optimal Time-dEpendent Routing with Time and Speed Constraints in Directed Acyclic Road Networks"],"prefix":"10.1142","volume":"15","author":[{"given":"Yaqiong","family":"Liu","sequence":"first","affiliation":[{"name":"Beijing Key Laboratory of Network System Architecture and Convergence, School of Information and Communication Engineering, Beijing University of Posts and Telecommunications, 100876, P.\u00a0R.\u00a0China"}]},{"given":"Hock Soon","family":"Seah","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Nanyang Technological University, 639798, Singapore"}]},{"given":"Guochu","family":"Shou","sequence":"additional","affiliation":[{"name":"Beijing Key Laboratory of Network System Architecture and Convergence, School of Information and Communication Engineering, Beijing University of Posts and Telecommunications, 100876, P.\u00a0R.\u00a0China"}]}],"member":"219","published-online":{"date-parts":[[2016,11,22]]},"reference":[{"key":"S0219622016500437BIB002","doi-asserted-by":"publisher","DOI":"10.1080\/13658810601079759"},{"key":"S0219622016500437BIB003","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-005-0177-1"},{"key":"S0219622016500437BIB004","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-05465-5_8"},{"key":"S0219622016500437BIB005","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38527-8_5"},{"key":"S0219622016500437BIB006","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2002.1033772"},{"issue":"1","key":"S0219622016500437BIB008","first-page":"1","volume":"18","author":"Batz G. V.","year":"2013","journal-title":"ACM Journal of Experimental Algorithmics"},{"key":"S0219622016500437BIB009","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1110.0401"},{"key":"S0219622016500437BIB010","first-page":"5","volume":"13","author":"Holzer M.","year":"2009","journal-title":"Journal of Educational Administration"},{"key":"S0219622016500437BIB011","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2011.2123096"},{"key":"S0219622016500437BIB012","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-012-0304-8"},{"key":"S0219622016500437BIB013","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2281503"},{"key":"S0219622016500437BIB014","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2012.2198214"},{"key":"S0219622016500437BIB015","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45643-0_4"},{"key":"S0219622016500437BIB016","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2008.198"},{"key":"S0219622016500437BIB017","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11206-0_10"},{"key":"S0219622016500437BIB019","doi-asserted-by":"publisher","DOI":"10.1142\/S0219622012500095"},{"key":"S0219622016500437BIB020","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2014.02.137"},{"key":"S0219622016500437BIB022","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350234"},{"key":"S0219622016500437BIB023","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2011.2170680"},{"key":"S0219622016500437BIB026","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0037(199705)29:3<141::AID-NET2>3.0.CO;2-H"},{"key":"S0219622016500437BIB027","doi-asserted-by":"publisher","DOI":"10.14778\/2732939.2732941"},{"key":"S0219622016500437BIB028","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2014.2308283"},{"issue":"12","key":"S0219622016500437BIB030","first-page":"31","volume":"56","author":"Ak\u00e7elik R.","year":"1986","journal-title":"Ite Journal"}],"container-title":["International Journal of Information Technology &amp; Decision Making"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0219622016500437","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T13:29:05Z","timestamp":1565098145000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0219622016500437"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11]]},"references-count":23,"journal-issue":{"issue":"06","published-online":{"date-parts":[[2016,11,22]]},"published-print":{"date-parts":[[2016,11]]}},"alternative-id":["10.1142\/S0219622016500437"],"URL":"https:\/\/doi.org\/10.1142\/s0219622016500437","relation":{},"ISSN":["0219-6220","1793-6845"],"issn-type":[{"value":"0219-6220","type":"print"},{"value":"1793-6845","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,11]]}}}