{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T12:31:11Z","timestamp":1771677071317,"version":"3.50.1"},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007,8]]},"DOI":"10.1109\/coginf.2007.4341919","type":"proceedings-article","created":{"date-parts":[[2007,10,9]],"date-time":"2007-10-09T13:45:54Z","timestamp":1191937554000},"page":"419-423","source":"Crossref","is-referenced-by-count":1,"title":["Research on the Algorithm for K-Shortest Paths Problem based on A* in Complicated Network"],"prefix":"10.1109","author":[{"given":"Lichao","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jia","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yingjun","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Binhong","family":"Xie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(02)00230-7"},{"key":"ref11","first-page":"367","article-title":"Alternate path routing algorithm for traffic engineering in the Intermet[A]. Information Technology: Coding and Computing [Computers and Communications][C]","volume":"31","author":"subramanian","year":"2003","journal-title":"Proc ITC"},{"key":"ref12","first-page":"1159","article-title":"On the heuristics of a or A* algorithm in ITS and robot path-planning[C]","volume":"10","author":"takayuki","year":"2003","journal-title":"Proceedings of the 2003 IEEE\/ RSJ Intl conference on intelligent robots and systems las Vegas"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s11107-006-0027-0"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1007\/978-3-540-31957-3_21","article-title":"K-Shortest paths q-routing: A new qos routing algorithm in telecommunication networks[J]","volume":"3421","author":"hoceini","year":"2005","journal-title":"Lecture Notes in Computer Science"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48318-7_4"},{"key":"ref16","first-page":"422","article-title":"Research and design of the city public transportation query system[J]","volume":"25","author":"zhang","year":"2005","journal-title":"Computer Applications"},{"key":"ref17","first-page":"32","article-title":"Design and implementation of the City Intelligent Traffic Query System[J]","volume":"29","author":"chen","year":"2003","journal-title":"Computerengineering"},{"key":"ref18","first-page":"743","author":"gang","year":"2001","journal-title":"Ramakrishnan K G A prune an algorithm for finding K shortest paths subject to multiple constraints[C]"},{"key":"ref19","author":"wang","year":"2005","journal-title":"Principle and Method of Artificial Intelligence"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1999.1048"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1080"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/BF02592101"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1287\/opre.47.3.445"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/11523468_21","article-title":"Replacement Paths and K simple shortest paths in unweighted directed graphs[J]","volume":"3580","author":"roditty","year":"2005","journal-title":"Lecture Notes in Computer Science"},{"key":"ref7","article-title":"Shortest paths algorithms: Design, analysis, implementation and experimental evaluation","author":"guozhen","year":"1999","journal-title":"Department of Computer Science and Engineering"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1998.0980"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1998.0968"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/971617.971643"}],"event":{"name":"6th IEEE International Conference on Cognitive Informatics","start":{"date-parts":[[2007,8,6]]},"end":{"date-parts":[[2007,8,8]]}},"container-title":["6th IEEE International Conference on Cognitive Informatics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4341857\/4341858\/04341919.pdf?arnumber=4341919","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,17]],"date-time":"2017-06-17T19:46:25Z","timestamp":1497728785000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4341919\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,8]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/coginf.2007.4341919","relation":{},"subject":[],"published":{"date-parts":[[2007,8]]}}}