{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T15:31:37Z","timestamp":1773761497110,"version":"3.50.1"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2021,4,12]],"date-time":"2021-04-12T00:00:00Z","timestamp":1618185600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,4,12]],"date-time":"2021-04-12T00:00:00Z","timestamp":1618185600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1007\/s10489-021-02312-7","type":"journal-article","created":{"date-parts":[[2021,4,12]],"date-time":"2021-04-12T04:02:40Z","timestamp":1618200160000},"page":"8680-8700","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Dynamic reproductive ant colony algorithm based on piecewise clustering"],"prefix":"10.1007","volume":"51","author":[{"given":"Jin","family":"Yu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3879-6329","authenticated-orcid":false,"given":"Xiaoming","family":"You","sequence":"additional","affiliation":[]},{"given":"Sheng","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,4,12]]},"reference":[{"key":"2312_CR1","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.swevo.2018.02.017","volume":"42","author":"Y Zhong","year":"2018","unstructured":"Zhong Y, Lin J, Wang L, Zhang H (2018) Discrete comprehensive learning particle swarm optimization algorithm with metropolis acceptance criterion for traveling salesman problem. Swarm Evol Comput 42:77\u201388","journal-title":"Swarm Evol Comput"},{"key":"2312_CR2","doi-asserted-by":"crossref","unstructured":"Zhang D, You X, Liu S, Yang KK (2019) Multi-colony ant colony optimization based on generalized jaccard similarity recommendation strategy. IEEE Access 7:157303\u2013157317","DOI":"10.1109\/ACCESS.2019.2949860"},{"issue":"9","key":"2312_CR3","doi-asserted-by":"publisher","first-page":"2935","DOI":"10.1007\/s00521-017-2880-4","volume":"30","author":"MM Alipour","year":"2018","unstructured":"Alipour MM, Razavi SN, Derakhshi MRF, Balafar MA (2018) A hybrid algorithm using a genetic algorithm and multiagent reinforcement learning heuristic to solve the traveling salesman problem. Neural Comput Appl 30(9):2935\u20132951","journal-title":"Neural Comput Appl"},{"issue":"1","key":"2312_CR4","first-page":"29","volume":"26","author":"M Dorigo","year":"1996","unstructured":"Dorigo M, Maniezzo Vittorio, Colorni Alberto (1996) Ant system: optimization by a colony of cooperating agents. IEEE Trans Syst 26(1):29\u201341","journal-title":"IEEE Trans Syst"},{"issue":"4","key":"2312_CR5","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1109\/MCI.2006.329691","volume":"1","author":"M Dorigo","year":"2006","unstructured":"Dorigo M, Birattari M, Stutzle T (2006) Ant colony optimization: artificial ants as a computational intelligence technique. IEEE Comput Intell Mag 1(4):28\u201339","journal-title":"IEEE Comput Intell Mag"},{"issue":"9","key":"2312_CR6","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T Stutzle","year":"2000","unstructured":"Stutzle T, Hoos HH (2000) Max-min ant system. Futur Gener Comput Syst 16(9):889\u2013914","journal-title":"Futur Gener Comput Syst"},{"issue":"5","key":"2312_CR7","doi-asserted-by":"publisher","first-page":"3141","DOI":"10.1007\/s00500-020-04670-9","volume":"24","author":"LF de Mingo L\u00f3pez","year":"2020","unstructured":"de Mingo L\u00f3pez LF, Blas NG, Lucas CM (2020) Ant colony systems optimization applied to bnf grammars rule derivation (acord algorithm). Soft Comput 24(5):3141\u20133154","journal-title":"Soft Comput"},{"key":"2312_CR8","doi-asserted-by":"crossref","unstructured":"Zhang Z, Hu F, Na Z (2018) Ant colony algorithm for satellite control resource scheduling problem. Applied Intelligence","DOI":"10.1007\/s10489-018-1144-z"},{"key":"2312_CR9","doi-asserted-by":"publisher","first-page":"106621","DOI":"10.1016\/j.asoc.2020.106621","volume":"96","author":"B Khelifa","year":"2020","unstructured":"Khelifa B, Laouar MR (2020) A holonic intelligent decision support system for urban project planning by ant colony optimization algorithm. Appl Soft Comput 96:106621","journal-title":"Appl Soft Comput"},{"key":"2312_CR10","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/j.ins.2017.12.047","volume":"433-434","author":"J Ning","year":"2018","unstructured":"Ning J, Zhang Q, Zhang C, Zhang B (2018) A best-path-updating information-guided ant colony optimization algorithm. Inf Sci 433-434:142\u2013162","journal-title":"Inf Sci"},{"key":"2312_CR11","doi-asserted-by":"publisher","first-page":"105285","DOI":"10.1016\/j.knosys.2019.105285","volume":"192","author":"M Paniri","year":"2020","unstructured":"Paniri M, Dowlatshahi MB, Nezamabadi-pour H (2020) Mlaco: A multi-label feature selection algorithm based on ant colony optimization. Knowl-Based Syst 192:105285","journal-title":"Knowl-Based Syst"},{"issue":"6","key":"2312_CR12","doi-asserted-by":"publisher","first-page":"1555","DOI":"10.1007\/s00521-019-04172-2","volume":"32","author":"Q Luo","year":"2020","unstructured":"Luo Q, Wang H, Zheng Y, He J (2020) Research on path planning of mobile robot based on improved ant colony algorithm. Neural Comput Appl 32(6):1555\u20131566","journal-title":"Neural Comput Appl"},{"key":"2312_CR13","doi-asserted-by":"crossref","unstructured":"Wu D, Xu J, Zhao H (2019) An improved ant colony optimization algorithm based on hybrid strategies for scheduling problem. IEEE Access:1\u20131","DOI":"10.1109\/ACCESS.2019.2919772"},{"key":"2312_CR14","doi-asserted-by":"crossref","unstructured":"Mart\u00ednez PA, Garc\u00eda JM Acotsp-mf: A memory-friendly and highly scalable acotsp approach. Eng Appl Artif Intell 99","DOI":"10.1016\/j.engappai.2020.104131"},{"key":"2312_CR15","doi-asserted-by":"crossref","unstructured":"Zhao D, Liu L, Yu F, Heidari AA, Wang M, Liang G, Muhammad K, Chen H (2020) Chaotic random spare ant colony optimization for multi-threshold image segmentation of 2d kapur entropy Knowledge-Based Systems, pp 106510","DOI":"10.1016\/j.knosys.2020.106510"},{"issue":"3","key":"2312_CR16","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/s00500-014-1279-8","volume":"19","author":"W Yong","year":"2015","unstructured":"Yong W (2015) Hybrid max\u2014min ant system with four vertices and three lines inequality for traveling salesman problem. Soft Comput 19(3):585\u2013596","journal-title":"Soft Comput"},{"key":"2312_CR17","doi-asserted-by":"crossref","unstructured":"Li S, Cai S, Li L, Sun R, Yuan G (2019) Caas: a novel collective action-based ant system algorithm for solving tsp problem. Soft Comput (6)","DOI":"10.1007\/s00500-019-04452-y"},{"key":"2312_CR18","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1016\/j.asoc.2015.01.068","volume":"30","author":"M Mahi","year":"2015","unstructured":"Mahi M, Baykan OK, Kodaz H (2015) A new hybrid method based on particle swarm optimization, ant colony optimization and 3-opt algorithms for traveling salesman problem. Appl Soft Comput 30:484\u2013490","journal-title":"Appl Soft Comput"},{"issue":"AUG.","key":"2312_CR19","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.engappai.2019.04.015","volume":"83","author":"HE Tseng","year":"2019","unstructured":"Tseng HE, Chang CC, Lee SC, Yu MH (2019) Hybrid bidirectional ant colony optimization (hybrid baco):an algorithm for disassembly sequence planning. Eng Appl Artif Intell 83(AUG.):45\u201356","journal-title":"Eng Appl Artif Intell"},{"key":"2312_CR20","doi-asserted-by":"crossref","unstructured":"Yang H (2014) Study on traveling salesman problem based on the improved chaos ant colony algorithm. Adv Mater Res:2196\u20132199","DOI":"10.4028\/www.scientific.net\/AMR.989-994.2196"},{"key":"2312_CR21","doi-asserted-by":"publisher","first-page":"61628","DOI":"10.1109\/ACCESS.2019.2915673","volume":"7","author":"H Zhu","year":"2019","unstructured":"Zhu H, You X, Liu S (2019) Multiple ant colony optimization based on pearson correlation coefficient. IEEE Access 7:61628\u201361638","journal-title":"IEEE Access"},{"key":"2312_CR22","doi-asserted-by":"publisher","first-page":"20281","DOI":"10.1109\/ACCESS.2019.2897580","volume":"7","author":"J Xu","year":"2019","unstructured":"Wu D, 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":"2312_CR23","doi-asserted-by":"crossref","unstructured":"Li J, Xia Y, Li B, Zeng Z (2018) A pseudo-dynamic search ant colony optimization algorithm with improved negative feedback mechanism to solve tsp. Lect Notes Comput Sci:19\u201324","DOI":"10.1007\/978-3-319-95957-3_3"},{"key":"2312_CR24","doi-asserted-by":"crossref","unstructured":"Yang K, You X, Liu S, Pan H (2020) A novel ant colony optimization based on game for traveling salesman problem Applied Intelligence (1)","DOI":"10.1007\/s10489-020-01799-w"},{"issue":"5","key":"2312_CR25","doi-asserted-by":"publisher","first-page":"1669","DOI":"10.1007\/s00500-016-2432-3","volume":"22","author":"Sx Gulcu","year":"2018","unstructured":"Gulcu Sx, Mahi M, Baykan OmK, Kodaz H (2018) A parallel cooperative hybrid method based on ant colony optimization and 3-opt algorithm for solving traveling salesman problem. Soft Comput 22 (5):1669\u20131685","journal-title":"Soft Comput"},{"key":"2312_CR26","doi-asserted-by":"crossref","unstructured":"Pan S (2010) Jialin A survey on transfer learning. IEEE Transactions on Knowledge & Data Engineering","DOI":"10.1109\/TKDE.2009.191"},{"key":"2312_CR27","doi-asserted-by":"crossref","unstructured":"Gao S, Zhou M, Wang Y, Cheng J, Hanaki Y (2019) Dendritic neuron model with effective learning algorithms for classification, approximation, and prediction. IEEE Transactions on Neural Networks and Learning Systems","DOI":"10.1109\/TNNLS.2018.2846646"},{"key":"2312_CR28","unstructured":"Bi-heuristic ant colony optimization-based approaches for traveling salesman problem (2020). Soft Computing, pp 1\u201320"},{"key":"2312_CR29","doi-asserted-by":"publisher","first-page":"38921","DOI":"10.1109\/ACCESS.2018.2853129","volume":"6","author":"E Liao","year":"2018","unstructured":"Liao E, Liu C (2018) A hierarchical algorithm based on density peaks clustering and ant colony optimization for traveling salesman problem. IEEE Access 6:38921\u201338933","journal-title":"IEEE Access"},{"key":"2312_CR30","unstructured":"Mp-testdata the tsplib symmetric traveling salesman problem http:\/\/elib.zib.de\/pub\/mp-testdata\/tsp\/tsplib\/tsp\/"},{"key":"2312_CR31","doi-asserted-by":"crossref","unstructured":"Wu C, Fu X (2020) An agglomerative greedy brain storm optimization algorithm for solving the tsp. IEEE Access 8:201606\u2013201621","DOI":"10.1109\/ACCESS.2020.3035899"},{"key":"2312_CR32","doi-asserted-by":"crossref","unstructured":"Akhand MAH, Islam Ayon S, Shahriyar SA, Siddique NB, Adeli HC Discrete spider monkey optimization for travelling salesman problem. Appl Soft Comput:86","DOI":"10.1016\/j.asoc.2019.105887"},{"key":"2312_CR33","doi-asserted-by":"crossref","unstructured":"Zhang H, You X (2019) Multi-population ant colony optimization algorithm based on congestion factor and co-evolution mechanism. IEEE Access 7:158160\u2013158169","DOI":"10.1109\/ACCESS.2019.2950214"},{"key":"2312_CR34","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/j.asoc.2018.06.047","volume":"71","author":"E Osaba","year":"2018","unstructured":"Osaba E, Ser JD, Sadollah A, Bilbao MN, Camacho D (2018) A discrete water cycle algorithm for solving the symmetric and asymmetric traveling salesman problem. Appl Soft Comput 71:277\u2013290","journal-title":"Appl Soft Comput"},{"key":"2312_CR35","doi-asserted-by":"crossref","unstructured":"Kang Y, You X (2020) A novel ant colony optimization based on game for traveling salesman problem. Appl Intell:7","DOI":"10.1007\/s10489-020-01799-w"},{"key":"2312_CR36","doi-asserted-by":"publisher","first-page":"103649","DOI":"10.1016\/j.engappai.2020.103649","volume":"92","author":"S Ebadinezhad","year":"2020","unstructured":"Ebadinezhad S (2020) Deaco: Adopting dynamic evaporation strategy to enhance aco algorithm for the traveling salesman problem. Eng Appl Artif Intell 92:103649","journal-title":"Eng Appl Artif Intell"},{"key":"2312_CR37","doi-asserted-by":"crossref","unstructured":"Yu J, You X, Liu S (2020) Dynamic density clustering ant colony algorithm with filtering recommendation backtracking mechanism. IEEE Access PP(99):1\u20131","DOI":"10.1109\/ACCESS.2020.3002817"},{"key":"2312_CR38","doi-asserted-by":"crossref","unstructured":"Khan I, Maiti MK (2018) A swap sequence based artificial bee colony algorithm for traveling salesman problem. Swarm Evol Comput:S2210650216304588","DOI":"10.1016\/j.swevo.2018.05.006"},{"key":"2312_CR39","doi-asserted-by":"crossref","unstructured":"Zhong Y, Lin J, Wang L, Zhang H (2017) Hybrid discrete artificial bee colony algorithm with threshold acceptance criterion for traveling salesman problem. Information Sciences","DOI":"10.1016\/j.ins.2017.08.067"},{"key":"2312_CR40","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1016\/j.asoc.2016.08.036","volume":"49","author":"L Yu","year":"2016","unstructured":"Yu L, Bian Z, Liu X (2016) Developing a dynamic neighborhood structure for an adaptive hybrid simulated annealing-tabu search algorithm to solve the symmetrical traveling salesman problem. Appl Soft Comput 49:937\u2013952","journal-title":"Appl Soft Comput"},{"key":"2312_CR41","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.engappai.2015.10.006","volume":"48","author":"E Osaba","year":"2016","unstructured":"Osaba E, Yang X, Diaz F, Lopezgarcia P, Carballedo R (2016) An improved discrete bat algorithm for symmetric and asymmetric traveling salesman problems. Eng Appl Artif Intell 48:59\u2013 71","journal-title":"Eng Appl Artif Intell"},{"issue":"2","key":"2312_CR42","doi-asserted-by":"publisher","first-page":"107","DOI":"10.3233\/MGS-150232","volume":"11","author":"MM Alipour","year":"2015","unstructured":"Alipour MM, Razavi SN (2015) A new multiagent reinforcement learning algorithm to solve the symmetric traveling salesman problem. Multiagent Grid Syst 11(2):107\u2013119","journal-title":"Multiagent Grid Syst"},{"issue":"70","key":"2312_CR43","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.cie.2014.01.015","volume":"70","author":"Y Wang","year":"2014","unstructured":"Wang Y (2014) The hybrid genetic algorithm with two local optimization strategies for traveling salesman problem. Comput Ind Eng 70(70):124\u2013133","journal-title":"Comput Ind Eng"},{"issue":"7","key":"2312_CR44","doi-asserted-by":"publisher","first-page":"887","DOI":"10.1016\/j.pnsc.2008.01.030","volume":"18","author":"J Yang","year":"2008","unstructured":"Yang J, Wu C, Lee HP, Liang Y (2008) Solving traveling salesman problems using generalized chromosome genetic algorithm. Prog Nat Sci 18(7):887\u2013892","journal-title":"Prog Nat Sci"},{"issue":"4","key":"2312_CR45","doi-asserted-by":"publisher","first-page":"3680","DOI":"10.1016\/j.asoc.2011.01.039","volume":"11","author":"X Geng","year":"2011","unstructured":"Geng X, Chen Z, Yang W, Shi D, Zhao K (2011) Solving the traveling salesman problem based on an adaptive simulated annealing algorithm with greedy search. Appl Soft Comput 11(4):3680\u20133689","journal-title":"Appl Soft Comput"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-02312-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-021-02312-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-02312-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,9]],"date-time":"2021-11-09T05:06:08Z","timestamp":1636434368000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-021-02312-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,12]]},"references-count":45,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["2312"],"URL":"https:\/\/doi.org\/10.1007\/s10489-021-02312-7","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4,12]]},"assertion":[{"value":"3 March 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 April 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have declared no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Competing interests"}}]}}