{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T23:43:08Z","timestamp":1783035788154,"version":"3.54.6"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,11,12]],"date-time":"2024-11-12T00:00:00Z","timestamp":1731369600000},"content-version":"vor","delay-in-days":366,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["OAC-1725755, OAC-2104078"],"award-info":[{"award-number":["OAC-1725755, OAC-2104078"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,11,12]]},"DOI":"10.1145\/3624062.3625134","type":"proceedings-article","created":{"date-parts":[[2023,11,10]],"date-time":"2023-11-10T13:53:39Z","timestamp":1699624419000},"page":"739-746","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["A Parallel Algorithm for Updating a Multi-objective Shortest Path in Large Dynamic Networks"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3364-8914","authenticated-orcid":false,"given":"Arindam","family":"Khanda","sequence":"first","affiliation":[{"name":"Missouri University of Science and Technology, United States of America"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2100-0643","authenticated-orcid":false,"given":"S. M.","family":"Shovan","sequence":"additional","affiliation":[{"name":"Missouri University of Science and Technology, United States of America"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9471-0868","authenticated-orcid":false,"given":"Sajal K.","family":"Das","sequence":"additional","affiliation":[{"name":"Missouri University of Science and Technology, United States of America"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,11,12]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2015.2485994"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-247X(66)90009-6"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105424"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31880-4_11"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1198513.1198519"},{"key":"e_1_3_2_2_6_1","volume-title":"An appraisal of some shortest-path algorithms. Operations research 17, 3","author":"Dreyfus E","year":"1969","unstructured":"Stuart\u00a0E Dreyfus. 1969. An appraisal of some shortest-path algorithms. Operations research 17, 3 (1969), 395\u2013412."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07959-2_10"},{"key":"e_1_3_2_2_8_1","volume-title":"Multiple Criteria Decision Making Theory and Application: Proceedings of the Third Conference Hagen\/K\u00f6nigswinter, West Germany, August 20\u201324","author":"Fandel G\u00fcnter","year":"2012","unstructured":"G\u00fcnter Fandel and Tomas Gal. 2012. Multiple Criteria Decision Making Theory and Application: Proceedings of the Third Conference Hagen\/K\u00f6nigswinter, West Germany, August 20\u201324, 1979. Vol.\u00a0177. Springer Science & Business Media."},{"key":"e_1_3_2_2_9_1","volume-title":"Applying Probabilistic Model Checking to Path Planning in an Intelligent Transportation System Using Mobility Trajectories and Their Statistical Data.Intelligent Automation & Soft Computing 25, 3","author":"Gao Honghao","year":"2019","unstructured":"Honghao Gao, Wanqiu Huang, and Xiaoxian Yang. 2019. Applying Probabilistic Model Checking to Path Planning in an Intelligent Transportation System Using Mobility Trajectories and Their Statistical Data.Intelligent Automation & Soft Computing 25, 3 (2019)."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/3221322.3221681"},{"key":"e_1_3_2_2_11_1","volume-title":"Robust dynamic multi-objective vehicle routing optimization method","author":"Guo Yi-Nan","year":"2017","unstructured":"Yi-Nan Guo, Jian Cheng, Sha Luo, Dunwei Gong, and Yu Xue. 2017. Robust dynamic multi-objective vehicle routing optimization method. IEEE\/ACM transactions on computational biology and bioinformatics 15, 6 (2017), 1891\u20131903."},{"key":"e_1_3_2_2_12_1","volume-title":"ZeroMQ: messaging for many applications. \" O\u2019Reilly Media","author":"Hintjens Pieter","unstructured":"Pieter Hintjens. 2013. ZeroMQ: messaging for many applications. \" O\u2019Reilly Media, Inc.\"."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2013.6567102"},{"key":"e_1_3_2_2_14_1","volume-title":"Parallel Vertex Color Update on Large Dynamic Networks. In 2022 IEEE 29th International Conference on High Performance Computing, Data, and Analytics (HiPC). IEEE, 115\u2013124","author":"Khanda Arindam","year":"2022","unstructured":"Arindam Khanda, Sanjukta Bhowmick, Xin Liang, and Sajal\u00a0K Das. 2022. Parallel Vertex Color Update on Large Dynamic Networks. In 2022 IEEE 29th International Conference on High Performance Computing, Data, and Analytics (HiPC). IEEE, 115\u2013124."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3524053.3542743"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/MASS52906.2021.00061"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2021.3084096"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2020.101522"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2011.08.030"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1754399.1754400"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(84)90077-8"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(03)00076-2"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1475-3995.2008.00649.x"},{"key":"e_1_3_2_2_24_1","volume-title":"Computational Intelligence and Decision Making","author":"Paix\u00e3o Jos\u00e9\u00a0Manuel","unstructured":"Jos\u00e9\u00a0Manuel Paix\u00e3o and Jos\u00e9\u00a0Luis Santos. 2013. Labeling methods for the general case of the multi-objective shortest path problem\u2013a computational study. In Computational Intelligence and Decision Making. Springer, 489\u2013502."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2015.05.007"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2008.02.002"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1996.0046"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2010.08.003"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"crossref","unstructured":"Ryan\u00a0A. Rossi and Nesreen\u00a0K. Ahmed. 2015. The Network Data Repository with Interactive Graph Analytics and Visualization. In AAAI.","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/3014904.3014945"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2013.89"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(92)90248-8"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2851141.2851145"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2007.70770"}],"event":{"name":"SC-W 2023: Workshops of The International Conference on High Performance Computing, Network, Storage, and Analysis","location":"Denver CO USA","acronym":"SC-W 2023"},"container-title":["Proceedings of the SC '23 Workshops of the International Conference on High Performance Computing, Network, Storage, and Analysis"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3624062.3625134","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3624062.3625134","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3624062.3625134","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T03:02:11Z","timestamp":1755745331000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3624062.3625134"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,12]]},"references-count":34,"alternative-id":["10.1145\/3624062.3625134","10.1145\/3624062"],"URL":"https:\/\/doi.org\/10.1145\/3624062.3625134","relation":{},"subject":[],"published":{"date-parts":[[2023,11,12]]},"assertion":[{"value":"2023-11-12","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}