{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T16:26:51Z","timestamp":1770222411292,"version":"3.49.0"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["21606159"],"award-info":[{"award-number":["21606159"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013317","name":"Key Research and Development Program of Shanxi Province","doi-asserted-by":"crossref","award":["201803D121039"],"award-info":[{"award-number":["201803D121039"]}],"id":[{"id":"10.13039\/501100013317","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2908961","type":"journal-article","created":{"date-parts":[[2019,4,2]],"date-time":"2019-04-02T18:59:37Z","timestamp":1554231577000},"page":"44391-44403","source":"Crossref","is-referenced-by-count":40,"title":["State Transition Simulated Annealing Algorithm for Discrete-Continuous Optimization Problems"],"prefix":"10.1109","volume":"7","author":[{"given":"Xiaoxia","family":"Han","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5426-5691","authenticated-orcid":false,"given":"Yingchao","family":"Dong","sequence":"additional","affiliation":[]},{"given":"Lin","family":"Yue","sequence":"additional","affiliation":[]},{"given":"Quanxi","family":"Xu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.3.4.376"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/72.548187"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2015.08.041"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2013.09.055"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37502-6_78"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.3934\/jimo.2012.8.1039"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1063\/1.1699114"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2017.02.015"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1080\/0305215X.2015.1025775"},{"key":"ref34","first-page":"1040","article-title":"A discrete state transition algorithm for traveling salesman problem","volume":"30","author":"yang","year":"2013","journal-title":"Control Theory Appl"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.mcm.2006.11.035"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/72.363466"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2005.09.043"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-015-0594-2"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1002\/mde.4090110512"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.40.10.1276"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.08.043"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICICTA.2010.461"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2010.02.002"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39930-8_8"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s13042-017-0669-5"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMA.2011.160"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2011.01.039"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICCSE.2011.6028630"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2009.09.014"},{"key":"ref6","first-page":"96","article-title":"Genetic algorithm for the traveling salesman problem using sequential constructive crossover operator","volume":"3","author":"ahmed","year":"2010","journal-title":"International Journal of Biometric and Bioinformatics"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICICIP.2011.6008335"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"648","DOI":"10.1109\/3468.709611","article-title":"An annealing framework with learning memory","volume":"28","author":"lo","year":"1998","journal-title":"IEEE Trans Syst Man Cybern A Syst Humans"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/4235.974843"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/3468.867862"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"kirkpatrick","year":"1983","journal-title":"Science"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585892"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.dam.2004.09.004","article-title":"Combinatorial optimization: Polyhedra and efficiency","volume":"146","author":"schrijver","year":"2005","journal-title":"Discret Appl Math"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(77)90012-3"},{"key":"ref45","doi-asserted-by":"crossref","first-page":"103","DOI":"10.3906\/elk-1210-147","article-title":"A hierarchic approach based on swarm intelligence to solve the traveling salesman problem","volume":"23","author":"g\u00fcnd\u00fcz","year":"2015","journal-title":"Turk J Electr Eng Comput Sci"},{"key":"ref22","first-page":"1323","article-title":"A heuristic approach for finding the global minimum: Adaptive random search technique","volume":"173","author":"hamza\u00e7ebi","year":"2006","journal-title":"Appl Math Comput"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/S0098-1354(97)00005-7"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ISCC-C.2013.13"},{"key":"ref24","first-page":"179","article-title":"A random search approach to finding the global minimum","volume":"5","author":"cura","year":"2010","journal-title":"Int J Contemp Math Sci"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2015.10.006"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2006.08.015"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2018.06.047"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s00607-018-0625-6"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/ICNC.2011.6022345"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2016.08.036"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08679955.pdf?arnumber=8679955","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,10]],"date-time":"2021-08-10T19:41:09Z","timestamp":1628624469000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8679955\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":45,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2908961","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}