{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T07:00:09Z","timestamp":1760598009201,"version":"3.37.3"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T00:00:00Z","timestamp":1605657600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T00:00:00Z","timestamp":1605657600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["Project No. 61803054"],"award-info":[{"award-number":["Project No. 61803054"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"the Fundamental Research Funds for the Central Universities","award":["2019CDQYZDH030"],"award-info":[{"award-number":["2019CDQYZDH030"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1007\/s00521-020-05468-4","type":"journal-article","created":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T13:03:22Z","timestamp":1605704602000},"page":"6939-6949","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Two-layered ant colony system to improve engraving robot\u2019s efficiency based on a large-scale TSP model"],"prefix":"10.1007","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8980-4210","authenticated-orcid":false,"given":"Zhou","family":"Wu","sequence":"first","affiliation":[]},{"given":"Junjun","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Mingbo","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Liang","family":"Feng","sequence":"additional","affiliation":[]},{"given":"Kai","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,11,18]]},"reference":[{"key":"5468_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijleo.2019.163995","author":"H Yang","year":"2020","unstructured":"Yang H, Zhao J, Wu J, Wang T (2020) Research on a new laser path of laser shock process. Optik. https:\/\/doi.org\/10.1016\/j.ijleo.2019.163995","journal-title":"Optik"},{"issue":"12","key":"5468_CR2","first-page":"1114","volume":"6","author":"R Liang-Zhong","year":"2007","unstructured":"Liang-Zhong R, Li Z, Chao WU (2007) A new tour construction algorism and its application in laser carving path control. J Image Graph 6(12):1114\u20131118","journal-title":"J Image Graph"},{"issue":"2","key":"5468_CR3","first-page":"234","volume":"46","author":"L Nini","year":"2010","unstructured":"Nini L, Zhangwei C, Shize C (2010) Optimization of laser cutting path based on local search and genetic algorithm. Comput Eng Appl 46(2):234\u2013236","journal-title":"Comput Eng Appl"},{"key":"5468_CR4","first-page":"1","volume":"2015","author":"Z Xiang","year":"2015","unstructured":"Xiang Z, Chen Z, Gao X, Wang X, Di F, Li L, Liu G, Zhang Y (2015) Solving large-scale tsp using a fast wedging insertion partitioning approach. Math Probl Eng 2015:1\u20138","journal-title":"Math Probl Eng"},{"key":"5468_CR5","doi-asserted-by":"publisher","first-page":"2935","DOI":"10.1007\/s00521-017-2880-4","volume":"30","author":"MM Alipour","year":"2017","unstructured":"Alipour MM, Razavi SN, Feizi Derakhshi MR, Balafar MA (2017) A hybrid algorithm using a genetic algorithm and multiagent reinforcement learning heuristic to solve the traveling salesman problem. Neural Comput Appl 30:2935\u20132951","journal-title":"Neural Comput Appl"},{"key":"5468_CR6","doi-asserted-by":"crossref","unstructured":"Chen J, Wang Y, Xue X, Cheng S, El-Abd M (2019) Cooperative co-evolutionary metaheuristics for solving large-scale tsp art project. In: IEEE Symp Ser Comput Intell, SSCI, pp 2706\u20132713","DOI":"10.1109\/SSCI44817.2019.9002754"},{"key":"5468_CR7","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.optlastec.2013.09.033","volume":"57","author":"D Wang","year":"2014","unstructured":"Wang D, Yu Q, Ye X (2014) Correction of the field distortion in embedded laser marking system. Opt Laser Technol 57:52\u201356","journal-title":"Opt Laser Technol"},{"key":"5468_CR8","doi-asserted-by":"crossref","unstructured":"Yu Q, Wang D, Yu J (2012) Research on the speed optimization of laser marking. In: Opto-electronics engineering and materials research, pp 411\u2013415","DOI":"10.4028\/www.scientific.net\/AMR.571.411"},{"key":"5468_CR9","doi-asserted-by":"crossref","unstructured":"Orazi L, Montanari F, Campana G, Tomesani L, Cuccolini G (2015) Cnc paths optimization in laser texturing of free form surfaces. In: Procedia Cirp, Elsevier, pp 440\u2013445","DOI":"10.1016\/j.procir.2015.06.100"},{"issue":"3","key":"5468_CR10","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s001700200139","volume":"20","author":"TX Zhong","year":"2002","unstructured":"Zhong TX, Chen JC (2002) A hybrid-coded genetic algorithm based optimisation of non-productive paths in cnc machining. Int J Adv Manuf Technol 20(3):163\u2013168","journal-title":"Int J Adv Manuf Technol"},{"issue":"5","key":"5468_CR11","doi-asserted-by":"publisher","first-page":"e0126141","DOI":"10.1371\/journal.pone.0126141","volume":"10","author":"D Wang","year":"2015","unstructured":"Wang D, Yu Q, Zhang Y (2015) Research on laser marking speed optimization by using genetic algorithm. Plos One 10(5):e0126141","journal-title":"Plos One"},{"key":"5468_CR12","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1007\/s00170-019-03569-6","volume":"103","author":"M Hajad","year":"2019","unstructured":"Hajad M, Tangwarodomnukun V, Jaturanonda C, Dumkum C (2019) Laser cutting path optimization using simulated annealing with an adaptive large neighborhood search. Int J Adv Manuf Technol 103:781\u2013792","journal-title":"Int J Adv Manuf Technol"},{"issue":"14","key":"5468_CR13","doi-asserted-by":"publisher","first-page":"4819","DOI":"10.1080\/00207543.2017.1421784","volume":"56","author":"AG Chentsov","year":"2018","unstructured":"Chentsov AG, Chentsov PA, Petunin AA, Sesekin AN (2018) Model of megalopolises in the tool path optimisation for cnc plate cutting machines. Int J Prod Res 56(14):4819\u20134830","journal-title":"Int J Prod Res"},{"key":"5468_CR14","doi-asserted-by":"crossref","unstructured":"Honda K, Nagata Y, Ono I (2013) A parallel genetic algorithm with edge assembly crossover for 100,000-city scale tsps. In: 2013 IEEE congress on evolutionary computation, pp 1278\u20131285","DOI":"10.1109\/CEC.2013.6557712"},{"key":"5468_CR15","doi-asserted-by":"publisher","first-page":"20281","DOI":"10.1109\/ACCESS.2019.2897580","volume":"7","author":"W Deng","year":"2019","unstructured":"Deng W, Xu J, Zhao H (2019) An improved ant colony optimization algorithm based on hybrid strategies for scheduling problem. IEEE Access 7:20281\u201320292","journal-title":"IEEE Access"},{"key":"5468_CR16","doi-asserted-by":"crossref","unstructured":"Bouzbita S, El\u00a0Afia A, Faizi R (2018) Parameter adaptation for ant colony system algorithm using hidden markov model for tsp problems. In: Proceedings of the international conference on learning and optimization algorithms: theory and applications, pp 1\u20136","DOI":"10.1145\/3230905.3230962"},{"key":"5468_CR17","doi-asserted-by":"crossref","unstructured":"Ping G, Chunbo X, Yi C, Jing L, Yanqing L (2014) Adaptive ant colony optimization algorithm. In: 2014 IEEE international conference on mechatronics and control (ICMC), pp 95\u201398","DOI":"10.1109\/ICMC.2014.7231524"},{"issue":"14","key":"5468_CR18","first-page":"31","volume":"1","author":"Y Wang","year":"2002","unstructured":"Wang Y, Xie J (2002) An adaptive ant colony optimization algorithm and simulation. Acta Simul Syst Sin 1(14):31\u201333","journal-title":"Acta Simul Syst Sin"},{"key":"5468_CR19","doi-asserted-by":"crossref","unstructured":"Mou L (2011) An efficient ant colony system for solving the new generalized traveling salesman problem. In: 2011 IEEE international conference on cloud computing and intelligence systems, pp 407\u2013412","DOI":"10.1109\/CCIS.2011.6045099"},{"key":"5468_CR20","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s00521-018-3638-3","volume":"31","author":"P Anandkumar","year":"2019","unstructured":"Anandkumar P, Nickolas S (2019) Novel local restart strategies with hyper-populated ant colonies for dynamic optimization problems. Neural Comput Appl 31:63\u201376","journal-title":"Neural Comput Appl"},{"issue":"4","key":"5468_CR21","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1016\/S1007-0214(07)70068-8","volume":"12","author":"C Ding","year":"2007","unstructured":"Ding C, Cheng Y, He M (2007) Two-level genetic algorithm for clustered traveling salesman problem with application in large-scale tsps. Tsinghua Sci Tech 12(4):459\u2013465","journal-title":"Tsinghua Sci Tech"},{"key":"5468_CR22","doi-asserted-by":"crossref","unstructured":"Tan LZ, Tan YY, Yun GX, Zhang C (2017) An improved genetic algorithm based on k-means clustering for solving traveling salesman problem. In: International conference on computer science, technology and application (CSTA2016), pp 334\u2013343","DOI":"10.1142\/9789813200449_0042"},{"key":"5468_CR23","doi-asserted-by":"crossref","unstructured":"Ali I, Essam D, Kasmarik K (2019) New designs of k-means clustering and crossover operator for solving traveling salesman problems using evolutionary algorithms. In: 11th international conference on evolutionary computation theory and applications, pp 123\u2013130","DOI":"10.5220\/0007940001230130"},{"key":"5468_CR24","unstructured":"Floyd RW (1976) An adaptive algorithm for spatial gray-scale. In: Proc Soc Inf Disp, pp 75\u201377"},{"key":"5468_CR25","unstructured":"Kaplan CS, Bosch R et al (2005) Tsp art. In: Renaissance Banff: mathematics, music, art, culture, bridges conference, pp 301\u2013308"},{"issue":"1","key":"5468_CR26","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M Dorigo","year":"1997","unstructured":"Dorigo M, Gambardella LM (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evol Comput 1(1):53\u201366","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"5468_CR27","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M Dorigo","year":"1996","unstructured":"Dorigo M, Maniezzo V, Colorni A (1996) Ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern Part B Cybern 26(1):29\u201341","journal-title":"IEEE Trans Syst Man Cybern Part B Cybern"},{"issue":"2","key":"5468_CR28","doi-asserted-by":"publisher","first-page":"329","DOI":"10.3969\/j.issn.1004-4132.2010.02.025","volume":"21","author":"R Gan","year":"2010","unstructured":"Gan R, Guo Q, Chang H, Yi Y (2010) Improved ant colony optimization algorithm for the traveling salesman problems. J Syst Eng Electron 21(2):329\u2013333","journal-title":"J Syst Eng Electron"},{"issue":"4","key":"5468_CR29","first-page":"10","volume":"6","author":"I Brezina Jr","year":"2011","unstructured":"Brezina I Jr, \u010ci\u010dkov\u00e1 Z (2011) Solving the travelling salesman problem using the ant colony optimization. Manag Inf Syst 6(4):10\u201314","journal-title":"Manag Inf Syst"},{"key":"5468_CR30","doi-asserted-by":"crossref","unstructured":"Chang Y (2017) Using k-means clustering to improve the efficiency of ant colony optimization for the traveling salesman problem. In: 2017 IEEE international conference on systems, man, and cybernetics (SMC), pp 379\u2013384","DOI":"10.1109\/SMC.2017.8122633"},{"key":"5468_CR31","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1016\/j.procs.2015.06.090","volume":"54","author":"N Dhanachandra","year":"2015","unstructured":"Dhanachandra N, Manglem K, Chanu YJ (2015) Image segmentation using k-means clustering algorithm and subtractive clustering algorithm. Proc Comput Sci 54:764\u2013771","journal-title":"Proc Comput Sci"},{"issue":"8","key":"5468_CR32","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/j.patrec.2009.09.011","volume":"31","author":"AK Jain","year":"2010","unstructured":"Jain AK (2010) Data clustering: 50 years beyond k-means. Pattern Recogn Lett 31(8):651\u2013666","journal-title":"Pattern Recogn Lett"},{"key":"5468_CR33","unstructured":"TSPLIB (2020) http:\/\/comopt.ifi.uni-heidelberg.de\/software\/TSPLIB95\/"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-020-05468-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-020-05468-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-020-05468-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,30]],"date-time":"2021-05-30T19:36:43Z","timestamp":1622403403000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-020-05468-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,18]]},"references-count":33,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["5468"],"URL":"https:\/\/doi.org\/10.1007\/s00521-020-05468-4","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"type":"print","value":"0941-0643"},{"type":"electronic","value":"1433-3058"}],"subject":[],"published":{"date-parts":[[2020,11,18]]},"assertion":[{"value":"9 May 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 October 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 November 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"Conflict of interest all the authors of the manuscript declared that there are no potential conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}]}}