{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T16:27:29Z","timestamp":1771259249517,"version":"3.50.1"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,10,13]],"date-time":"2022-10-13T00:00:00Z","timestamp":1665619200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,10,13]],"date-time":"2022-10-13T00:00:00Z","timestamp":1665619200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100005230","name":"Natural Science Foundation of Chongqing","doi-asserted-by":"crossref","award":["cstc2018jcyjAX0502"],"award-info":[{"award-number":["cstc2018jcyjAX0502"]}],"id":[{"id":"10.13039\/501100005230","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Scientific and Technological Research Program of Chongqing Municipal Education Commission","award":["KJQN202001222"],"award-info":[{"award-number":["KJQN202001222"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61602072"],"award-info":[{"award-number":["61602072"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Science Foundation","award":["2011927"],"award-info":[{"award-number":["2011927"]}]},{"name":"DoD","award":["W911NF1810475"],"award-info":[{"award-number":["W911NF1810475"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2023,4]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper proposed a collaborative neurodynamic optimization (CNO) method to solve traveling salesman problem (TSP). First, we construct a Hopfield neural network (HNN) with<jats:inline-formula><jats:alternatives><jats:tex-math>$$n \\times n$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mrow><mml:mi>n<\/mml:mi><mml:mo>\u00d7<\/mml:mo><mml:mi>n<\/mml:mi><\/mml:mrow><\/mml:math><\/jats:alternatives><\/jats:inline-formula>neurons for the<jats:italic>n<\/jats:italic>cities. Second, to ensure the convergence of continuous HNN (CHNN), we reformulate TSP to satisfy the convergence condition of CHNN and solve TSP by CHNN. Finally, a population of CHNNs is used to search for local optimal solutions of TSP and the globally optimal solution is obtained using particle swarm optimization. Experimental results show the effectiveness of the CNO approach for solving TSP.<\/jats:p>","DOI":"10.1007\/s40747-022-00884-6","type":"journal-article","created":{"date-parts":[[2022,10,13]],"date-time":"2022-10-13T02:02:47Z","timestamp":1665626567000},"page":"1809-1821","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A collaborative neurodynamic optimization algorithm to traveling salesman problem"],"prefix":"10.1007","volume":"9","author":[{"given":"Jing","family":"Zhong","sequence":"first","affiliation":[]},{"given":"Yuelei","family":"Feng","sequence":"additional","affiliation":[]},{"given":"Shuyu","family":"Tang","sequence":"additional","affiliation":[]},{"given":"Jiang","family":"Xiong","sequence":"additional","affiliation":[]},{"given":"Xiangguang","family":"Dai","sequence":"additional","affiliation":[]},{"given":"Nian","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,13]]},"reference":[{"key":"884_CR1","doi-asserted-by":"crossref","unstructured":"Wang J (1990) A deterministic connectionist machine for the traveling salesman problem. IEEE International conference on systems, man, and cybernetics conference proceedings. IEEE, pp 374\u2013375","DOI":"10.1109\/ICSMC.1990.142130"},{"issue":"6","key":"884_CR2","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1057\/jors.1986.117","volume":"37","author":"EL Lawler","year":"1986","unstructured":"Lawler EL, Lenstra JK, Rinnooy Kan AH, Shmoys DB (1986) Erratum: The traveling salesman problem: a guided tour of combinatorial optimization. J Oper Res Soc 37(6):655","journal-title":"J Oper Res Soc"},{"issue":"5\u20136","key":"884_CR3","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1016\/S0893-6080(03)00130-8","volume":"16","author":"SA Mulder","year":"2003","unstructured":"Mulder SA, Wunsch DC II (2003) Million city traveling salesman problem solution by divide and conquer clustering with adaptive resonance neural networks. Neural Netw 16(5\u20136):827\u2013832","journal-title":"Neural Netw"},{"key":"884_CR4","doi-asserted-by":"crossref","unstructured":"Zhao K, Liu S, Rong Y, Yu JX (2021) Towards feature-free tsp solver selection: a deep learning approach In: 2021 InternationalJoint Conference on Neural Networks (IJCNN), IEEE, p 1\u20138","DOI":"10.1109\/IJCNN52387.2021.9533538"},{"key":"884_CR5","doi-asserted-by":"crossref","unstructured":"Berger A, Kozma L, Mnich et al (2020) Time- and space-optimal algorithm for the many-visits tsp. ACM Trans Algorithms 16(3):1\u201322","DOI":"10.1145\/3382038"},{"issue":"8","key":"884_CR6","doi-asserted-by":"publisher","first-page":"2554","DOI":"10.1073\/pnas.79.8.2554","volume":"79","author":"JJ Hopfield","year":"1982","unstructured":"Hopfield JJ (1982) Neural networks and physical systems with emergent collective computational abilities. Proc Natl Acad Sci 79(8):2554\u20132558","journal-title":"Proc Natl Acad Sci"},{"issue":"5","key":"884_CR7","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1109\/TCS.1986.1085953","volume":"33","author":"D Tank","year":"1986","unstructured":"Tank D, Hopfield J (1986) Simple \u2018neural\u2019 optimization networks: an A\/D converter, signal decision circuit, and a linear programming circuit. IEEE Trans Circuits Syst 33(5):533\u2013541","journal-title":"IEEE Trans Circuits Syst"},{"issue":"3","key":"884_CR8","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/BF00339943","volume":"52","author":"JJ Hopfield","year":"1985","unstructured":"Hopfield JJ, Tank DW (1985) \u201cNeural\u2019\u2019 computation of decisions in optimization problems. Biol Cybern 52(3):141\u2013152","journal-title":"Biol Cybern"},{"issue":"3","key":"884_CR9","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/S0893-6080(02)00021-7","volume":"15","author":"PM Talav\u00e1n","year":"2002","unstructured":"Talav\u00e1n PM, Y\u00e1\u00f1ez J (2002) Parameter setting of the Hopfield network applied to TSP. Neural Netw 15(3):363\u2013373","journal-title":"Neural Netw"},{"issue":"6","key":"884_CR10","doi-asserted-by":"publisher","first-page":"1331","DOI":"10.1109\/72.728383","volume":"9","author":"Y Xia","year":"1998","unstructured":"Xia Y, Wang J (1998) A general methodology for designing globally convergent optimization neural networks. IEEE Trans Neural Netw 9(6):1331\u20131343","journal-title":"IEEE Trans Neural Netw"},{"issue":"6","key":"884_CR11","doi-asserted-by":"publisher","first-page":"1500","DOI":"10.1109\/TNN.2006.881046","volume":"17","author":"S Liu","year":"2006","unstructured":"Liu S, Wang J (2006) A simplified dual neural network for quadratic programming with its KWTA application. IEEE Trans Neural Netw 17(6):1500\u20131510","journal-title":"IEEE Trans Neural Netw"},{"issue":"8","key":"884_CR12","doi-asserted-by":"publisher","first-page":"1340","DOI":"10.1109\/TNN.2008.2000273","volume":"19","author":"Y Xia","year":"2008","unstructured":"Xia Y, Feng G, Wang J (2008) A novel recurrent neural network for solving nonlinear optimization problems with inequality constraints. IEEE Trans Neural Netw 19(8):1340\u20131353","journal-title":"IEEE Trans Neural Netw"},{"issue":"12","key":"884_CR13","doi-asserted-by":"publisher","first-page":"2022","DOI":"10.1109\/TNN.2008.2003287","volume":"19","author":"X Hu","year":"2008","unstructured":"Hu X, Wang J (2008) An improved dual neural network for solving a class of quadratic programming problems and its $$k$$-winners-take-all application. IEEE Trans Neural Netw 19(12):2022\u20132031","journal-title":"IEEE Trans Neural Netw"},{"issue":"6","key":"884_CR14","doi-asserted-by":"publisher","first-page":"1487","DOI":"10.1109\/TNN.2006.879774","volume":"17","author":"X Hu","year":"2006","unstructured":"Hu X, Wang J (2006) Solving pseudomonotone variational inequalities and pseudoconvex optimization problems using the projection neural network. IEEE Trans Neural Netw 17(6):1487\u20131499","journal-title":"IEEE Trans Neural Netw"},{"issue":"12","key":"884_CR15","doi-asserted-by":"publisher","first-page":"1892","DOI":"10.1109\/TNN.2011.2169682","volume":"22","author":"Z Guo","year":"2011","unstructured":"Guo Z, Liu Q, Wang J (2011) A one-layer recurrent neural network for pseudoconvex optimization subject to linear equality constraints. IEEE Trans Neural Netw 22(12):1892\u20131900","journal-title":"IEEE Trans Neural Netw"},{"issue":"11","key":"884_CR16","doi-asserted-by":"publisher","first-page":"2891","DOI":"10.1109\/TNNLS.2015.2425301","volume":"26","author":"Q Liu","year":"2015","unstructured":"Liu Q, Wang J (2015) A projection neural network for constrained quadratic minimax optimization. IEEE Trans Neural Netw Learn Syst 26(11):2891\u20132900","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"issue":"8","key":"884_CR17","doi-asserted-by":"publisher","first-page":"1747","DOI":"10.1109\/TNNLS.2016.2549566","volume":"28","author":"Q Liu","year":"2016","unstructured":"Liu Q, Yang S, Wang J (2016) A collective neurodynamic approach to distributed constrained optimization. IEEE Trans Neural Netw Learn Syst 28(8):1747\u20131758","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"issue":"3","key":"884_CR18","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1162\/neco.1990.2.3.261","volume":"2","author":"C Peterson","year":"1990","unstructured":"Peterson C (1990) Parallel distributed approaches to combinatorial optimization: benchmark studies on traveling salesman problem. Neural Comput 2(3):261\u2013269","journal-title":"Neural Comput"},{"issue":"5","key":"884_CR19","doi-asserted-by":"publisher","first-page":"1206","DOI":"10.1109\/TNNLS.2016.2524619","volume":"28","author":"Z Yan","year":"2016","unstructured":"Yan Z, Fan J, Wang J (2016) A collective neurodynamic approach to constrained global optimization. IEEE Trans Neural Netw Learn Syst 28(5):1206\u20131215","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"884_CR20","doi-asserted-by":"crossref","unstructured":"Li X, Wang J, Kwong S (2020) Alternative mutation operators in collaborative neurodynamic optimization. In: 2020 10th International conference on information science and technology (ICIST), IEEE, pp 126\u2013133","DOI":"10.1109\/ICIST49303.2020.9202136"},{"key":"884_CR21","doi-asserted-by":"crossref","unstructured":"Leung MF, Wang J (2020) Minimax and biobjective portfolio selection based on collaborative neurodynamic optimization. IEEE Trans Neural Netw Learn Syst 32(7):2825\u20132836","DOI":"10.1109\/TNNLS.2019.2957105"},{"key":"884_CR22","doi-asserted-by":"crossref","unstructured":"Yan Z, Wang J, Li G (2014) A collective neurodynamic optimization approach to bound-constrained nonconvex optimization. Neural Netw 55:20\u201329","DOI":"10.1016\/j.neunet.2014.03.006"},{"key":"884_CR23","doi-asserted-by":"crossref","unstructured":"Glover F, Kochenberger G, Du Y (2019) Quantum bridge analytics I: a tutorial on formulating and using QUBO models. 4OR 17(4):335\u2013371","DOI":"10.1007\/s10288-019-00424-y"},{"issue":"8","key":"884_CR24","doi-asserted-by":"publisher","first-page":"2179","DOI":"10.1016\/j.cor.2004.02.008","volume":"32","author":"PM Talavan","year":"2005","unstructured":"Talavan PM, Yanez J (2005) A continuous Hopfield network equilibrium points algorithm. Comput Oper Res 32(8):2179\u20132196","journal-title":"Comput Oper Res"},{"issue":"5","key":"884_CR25","doi-asserted-by":"publisher","first-page":"1089","DOI":"10.1109\/18.21239","volume":"34","author":"J Bruck","year":"1988","unstructured":"Bruck J, Goodman JW (1988) A generalized convergence theorem for neural networks. IEEE Trans Inf Theory 34(5):1089\u20131092","journal-title":"IEEE Trans Inf Theory"},{"issue":"2","key":"884_CR26","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/BF00364159","volume":"58","author":"M Cottrell","year":"1988","unstructured":"Cottrell M (1988) Stability and attractivity in associative memory networks. Biol Cybern 58(2):129\u2013139","journal-title":"Biol Cybern"},{"issue":"5","key":"884_CR27","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1109\/18.42222","volume":"35","author":"S Dasgupta","year":"1989","unstructured":"Dasgupta S, Ghosh A, Cuykendall R (1989) Convergence in neural memories. IEEE Trans Inf Theory 35(5):1069\u20131072","journal-title":"IEEE Trans Inf Theory"},{"key":"884_CR28","doi-asserted-by":"crossref","unstructured":"Van\u00a0Laarhoven PJ, Aarts EH (1987) Simulated annealing Simulated annealing: theory and applications. Springer, Dordrecht, pp 7\u201315","DOI":"10.1007\/978-94-015-7744-1_2"},{"issue":"2","key":"884_CR29","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF00175354","volume":"4","author":"D Whitley","year":"1994","unstructured":"Whitley D (1994) A genetic algorithm tutorial. Stat Comput 4(2):65\u201385","journal-title":"Stat Comput"},{"issue":"4","key":"884_CR30","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1109\/MCI.2006.329691","volume":"1","author":"M Dorigo","year":"2006","unstructured":"Dorigo M, Birattari M, Stutzle T (2006) Ant colony optimization. IEEE Comput Intell Mag 1(4):28\u201339","journal-title":"IEEE Comput Intell Mag"},{"issue":"3","key":"884_CR31","doi-asserted-by":"publisher","first-page":"2033","DOI":"10.1016\/j.ejor.2005.12.009","volume":"177","author":"R Ruiz","year":"2007","unstructured":"Ruiz R, St\u00fctzle T (2007) A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. Eur J Oper Res 177(3):2033\u20132049","journal-title":"Eur J Oper Res"},{"key":"884_CR32","doi-asserted-by":"crossref","unstructured":"Price KV (2013) Differential evolution. Handbook of optimization. Springer, Berlin, pp 187\u2013214","DOI":"10.1007\/978-3-642-30504-7_8"},{"key":"884_CR33","unstructured":"Wu X, Han J, Cui Q, Chen L, Liang Y, Huang H, Lee HP, Zhou Y, Wu C (2021) Surprisingly popular algorithm-based adaptive Euclidean distance topology learning PSO"},{"key":"884_CR34","doi-asserted-by":"crossref","unstructured":"Zhu SP, Keshtegar B, Seghier MEAB et al (2022) Hybrid and enhanced PSO: novel first order reliability method-based hybrid intelligent approaches. Comput Methods Appl. Proceedings of ICNN\u201995-international conference on neural networks. IEEE Mech Eng 393:114730","DOI":"10.1016\/j.cma.2022.114730"},{"key":"884_CR35","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization 4:1942\u20131948. IEEE","DOI":"10.1109\/ICNN.1995.488968"},{"key":"884_CR36","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.109026","volume":"250","author":"X Dai","year":"2022","unstructured":"Dai X, Wang J, Zhang W (2022) Balanced clustering based on collaborative neurodynamic optimization. Knowl Based Syst 250:109026","journal-title":"Knowl Based Syst"},{"key":"884_CR37","first-page":"4104","volume":"5","author":"J Kennedy","year":"1997","unstructured":"Kennedy J, Eberhart RC (1997) A discrete binary version of the particle swarm algorithm. International conference on systems, man, and cybernetics. Computational cybernetics and simulation. IEEE 5:4104\u20134108","journal-title":"Computational cybernetics and simulation. IEEE"},{"key":"884_CR38","doi-asserted-by":"crossref","unstructured":"Hopfield JJ, Tank DW (1985) \u201cNeural\u201d computation of decisions in optimization problems. Biol Cybern 52(3):141\u2013152","DOI":"10.1007\/BF00339943"},{"issue":"1","key":"884_CR39","first-page":"73","volume":"23","author":"S Sun","year":"1995","unstructured":"Sun S, Zheng J (1995) An improved algorithm and theoretical proof of Hopfield network for solving TSP. J Electron 23(1):73\u201378","journal-title":"J Electron"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-022-00884-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-022-00884-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-022-00884-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,5]],"date-time":"2024-10-05T18:09:33Z","timestamp":1728151773000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-022-00884-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,13]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["884"],"URL":"https:\/\/doi.org\/10.1007\/s40747-022-00884-6","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,13]]},"assertion":[{"value":"24 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 September 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 October 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}