{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:19:26Z","timestamp":1740169166497,"version":"3.37.3"},"reference-count":51,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100008905","name":"University of Klagenfurt","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100008905","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.2973607","type":"journal-article","created":{"date-parts":[[2020,2,12]],"date-time":"2020-02-12T21:10:26Z","timestamp":1581541826000},"page":"42297-42324","source":"Crossref","is-referenced-by-count":2,"title":["An Efficient, Scalable, and Robust Neuro-Processor-Based Concept for Solving Single-Cycle Traveling Salesman Problems in Complex and Dynamically Reconfigurable Graph Networks"],"prefix":"10.1109","volume":"8","author":[{"given":"Jean Chamberlain","family":"Chedjou","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0773-9476","authenticated-orcid":false,"given":"Kyandoghere","family":"Kyamakya","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2413-2529","authenticated-orcid":false,"given":"Nkiediel","family":"Alain Akwir","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","first-page":"224","article-title":"Parallel ant colony optimization for the traveling salesman problem","author":"max","year":"2006","journal-title":"Ant Colony Optimization and Swarm Intelligence"},{"key":"ref38","first-page":"374","article-title":"An improved greedy genetic algorithm for solving traveling salesman problem","volume":"5","author":"wang","year":"2009","journal-title":"Proc 5th Int Conf Natural Comput (ICNC)"},{"year":"1988","author":"platt","article-title":"Constrained differential optimization for neural networks","key":"ref33"},{"doi-asserted-by":"publisher","key":"ref32","DOI":"10.1109\/CSIE.2009.649"},{"doi-asserted-by":"publisher","key":"ref31","DOI":"10.1109\/ICICTA.2008.265"},{"doi-asserted-by":"publisher","key":"ref30","DOI":"10.1109\/ICEC.1995.487471"},{"year":"1975","author":"holland","journal-title":"Adaptation in Natural and Artificial Systems","key":"ref37"},{"doi-asserted-by":"publisher","key":"ref36","DOI":"10.1016\/j.asoc.2010.03.002"},{"key":"ref35","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00339943","article-title":"Neural computation of decision in optimization problems","volume":"52","author":"hopfield","year":"1985","journal-title":"Biol Cybern"},{"doi-asserted-by":"publisher","key":"ref34","DOI":"10.1007\/BF00204755"},{"doi-asserted-by":"publisher","key":"ref28","DOI":"10.1109\/ICCSE.2011.6028630"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1109\/71.598348"},{"doi-asserted-by":"publisher","key":"ref29","DOI":"10.1162\/08997660252741194"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1016\/j.ejor.2012.08.015"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1002\/j.1538-7305.1965.tb04146.x"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1109\/TRO.2011.2179580"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1287\/opre.26.1.86"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1016\/0377-2217(93)E0238-S"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1016\/S0166-218X(98)00151-6"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1109\/TITS.2011.2174050"},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.1109\/TCYB.2014.2371918"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1016\/j.omega.2004.10.004"},{"doi-asserted-by":"publisher","key":"ref50","DOI":"10.1016\/j.ejor.2013.07.038"},{"doi-asserted-by":"publisher","key":"ref51","DOI":"10.1007\/s10100-016-0437-8"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1109\/TSMCC.2002.804444"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1109\/TCYB.2015.2418737"},{"doi-asserted-by":"publisher","key":"ref40","DOI":"10.3969\/j.issn.1004-4132.2010.02.025"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1287\/opre.21.2.498"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1109\/3468.995530"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1109\/TSMCB.2004.828283"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1109\/TSMCB.2006.880136"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1109\/TSMCB.2008.2006910","article-title":"Multiagent optimization system for solving the traveling salesman problem (TSP)","volume":"39","author":"xie","year":"2009","journal-title":"IEEE Trans Syst Man Cybern B Cybern"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1109\/TSMCC.2012.2188285"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1109\/TSMCB.2012.2231860"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1002\/rnc.1717"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1109\/JSYST.2012.2196229"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1109\/CDC.2012.6426164"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1109\/TNET.2005.863711"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1109\/TCPMT.2013.2252429"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1109\/34.877517"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1049\/ip-gtd:20040052","article-title":"Hybrid algorithm for optimization of m-loop electric power distribution networks","volume":"151","author":"bro?ek","year":"2004","journal-title":"IEE Proc -Gener Transmiss Distrib"},{"doi-asserted-by":"publisher","key":"ref49","DOI":"10.1016\/j.neucom.2016.02.068"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1109\/MM.1983.291091"},{"doi-asserted-by":"publisher","key":"ref46","DOI":"10.1109\/CCDC.2014.6852777"},{"doi-asserted-by":"publisher","key":"ref45","DOI":"10.1016\/S0167-6377(03)00031-2"},{"doi-asserted-by":"publisher","key":"ref48","DOI":"10.1109\/TNNLS.2014.2323218"},{"key":"ref47","first-page":"31014-1","article-title":"A novel general and robust method based on NAOP for solving nonlinear ordinary differential equations and partial differential equations by cellular neural networks","volume":"135","author":"chedjou","year":"2013","journal-title":"J Dyn Syst Meas and Control"},{"doi-asserted-by":"publisher","key":"ref42","DOI":"10.1109\/72.363424"},{"doi-asserted-by":"publisher","key":"ref41","DOI":"10.1007\/978-3-319-05717-0_8"},{"doi-asserted-by":"publisher","key":"ref44","DOI":"10.1016\/j.ejor.2014.03.042"},{"key":"ref43","first-page":"787","article-title":"Ineffectiveness in solving combinatorial optimization problems using a Hopfield network: A new perspective from aliasing effect","volume":"3","author":"yue","year":"1990","journal-title":"Proc Int Joint Conf Neural Netw (IJCNN)"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/08995468.pdf?arnumber=8995468","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,15]],"date-time":"2022-10-15T11:08:36Z","timestamp":1665832116000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8995468\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":51,"URL":"https:\/\/doi.org\/10.1109\/access.2020.2973607","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2020]]}}}