{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T22:36:37Z","timestamp":1772836597480,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2008,5,10]],"date-time":"2008-05-10T00:00:00Z","timestamp":1210377600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2009,4]]},"DOI":"10.1007\/s00500-008-0313-0","type":"journal-article","created":{"date-parts":[[2008,5,9]],"date-time":"2008-05-09T10:36:27Z","timestamp":1210329387000},"page":"551-558","source":"Crossref","is-referenced-by-count":5,"title":["A hill-jump algorithm of Hopfield neural network for shortest path problem in communication network"],"prefix":"10.1007","volume":"13","author":[{"given":"Rong-Long","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shan-Shan","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kozo","family":"Okazaki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,5,10]]},"reference":[{"issue":"4","key":"313_CR1","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0895-7177(96)00006-4","volume":"23","author":"AI Adamatzky","year":"1996","unstructured":"Adamatzky AI (1996) Computation of shortest path in cellular automata. Math Comput Model 23(4): 105\u2013113","journal-title":"Math Comput Model"},{"key":"313_CR2","doi-asserted-by":"crossref","first-page":"941","DOI":"10.1109\/72.286889","volume":"4","author":"M Ali","year":"1993","unstructured":"Ali M, Kamoum F (1993) Neural networks for shortest path computation and routing in computer networks. IEEE Trans Neural Netw 4: 941\u2013954","journal-title":"IEEE Trans Neural Netw"},{"key":"313_CR3","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1109\/12.144623","volume":"41","author":"JK Antonio","year":"1992","unstructured":"Antonio JK, Huang GM, Tsai WK (1992) A fast distributed shortest path algorithm for a class of hierarchically clustered data networks. IEEE Trans Comput 41: 710\u2013724","journal-title":"IEEE Trans Comput"},{"issue":"3","key":"313_CR4","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1109\/65.386051","volume":"9","author":"C Baransel","year":"1995","unstructured":"Baransel C, Dobosiewiez W, Gburzynski P (1995) Routing in multihop packet switching networks: Gb\/s challenge. IEEE Net 9(3): 38\u201361","journal-title":"IEEE Net"},{"key":"313_CR5","doi-asserted-by":"crossref","first-page":"911","DOI":"10.1109\/TCOM.1984.1096159","volume":"32","author":"DP Bertsekas","year":"1984","unstructured":"Bertsekas DP, Gafni E, Gallager RG (1984) Second-derivative routing algorithms for minimum delay distributed routing in networks. IEEE Trans Commum 32: 911\u2013919","journal-title":"IEEE Trans Commum"},{"issue":"2","key":"313_CR6","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0305-0548(83)90030-8","volume":"10","author":"L Bodin","year":"1983","unstructured":"Bodin L, Golden BL, Assad A, Ball M (1983) Routing and scheduling of vehicles and crews: the state of the art. Comput Oper Res 10(2): 63\u2013211","journal-title":"Comput Oper Res"},{"issue":"3","key":"313_CR7","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/S0951-8320(02)00174-6","volume":"78","author":"M Claudio","year":"2002","unstructured":"Claudio M, Rocco S, Moreno J (2002) Network reliability assessment using a cellular automata approach. Reliab Eng Syst Saf 78(3): 289\u2013295","journal-title":"Reliab Eng Syst Saf"},{"key":"313_CR8","doi-asserted-by":"crossref","first-page":"1062","DOI":"10.1109\/T-C.1974.223806","volume":"23","author":"DG Cantor","year":"1974","unstructured":"Cantor DG, Gerla M (1974) Optimal routing in a packet-switched computer network. IEEE Trans Comp 23: 1062\u20131069","journal-title":"IEEE Trans Comp"},{"key":"313_CR9","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF01386390","volume":"1","author":"EN Dijkstra","year":"1959","unstructured":"Dijkstra EN (1959) A note on two problems in connection with graphs. Numer Math 1: 261\u2013271","journal-title":"Numer Math"},{"key":"313_CR10","doi-asserted-by":"crossref","first-page":"930","DOI":"10.1109\/9.35806","volume":"34","author":"A Ephremides","year":"1989","unstructured":"Ephremides A, Verdu S (1989) Control and optimization methods in communication network problems. IEEE Trans Automat Contr 34: 930\u2013942","journal-title":"IEEE Trans Automat Contr"},{"issue":"2","key":"313_CR11","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1002\/net.3230010202","volume":"1","author":"H Frand","year":"1971","unstructured":"Frand H, Chou W (1971) Routing in computer networks. Network 1(2): 99\u2013122","journal-title":"Network"},{"key":"313_CR12","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1002\/net.3230030202","volume":"3","author":"L Fratta","year":"1973","unstructured":"Fratta L, Gerla M, Kleinrock L (1973) The flow deviation method: an approach to store-and-forward communication network design. Networks 3: 97\u2013133","journal-title":"Networks"},{"key":"313_CR13","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1109\/TCOM.1977.1093711","volume":"25","author":"R Gallager","year":"1977","unstructured":"Gallager R (1977) Minimum delay routing algorithm using distributed computation. IEEE Trans Commum 25: 73\u201385","journal-title":"IEEE Trans Commum"},{"key":"313_CR14","doi-asserted-by":"crossref","first-page":"3088","DOI":"10.1073\/pnas.81.10.3088","volume":"81","author":"JJ Hopfield","year":"1984","unstructured":"Hopfield JJ (1984) Neurons with graded response have collective computational properties like those of two-state neurons. Proc Natl Acad Sci 81: 3088\u20133092","journal-title":"Proc Natl Acad Sci"},{"key":"313_CR15","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00339943","volume":"52","author":"JJ Hopfield","year":"1985","unstructured":"Hopfield JJ, Tank DW (1985) \u2018Neural\u2019 computation of decisions in optimization problems. Bio Cybern 52: 141\u2013152","journal-title":"Bio Cybern"},{"key":"313_CR16","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1109\/70.88143","volume":"7","author":"S Jun","year":"1991","unstructured":"Jun S, shin KG (1991) shortest path algorithm path planning in distributed workspace using dominance relation. IEEE Trans Robot Aotomat 7: 342\u2013350","journal-title":"IEEE Trans Robot Aotomat"},{"key":"313_CR17","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1109\/TNN.2002.806621","volume":"15","author":"T Kwok","year":"2004","unstructured":"Kwok T, Smith KA (2004) A noisy self-organizing neural network with bifurcation dynamics for combinatorial optimization. IEEE Trans Neural Netw 15: 84\u201398","journal-title":"IEEE Trans Neural Netw"},{"issue":"2","key":"313_CR18","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1109\/49.824797","volume":"18","author":"P Marbach","year":"2000","unstructured":"Marbach P, Mihatsch O, Tsitsiklis JN (2000) Call admission control and routing in integrated service networks using neuron-dynamic programming. IEEE J Selec Areas Commun 18(2): 197\u2013208","journal-title":"IEEE J Selec Areas Commun"},{"issue":"10","key":"313_CR19","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/35.466222","volume":"33","author":"YK Park","year":"1995","unstructured":"Park YK, Lee G (1995) Application of neural networks in high-speed communication networks. IEEE Commun Mag 33(10): 68\u201374","journal-title":"IEEE Commun Mag"},{"key":"313_CR20","doi-asserted-by":"crossref","first-page":"1108","DOI":"10.1109\/TSMCB.2003.821458","volume":"34","author":"S Salcedo-Sanz","year":"2004","unstructured":"Salcedo-Sanz S, Santiago-Mozos R, Bousono-Calzon C (2004) A hybrid Hopfield network-simulated annealing approach for frequency assignment in satellite communications systems. IEEE Trans Syst Man Cybern Part B 34: 1108\u20131116","journal-title":"IEEE Trans Syst Man Cybern Part B"},{"key":"313_CR21","doi-asserted-by":"crossref","first-page":"855","DOI":"10.1109\/26.2815","volume":"36","author":"DM Topkis","year":"1988","unstructured":"Topkis DM (1988) A k shortest path algorithm for adaptive routing in communication networks. IEEE Trans Commun 36: 855\u2013859","journal-title":"IEEE Trans Commun"},{"key":"313_CR22","doi-asserted-by":"crossref","first-page":"1289","DOI":"10.1016\/S0893-6080(02)00067-9","volume":"15","author":"P Venkataram","year":"2002","unstructured":"Venkataram P, Ghosal S, Kumar BP (2002) Neural network based optimal routing algorithm for communication networks. Neural Netw 15: 1289\u20131298","journal-title":"Neural Netw"},{"issue":"6","key":"313_CR23","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1109\/81.503260","volume":"43","author":"J Wang","year":"1996","unstructured":"Wang J (1996) A recurrent neural network for solving the shortest path problem. IEEE Trans Circuits Syst-1 Fundam Theor Appl 43(6): 482\u2013486","journal-title":"IEEE Trans Circuits Syst-1 Fundam Theor Appl"},{"key":"313_CR24","doi-asserted-by":"crossref","first-page":"1379","DOI":"10.1109\/26.99144","volume":"39","author":"Z Wang","year":"1991","unstructured":"Wang Z, Browning DW (1991) An optimal distributed routing algorithm. IEEE Trans Commum 39: 1379\u20131387","journal-title":"IEEE Trans Commum"},{"key":"313_CR25","doi-asserted-by":"crossref","unstructured":"Wang CJ, Weisseler PN (1995) The use of artificial neural networks for optimal message routing. IEEE Netw 16\u201324","DOI":"10.1109\/65.372652"},{"key":"313_CR26","doi-asserted-by":"crossref","first-page":"2119","DOI":"10.1109\/TSMCB.2004.829778","volume":"34","author":"LP Wang","year":"2004","unstructured":"Wang LP, Li S, Tian FY, Fu XJ (2004) A noisy chaotic neural network for solving combinatorial optimization problems: stochastic chaotic simulated annealing. IEEE Trans Syst Man Cybern Part B Cybern 34: 2119\u20132125","journal-title":"IEEE Trans Syst Man Cybern Part B Cybern"},{"key":"313_CR27","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1002\/net.3230030302","volume":"3","author":"BJ Yaged","year":"1973","unstructured":"Yaged BJ (1973) Minimum cost routing for dynamic network models. Networks 3: 193\u2013224","journal-title":"Networks"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-008-0313-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-008-0313-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-008-0313-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,26]],"date-time":"2024-02-26T01:52:16Z","timestamp":1708912336000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-008-0313-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,5,10]]},"references-count":27,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2009,4]]}},"alternative-id":["313"],"URL":"https:\/\/doi.org\/10.1007\/s00500-008-0313-0","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,5,10]]}}}