{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T22:28:12Z","timestamp":1766269692150,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T00:00:00Z","timestamp":1568764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,9,18]]},"DOI":"10.1145\/3366750.3366752","type":"proceedings-article","created":{"date-parts":[[2019,12,23]],"date-time":"2019-12-23T13:04:52Z","timestamp":1577106292000},"page":"35-39","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["ALT-Based Route Planning in Dynamic Time-Dependent Road Networks"],"prefix":"10.1145","author":[{"given":"Famei","family":"He","sequence":"first","affiliation":[{"name":"Beijing Institute of Technology, Beijing"}]},{"given":"Yina","family":"Xu","sequence":"additional","affiliation":[{"name":"Information Engineering College, Capital Normal University, Beijing"}]},{"given":"Xuren","family":"Wang","sequence":"additional","affiliation":[{"name":"Information Engineering College, Capital Normal University, Beijing"}]},{"given":"Anran","family":"Feng","sequence":"additional","affiliation":[{"name":"Information Engineering College, Capital Normal University, Beijing"}]}],"member":"320","published-online":{"date-parts":[[2019,9,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/bf01386390"},{"key":"e_1_3_2_1_2_1","volume-title":"Linear Programming and Extensions","author":"Dantzig G. B.","year":"1962","unstructured":"Dantzig , G. B. Linear Programming and Extensions . Princeton University : Princeton, USA , 1962 . DOI= https:\/\/doi.org\/10.7249\/r366 10.7249\/r366 Dantzig, G. B. Linear Programming and Extensions. Princeton University: Princeton, USA, 1962. DOI= https:\/\/doi.org\/10.7249\/r366"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68552-4_24"},{"issue":"1","key":"e_1_3_2_1_4_1","first-page":"1","article-title":"Minimum time-dependent travel times with contraction hierarchies","volume":"18","author":"Batz G. V.","year":"2013","unstructured":"Batz , G. V. , Geisberger , R. , Sanders , P. , Minimum time-dependent travel times with contraction hierarchies . ACM J. Exp. Algorithmics . 2013 , 18 ( 1 ), 1 -- 43 . DOI= https:\/\/doi.org\/10.1145\/2444016.2444020 10.1145\/2444016.2444020 Batz, G. V., Geisberger, R., Sanders, P., et al. Minimum time-dependent travel times with contraction hierarchies. ACM J. Exp. Algorithmics. 2013, 18(1), 1--43. DOI= https:\/\/doi.org\/10.1145\/2444016.2444020","journal-title":"ACM J. Exp. Algorithmics"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1064546.1103378"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.20438"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1671970.1671976"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-010-9461-6"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-009-9341-0"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72845-0_5"},{"key":"e_1_3_2_1_14_1","volume-title":"Fastest paths in time-dependent networks for intelligent vehicle-highway systems applications. Intell. Veh. highway syst. J","author":"Kaufman D. E.","year":"1993","unstructured":"Kaufman , D. E. , Smith , R. L. Fastest paths in time-dependent networks for intelligent vehicle-highway systems applications. Intell. Veh. highway syst. J ., 1993 , 1(1), 1--11. DOI= https:\/\/doi.org\/10.1080\/10248079308903779 10.1080\/10248079308903779 Kaufman, D. E., Smith, R. L. Fastest paths in time-dependent networks for intelligent vehicle-highway systems applications. Intell. Veh. highway syst. J., 1993, 1(1), 1--11. DOI= https:\/\/doi.org\/10.1080\/10248079308903779"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.893870"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/JCN.2007.6182886"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69507-3_6"}],"event":{"name":"MLMI 2019: 2019 2nd International Conference on Machine Learning and Machine Intelligence","acronym":"MLMI 2019","location":"Jakarta Indonesia"},"container-title":["Proceedings of the 2019 2nd International Conference on Machine Learning and Machine Intelligence"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3366750.3366752","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3366750.3366752","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:44:39Z","timestamp":1750203879000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3366750.3366752"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,18]]},"references-count":15,"alternative-id":["10.1145\/3366750.3366752","10.1145\/3366750"],"URL":"https:\/\/doi.org\/10.1145\/3366750.3366752","relation":{},"subject":[],"published":{"date-parts":[[2019,9,18]]},"assertion":[{"value":"2019-09-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}