{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T15:52:25Z","timestamp":1783525945691,"version":"3.55.0"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100010877","name":"Shenzhen Science and Technology Innovation Commission","doi-asserted-by":"publisher","award":["JCYJ20180508162601910"],"award-info":[{"award-number":["JCYJ20180508162601910"]}],"id":[{"id":"10.13039\/501100010877","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61903144"],"award-info":[{"award-number":["61903144"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006469","name":"Fundo para o Desenvolvimento das Ci\u00eancias e da Tecnologia","doi-asserted-by":"publisher","award":["0047\/2021\/A1"],"award-info":[{"award-number":["0047\/2021\/A1"]}],"id":[{"id":"10.13039\/501100006469","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Open Project of the Shenzhen Institute of Artificial Intelligence and Robotics for Society","award":["AC01202005002"],"award-info":[{"award-number":["AC01202005002"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Automat. Sci. Eng."],"published-print":{"date-parts":[[2024,1]]},"DOI":"10.1109\/tase.2023.3236317","type":"journal-article","created":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T18:17:13Z","timestamp":1685557033000},"page":"895-905","source":"Crossref","is-referenced-by-count":22,"title":["Bi-Trajectory Hybrid Search to Solve Bottleneck-Minimized Colored Traveling Salesman Problems"],"prefix":"10.1109","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4254-6517","authenticated-orcid":false,"given":"Yangming","family":"Zhou","sequence":"first","affiliation":[{"name":"Data-Driven Management Decision Making Laboratory, Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2025-9266","authenticated-orcid":false,"given":"Wenqiang","family":"Xu","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, East China University of Science and Technology, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5408-8752","authenticated-orcid":false,"given":"Mengchu","family":"Zhou","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, New Jersey Institute of Technology, Newark, NJ, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3740-7408","authenticated-orcid":false,"given":"Zhang-Hua","family":"Fu","sequence":"additional","affiliation":[{"name":"Institute of Robotics and Intelligent Manufacturing, The Chinese University of Hong Kong at Shenzhen, Shenzhen, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2371918"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2017.2706720"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2022.3147924"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2004.10.004"},{"issue":"11","key":"ref5","first-page":"2372","article-title":"Hybrid algorithm for colored bottleneck traveling salesman problem","volume":"55","author":"Dong","year":"2018","journal-title":"J. Comput. Res. Develop."},{"issue":"12","key":"ref6","first-page":"18","article-title":"Improved artificial bee colony algorithm for large scale colored bottleneck traveling salesman problem","volume":"39","author":"Dong","year":"2018","journal-title":"J. Commun."},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICNN.1995.488968"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1126\/science.220.4598.671"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/BF00175354"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2012.2219860"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2018.2848116"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2021.3097778"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2022.1186"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2022.3165636"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-16468-7_15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-017-9354-9"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33012262"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2020.3011959"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2022.11.039"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-5273(00)00174-2"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.3182\/20140824-6-ZA-1003.01403"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-008-0312-1"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2014.09.029"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-018-1216-0"},{"key":"ref25","first-page":"160","article-title":"Genetic algorithms for the traveling salesman problem","volume-title":"Proc. 1st Int. Conf. Genetic Algorithms Their Appl.","author":"Grefenstette"},{"issue":"4","key":"ref26","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1023\/A:1009823419804","article-title":"Hybrid evolutionary algorithms for graph coloring","volume":"3","author":"Galinier","year":"1999","journal-title":"J. Combinat. Optim."},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2017.2780274"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2016.07.047"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1049\/iet-its.2016.0282"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.orp.2016.09.002"},{"key":"ref31","first-page":"1","article-title":"Statistical comparisons of classifiers over multiple data sets","volume":"7","author":"Dem\u0161ar","year":"2006","journal-title":"J. Mach. Learn. Res."},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s101070100263"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2018.12.065"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2021.3049323"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2021.3062994"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2021.3129439"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2020.3027860"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/JAS.2022.105752"}],"container-title":["IEEE Transactions on Automation Science and Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8856\/10381526\/10138800.pdf?arnumber=10138800","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,21]],"date-time":"2024-10-21T17:26:19Z","timestamp":1729531579000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10138800\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1]]},"references-count":38,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tase.2023.3236317","relation":{},"ISSN":["1545-5955","1558-3783"],"issn-type":[{"value":"1545-5955","type":"print"},{"value":"1558-3783","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1]]}}}