{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T14:48:43Z","timestamp":1773931723059,"version":"3.50.1"},"reference-count":40,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61603094"],"award-info":[{"award-number":["61603094"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61633002"],"award-info":[{"award-number":["61633002"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Cybern."],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1109\/tcyb.2020.2974832","type":"journal-article","created":{"date-parts":[[2020,3,4]],"date-time":"2020-03-04T21:20:49Z","timestamp":1583356849000},"page":"6274-6283","source":"Crossref","is-referenced-by-count":21,"title":["Efficient Heuristic Algorithms for Single-Vehicle Task Planning With Precedence Constraints"],"prefix":"10.1109","volume":"51","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6782-5571","authenticated-orcid":false,"given":"Xiaoshan","family":"Bai","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5472-562X","authenticated-orcid":false,"given":"Ming","family":"Cao","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6789-4411","authenticated-orcid":false,"given":"Weisheng","family":"Yan","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5549-312X","authenticated-orcid":false,"given":"Shuzhi Sam","family":"Ge","sequence":"additional","affiliation":[]},{"given":"Xiaoyu","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","author":"weiss","year":"1993","journal-title":"Data Structures and Algorithm Analysis in C"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.6028\/jres.071B.032"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-020-09912-1"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1049\/iet-cta.2018.6125"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.04.044"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2017.2722541"},{"key":"ref37","author":"williamson","year":"1985","journal-title":"Combinatorics for Computer Science"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-63307-3_51"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2005.01.005"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2019.2914113"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973594"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/s10100-015-0422-7"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2017.07.056"},{"key":"ref12","volume":"3","author":"lawler","year":"1985","journal-title":"The Traveling Salesman Problem A Guided Tour of Combinatorial Optimization"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(03)00158-8"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/JSYST.2018.2838072"},{"key":"ref15","first-page":"423","article-title":"Review of different heuristic algorithms for solving travelling salesman problem","volume":"8","author":"raman","year":"2017","journal-title":"Int J Adv Res Comput Sci"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1287\/opre.18.6.1138"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"316","DOI":"10.7551\/mitpress\/4299.003.0028","article-title":"Solving small TSPS with constraints","volume":"97","author":"caseau","year":"1997","journal-title":"Proc Int Conf Logic Program (ICLP)"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1287\/opre.21.2.498"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2008.12.001"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585767"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1142\/S2301385019500018"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.15807\/jorsj.34.152"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2017.2743164"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2019.2917179"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1115\/DSCC2009-2720"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1631\/FITEE.1800562"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2344291"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1287\/opre.4.1.61"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2015.2418052"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2009.2026926"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2010.02.005"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/JSYST.2016.2601058"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2017.2784187"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1142\/S2301385018500073"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2013.04.002"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2013.07.025"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-009-0296-4"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(01)00227-2"}],"container-title":["IEEE Transactions on Cybernetics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6221036\/9660196\/09023964.pdf?arnumber=9023964","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T16:17:33Z","timestamp":1722529053000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9023964\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12]]},"references-count":40,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tcyb.2020.2974832","relation":{},"ISSN":["2168-2267","2168-2275"],"issn-type":[{"value":"2168-2267","type":"print"},{"value":"2168-2275","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,12]]}}}