{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T17:10:05Z","timestamp":1756487405605,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,1,26]],"date-time":"2024-01-26T00:00:00Z","timestamp":1706227200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100006374","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71503108, 62077029"],"award-info":[{"award-number":["71503108, 62077029"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"name":"College Students' Innovative Entrepreneurial Training Plan Program","award":["202110320111Y"],"award-info":[{"award-number":["202110320111Y"]}]},{"name":"the research project of modern education technology in Jiangsu","award":["2019-R-82890"],"award-info":[{"award-number":["2019-R-82890"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,1,26]]},"DOI":"10.1145\/3640824.3640863","type":"proceedings-article","created":{"date-parts":[[2024,3,8]],"date-time":"2024-03-08T12:05:28Z","timestamp":1709899528000},"page":"246-252","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Hierarchical Dijkstra Algorithm Based on Generalized Rule Tree for Crowdsourced Express Delivery"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-0892-2763","authenticated-orcid":false,"given":"Junni","family":"Huang","sequence":"first","affiliation":[{"name":"Research Center of Management Science and Technology, Jiangsu Normal University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-9271-0885","authenticated-orcid":false,"given":"Cong","family":"Ding","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Jiangsu Normal University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-1015-8918","authenticated-orcid":false,"given":"Ruofei","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Jiangsu Normal University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-8793-4644","authenticated-orcid":false,"given":"Guanyou","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Jiangsu Normal University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-1806-018X","authenticated-orcid":false,"given":"Chuan","family":"Xu","sequence":"additional","affiliation":[{"name":"Research Center of Management Science and Technology, Jiangsu Normal University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-6215-0491","authenticated-orcid":false,"given":"Mei","family":"Song","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Jiangsu Normal University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0238-0687","authenticated-orcid":false,"given":"Maoyun","family":"Yang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Jiangsu Normal University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,3,8]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"66","article-title":"Hierarchical Dijkstra algorithm for node-constrained shortest paths","author":"Kang W. X.","year":"2017","unstructured":"Kang, W. X., and Xu, Y. Z. 2017. \"Hierarchical Dijkstra algorithm for node-constrained shortest paths,\" Journal of South China University of Technology(JCR Science Edition), pp.66-73.","journal-title":"Journal of South China University of Technology(JCR Science Edition)"},{"key":"e_1_3_2_1_2_1","first-page":"823","article-title":"An improved evolutionary algorithm for solving TSP problems","author":"Cai Z. H.","year":"2005","unstructured":"Cai, Z. H., Peng, J. G., Gao, W., Wei, W., Kang,and L. S. 2005. \"An improved evolutionary algorithm for solving TSP problems,\" Chinese Journal of Computers, pp.823-828.","journal-title":"Chinese Journal of Computers"},{"key":"e_1_3_2_1_3_1","first-page":"89","article-title":"Travel route optimization scheme based on ant colony algorithm","author":"Xu S. Y.","year":"2020","unstructured":"Xu, S. Y., Pan, H. Z., Wang, and H. J. 2020. \"Travel route optimization scheme based on ant colony algorithm,\" Software Guide, pp.89-92.","journal-title":"Software Guide"},{"key":"e_1_3_2_1_4_1","first-page":"741","article-title":"A trusted QoS routing mechanism based on adaptive acoustic particle swarm search","author":"Sun X. X.","year":"2016","unstructured":"Sun, X. X., Wang, X. W., Huang, M. 2016. \"A trusted QoS routing mechanism based on adaptive acoustic particle swarm search,\" Journal of System Simulation, pp.741-748.","journal-title":"Journal of System Simulation"},{"key":"e_1_3_2_1_5_1","first-page":"128","article-title":"A practical loop-free K-path algorithm applied to route planning","author":"Sun Y. G.","year":"2003","unstructured":"Sun, Y. G., Hu, H. D., and Yang, T. 2003. \" A practical loop-free K-path algorithm applied to route planning,\" Computer Engineering, pp.128-130.","journal-title":"Computer Engineering"},{"key":"e_1_3_2_1_6_1","first-page":"1478","article-title":"CROWDDELIVER: Planning City-Wide Package Delivery Paths Leveraging the Crowd of Taxis","author":"Zhang C. C.","year":"2017","unstructured":"Zhang, C. C., and Ma, D. Q. 2017. \"CROWDDELIVER: Planning City-Wide Package Delivery Paths Leveraging the Crowd of Taxis,\" IEEE Transactions on Intelligent Transportation Systems, pp.1478-1496.","journal-title":"IEEE Transactions on Intelligent Transportation Systems"},{"key":"e_1_3_2_1_7_1","first-page":"2181","article-title":"CUDA single source shortest path algorithm parallel optimization","author":"Zhang H.","year":"2019","unstructured":"Zhang, H., Qian, Y. R., Wang, Y. F., Chen, R. H., and Tian, C.W. 2019. \"CUDA single source shortest path algorithm parallel optimization,\" Computer Engineering and Design, pp.2181-2189","journal-title":"Computer Engineering and Design"},{"key":"e_1_3_2_1_8_1","first-page":"1","article-title":"Improved path planning algorithm of InformedRRT\u223c(*) for mobile robots","author":"Jin W. X.","year":"2023","unstructured":"Jin, W. X., Ma, X. H., Zhao, and J. L. 2023. \"Improved path planning algorithm of InformedRRT\u223c(*) for mobile robots,\" Computer Engineering and Applications, pp.1-9.","journal-title":"Computer Engineering and Applications"},{"key":"e_1_3_2_1_9_1","first-page":"1","article-title":"Obstacle recognition and path planning for autonomous robots based on vision","author":"Xie S. B.","year":"2023","unstructured":"Xie, S. B., Liu, C. Y., Chen, F., Huang, Y., Sui, X., Ma, X. Q., Yang, and X. K. 2023. \"Obstacle recognition and path planning for autonomous robots based on vision,\" Journal of Electronic Measurement and Instrumentation, pp.1-8.","journal-title":"Journal of Electronic Measurement and Instrumentation"},{"key":"e_1_3_2_1_10_1","first-page":"515","article-title":"Shortest path query algorithm based on rules","author":"Li Z. F.","year":"2019","unstructured":"Li, Z. F., Yang, Y. J., and Wang, X. 2019. \"Shortest path query algorithm based on rules,\" Journal of Software, pp.515-536.","journal-title":"Journal of Software"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_2_1_12_1","first-page":"100","article-title":"A formal basis for the heuristic determination of minimum cost paths","year":"1968","unstructured":"HART, P. E., NILSSON, N. J., and RAPHAEL, B. 1968. \"A formal basis for the heuristic determination of minimum cost paths,\" IEEE Transactions on Systems Science and Cybernetics, pp.100-107.","journal-title":"IEEE Transactions on Systems Science and Cybernetics"},{"issue":"02","key":"e_1_3_2_1_13_1","first-page":"8","article-title":"A minimum cost maximum flow algorithm based on improved heap optimization Dijkstra algorithm[J]","volume":"2020","author":"Deng G. Q.","year":"2020","unstructured":"Deng, G. Q., and Han, Y. Z. 2020. A minimum cost maximum flow algorithm based on improved heap optimization Dijkstra algorithm[J]. Computer and Modernization, 2020(02):8-11.","journal-title":"Computer and Modernization"},{"issue":"04","key":"e_1_3_2_1_14_1","first-page":"116","article-title":"Urban traffic path analysis based on Dijkstra algorithm optimization[J]","volume":"43","author":"Wu H. B.","year":"2019","unstructured":"Wu, H. B., Wang, Y. J., and Yang, X. X. 2019. Urban traffic path analysis based on Dijkstra algorithm optimization[J]. Journal of Beijing Jiaotong University, 43(04):116-121+130.","journal-title":"Journal of Beijing Jiaotong University"},{"issue":"10","key":"e_1_3_2_1_15_1","first-page":"179","article-title":"Optimization of urban logistics public transport system based on Dijkstra algorithm[J]","volume":"31","author":"Wang S. M.","year":"2021","unstructured":"Wang, S. M., Huang, S., and Zang, Y. S. 2021. Optimization of urban logistics public transport system based on Dijkstra algorithm[J]. Computer Technology and Development, 31(10):179-183+189.","journal-title":"Computer Technology and Development"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.16526\/j"},{"issue":"02","key":"e_1_3_2_1_17_1","first-page":"460","article-title":"Multi-node order ordering model based on simulated annealing algorithm[J]","volume":"26","author":"Xiao Y. Y.","year":"2009","unstructured":"Xiao, Y. Y., Chang, W. B., and Zhang, R. 2009.Multi-node order ordering model based on simulated annealing algorithm[J]. Application Research of Computers, 26(02):460-463+465.","journal-title":"Application Research of Computers"},{"issue":"09","key":"e_1_3_2_1_18_1","first-page":"151","article-title":"Research on network node coverage optimization of improved ant colony algorithm[J]","volume":"28","author":"Peng L. Y.","year":"2011","unstructured":"Peng, L. Y. 2011. Research on network node coverage optimization of improved ant colony algorithm[J]. Computer Simulation,28(09):151-153+255.","journal-title":"Computer Simulation"},{"issue":"21","key":"e_1_3_2_1_19_1","first-page":"25","article-title":"Research on path planning algorithm with necessary point constraint[J]","volume":"56","author":"Wang L.","year":"2020","unstructured":"Wang, L., and Sun, L. F. 2020. Research on path planning algorithm with necessary point constraint[J]. Computer Engineering and Applications, 56(21):25-29.","journal-title":"Computer Engineering and Applications"},{"issue":"18","key":"e_1_3_2_1_20_1","first-page":"297","article-title":"Shortest path algorithm with additional hard constraint over the set of necessary points[J]","volume":"58","author":"Guo Z. Y.","year":"2022","unstructured":"Guo, Z. Y., Zhang, Z. M., He, L. S., Zhen, J. Q., Zhao, S. P., and Kang, Q. 2022. Shortest path algorithm with additional hard constraint over the set of necessary points[J]. Computer Engineering and Applications, 58(18):297-303.","journal-title":"Computer Engineering and Applications"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","unstructured":"Hu J. Zhu Q. Chen R. P. Zhang M.Z. Zhang Z. H. and Liu H.Y. Automotive Engineering 2023 45(03): 350-360.DOI: 10.19562\/j.chinasae.qcgc.2023.03.002.","DOI":"10.19562\/j.chinasae.qcgc.2023.03.002"},{"key":"e_1_3_2_1_22_1","unstructured":"Wang Q. Li Q. and Li D. Computer Engineering and Design 2018 39(01): 17-22.DOI: 10. 16208\/j. issn1000-7024.2018.01.004."},{"key":"e_1_3_2_1_23_1","volume-title":"Journal of Software","author":"Li Y. H.","year":"2022","unstructured":"Li, Y. H., Wang, M., Li, G. H., Luo, C. Y., and Du, X. K. Shortest path query algorithm for multiple rules in dynamic network[J]. Journal of Software, 2022,33(08): 3115-3136. DOI: 10.13328 \/ j.cnki.jos.006285."}],"event":{"name":"CCEAI 2024: 2024 8th International Conference on Control Engineering and Artificial Intelligence","acronym":"CCEAI 2024","location":"Shanghai China"},"container-title":["2024 8th International Conference on Control Engineering and Artificial Intelligence"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3640824.3640863","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3640824.3640863","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T16:45:45Z","timestamp":1756485945000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3640824.3640863"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,26]]},"references-count":23,"alternative-id":["10.1145\/3640824.3640863","10.1145\/3640824"],"URL":"https:\/\/doi.org\/10.1145\/3640824.3640863","relation":{},"subject":[],"published":{"date-parts":[[2024,1,26]]},"assertion":[{"value":"2024-03-08","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}