{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T11:04:07Z","timestamp":1762254247289,"version":"3.37.3"},"reference-count":55,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100012456","name":"National Social Science Found of China","doi-asserted-by":"publisher","award":["21BGL174"],"award-info":[{"award-number":["21BGL174"]}],"id":[{"id":"10.13039\/501100012456","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2022]]},"DOI":"10.1109\/access.2022.3205756","type":"journal-article","created":{"date-parts":[[2022,9,12]],"date-time":"2022-09-12T19:50:46Z","timestamp":1663012246000},"page":"97142-97164","source":"Crossref","is-referenced-by-count":11,"title":["A Carnivorous Plant Algorithm With Heuristic Decoding Method for Traveling Salesman Problem"],"prefix":"10.1109","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1498-2602","authenticated-orcid":false,"given":"Jiquan","family":"Wang","sequence":"first","affiliation":[{"name":"College of Engineering, Northeast Agricultural University, Harbin, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8691-8514","authenticated-orcid":false,"given":"Panli","family":"Zhang","sequence":"additional","affiliation":[{"name":"College of Engineering, Northeast Agricultural University, Harbin, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3828-0744","authenticated-orcid":false,"given":"Hongyu","family":"Zhang","sequence":"additional","affiliation":[{"name":"College of Engineering, Northeast Agricultural University, Harbin, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6617-1764","authenticated-orcid":false,"given":"Haohao","family":"Song","sequence":"additional","affiliation":[{"name":"College of Engineering, Northeast Agricultural University, Harbin, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5041-9913","authenticated-orcid":false,"given":"Jinling","family":"Bei","sequence":"additional","affiliation":[{"name":"College of Engineering, Northeast Agricultural University, Harbin, China"}]},{"given":"Wenfeng","family":"Sun","sequence":"additional","affiliation":[{"name":"College of Engineering, Northeast Agricultural University, Harbin, China"}]},{"given":"Xiaobo","family":"Sun","sequence":"additional","affiliation":[{"name":"College of Engineering, Northeast Agricultural University, Harbin, China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.925814"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3109298"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-019-09431-y"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2017.0791"},{"volume-title":"The Traveling Salesman and Sequence Scheduling: Quality Solutions Using Genetic Edge Recombination","year":"1991","author":"Whitley","key":"ref5"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2897580"},{"issue":"5","key":"ref7","first-page":"100","article-title":"Adapting the ant colony optimization algorithm to the printed circuit board drilling problem","volume":"3","author":"Eldos","year":"2013","journal-title":"World Comput. Sci. Inf. Technol. J."},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(77)90012-3"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1515\/9781400874651"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(87)90002-2"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2.4.393"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/0206041"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0032050"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1515\/9780691187563-011"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1155\/2021\/6697598"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2016.02.021"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICICTA.2010.461"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2018.06.047"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2007.03.019"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-020-01799-w"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s11071-019-05414-7"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-015-1978-9"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107298"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106833"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/STPEC52385.2021.9718699"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105887"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-020-01713-4"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2018.05.006"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2015.10.006"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.108469"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-021-03304-5"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2017.01.053"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2017.06.007"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2019.04.008"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2017.09.069"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.3390\/sym13010048"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3128433"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.114639"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107275"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107085"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.114282"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106570"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2008.01.005"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2019.100607"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.107199"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1287\/opre.6.6.791"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1287\/opre.21.2.498"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-013-1402-2"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-021-03048-0"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177731944"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1080\/03610928008827904"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.2307\/4615733"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2011.02.002"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3035899"},{"issue":"5","key":"ref55","doi-asserted-by":"crossref","first-page":"1669","DOI":"10.1007\/s00500-016-2432-3","article-title":"A parallel cooperative hybrid method based on ant colony optimization and 3-Opt algorithm for solving traveling salesman problem","volume":"22","author":"\u015eaban","year":"2018","journal-title":"Soft Comput."}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9668973\/09885184.pdf?arnumber=9885184","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T21:06:17Z","timestamp":1705957577000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9885184\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":55,"URL":"https:\/\/doi.org\/10.1109\/access.2022.3205756","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2022]]}}}