{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T18:51:12Z","timestamp":1774291872580,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Evol. Intel."],"published-print":{"date-parts":[[2026,2]]},"DOI":"10.1007\/s12065-026-01143-0","type":"journal-article","created":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T05:26:19Z","timestamp":1770009979000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Comparative analysis of enhanced metaheuristics for the colored traveling salesman problem"],"prefix":"10.1007","volume":"19","author":[{"given":"Karuna","family":"Panwar","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,2,2]]},"reference":[{"issue":"3","key":"1143_CR1","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.omega.2004.10.004","volume":"34","author":"T Bektas","year":"2006","unstructured":"Bektas T (2006) The multiple traveling salesman problem: an overview of formulations and solution procedures. Omega 34(3):209\u2013219","journal-title":"Omega"},{"issue":"4","key":"1143_CR2","first-page":"598","volume":"3","author":"A Singh","year":"2016","unstructured":"Singh A (2016) A review on algorithms used to solve multiple travelling salesman problem. Int Res J Eng Technol (IRJET) 3(4):598\u2013603","journal-title":"Int Res J Eng Technol (IRJET)"},{"issue":"2","key":"1143_CR3","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/S0925-5273(00)00174-2","volume":"73","author":"Y-B Park","year":"2001","unstructured":"Park Y-B (2001) A hybrid genetic algorithm for the vehicle scheduling problem with due times and time deadlines. Int J Prod Econ 73(2):175\u2013188","journal-title":"Int J Prod Econ"},{"issue":"6","key":"1143_CR4","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1016\/S0305-0483(02)00059-2","volume":"30","author":"AE Carter","year":"2002","unstructured":"Carter AE, Ragsdale CT (2002) Scheduling pre-printed newspaper advertising inserts using genetic algorithms. Omega 30(6):415\u2013421","journal-title":"Omega"},{"issue":"11","key":"1143_CR5","doi-asserted-by":"publisher","first-page":"2390","DOI":"10.1109\/TCYB.2014.2371918","volume":"45","author":"J Li","year":"2014","unstructured":"Li J, Zhou M, Sun Q, Dai X, Yu X (2014) Colored traveling salesman problem. IEEE Trans Cybern 45(11):2390\u20132401","journal-title":"IEEE Trans Cybern"},{"issue":"2","key":"1143_CR6","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1109\/TSMC.2016.2591267","volume":"48","author":"X Meng","year":"2016","unstructured":"Meng X, Li J, Zhou M, Dai X, Dou J (2016) Population-based incremental learning algorithm for a serial colored traveling salesman problem. IEEE Trans Syst Man Cybern Syst 48(2):277\u2013288","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"key":"1143_CR7","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1016\/j.future.2018.12.065","volume":"95","author":"X Dong","year":"2019","unstructured":"Dong X, Cai Y (2019) A novel genetic algorithm for large scale colored balanced traveling salesman problem. Futurr Gener Comput Syst 95:727\u2013742","journal-title":"Futurr Gener Comput Syst"},{"issue":"8","key":"1143_CR8","doi-asserted-by":"publisher","first-page":"13549","DOI":"10.1109\/TITS.2021.3125721","volume":"23","author":"X Meng","year":"2021","unstructured":"Meng X, Li J, Zhou M, Dai X (2021) A dynamic colored traveling salesman problem with varying edge weights. IEEE Trans Intell Transp Syst 23(8):13549\u201313558","journal-title":"IEEE Trans Intell Transp Syst"},{"issue":"7","key":"1143_CR9","doi-asserted-by":"publisher","first-page":"6326","DOI":"10.1109\/TITS.2021.3086625","volume":"23","author":"X Xu","year":"2021","unstructured":"Xu X, Li J, Zhou M (2021) Bi-objective colored traveling salesman problems. IEEE Trans Intell Transp Syst 23(7):6326\u20136336","journal-title":"IEEE Trans Intell Transp Syst"},{"issue":"9","key":"1143_CR10","doi-asserted-by":"publisher","first-page":"9797","DOI":"10.1109\/TCYB.2021.3070143","volume":"52","author":"X Xu","year":"2021","unstructured":"Xu X, Li J, Zhou M, Yu X (2021) Precedence-constrained colored traveling salesman problem: An augmented variable neighborhood search approach. IEEE Trans Cybern 52(9):9797\u20139808","journal-title":"IEEE Trans Cybern"},{"issue":"6","key":"1143_CR11","doi-asserted-by":"publisher","first-page":"2172","DOI":"10.1093\/comjnl\/bxad131","volume":"67","author":"X Dong","year":"2024","unstructured":"Dong X, Lin Q, Wang W (2024) Hybrid it\u00f6 algorithm for maximum scatter colored traveling salesman problem. Comput J 67(6):2172\u20132188","journal-title":"Comput J"},{"key":"1143_CR12","doi-asserted-by":"crossref","unstructured":"Xu X, Shi X, Cao J, Huang W (2024) Capacitated colored traveling salesman problem with time windows, IEEE Trans Autom Sci Eng 22: 8057-8068","DOI":"10.1109\/TASE.2024.3476696"},{"issue":"8","key":"1143_CR13","doi-asserted-by":"publisher","first-page":"4553","DOI":"10.1109\/TCYB.2023.3337248","volume":"54","author":"X Xu","year":"2023","unstructured":"Xu X, Cao J, Shi X, Gorbachev S (2023) Cumulative capacitated colored traveling salesman problem. IEEE Trans Cybern 54(8):4553\u20134566","journal-title":"IEEE Trans Cybern"},{"key":"1143_CR14","doi-asserted-by":"crossref","unstructured":"Nourmohammadzadeh A, Vo\u00df S (2025) A matheuristic approach for the robust coloured travelling salesman problem with multiple depots. Eur J Oper Res","DOI":"10.1016\/j.ejor.2025.06.018"},{"issue":"7","key":"1143_CR15","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1109\/TSMC.2016.2531648","volume":"47","author":"J Li","year":"2016","unstructured":"Li J, Meng X, Zhou M, Dai X (2016) A two-stage approach to path planning and collision avoidance of multibridge machining systems. IEEE Trans Syst Man Cybern Syst 47(7):1039\u20131049","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"issue":"1","key":"1143_CR16","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1109\/JAS.2017.7510415","volume":"5","author":"J Li","year":"2017","unstructured":"Li J, Meng X, Dai X (2017) Collision-free scheduling of multi-bridge machining systems: a colored traveling salesman problem-based approach. IEEE\/CAA J Autom Sin 5(1):139\u2013147","journal-title":"IEEE\/CAA J Autom Sin"},{"key":"1143_CR17","doi-asserted-by":"crossref","unstructured":"Wen W, Liu H, Ni Y, Xu Q, Huang Y, Wei Y, Xiang Z, Wu J (2023) A task scheduling method for multi-robot collaboration, in: IFToMM World Congress on Mechanism and Machine Science, Springer, 321\u2013332","DOI":"10.1007\/978-3-031-45705-0_32"},{"issue":"9","key":"1143_CR18","doi-asserted-by":"publisher","first-page":"16072","DOI":"10.1109\/TITS.2022.3147924","volume":"23","author":"Y Zhou","year":"2022","unstructured":"Zhou Y, Xu W, Fu Z-H, Zhou M (2022) Multi-neighborhood simulated annealing-based iterated local search for colored traveling salesman problems. IEEE Trans Intell Transp Syst 23(9):16072\u201316082","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"1143_CR19","doi-asserted-by":"crossref","unstructured":"Baghel M, Agrawal S, Silakari S (2012) Survey of metaheuristic algorithms for combinatorial optimization. Int J Comput Appl 58(19): 21-31","DOI":"10.5120\/9391-3813"},{"key":"1143_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2023.110908","volume":"148","author":"B Toaza","year":"2023","unstructured":"Toaza B, Eszterg\u00e1r-Kiss D (2023) A review of metaheuristic algorithms for solving tsp-based scheduling optimization problems. Appl Soft Comput 148:110908","journal-title":"Appl Soft Comput"},{"issue":"3","key":"1143_CR21","first-page":"1","volume":"9","author":"MN Mageswari","year":"2024","unstructured":"Mageswari MN (2024) Vehicle routing problem (vrp) using genetic algorithm. Science 9(3):1\u20133","journal-title":"Science"},{"issue":"4","key":"1143_CR22","doi-asserted-by":"publisher","first-page":"214","DOI":"10.56578\/ataiml030403","volume":"3","author":"B Abdulghani","year":"2024","unstructured":"Abdulghani B, Abdulghani M (2024) A comprehensive review of ant colony optimization in swarm intelligence for complex problem solving. Acadlore Trans Mach Learn 3(4):214\u2013224","journal-title":"Acadlore Trans Mach Learn"},{"issue":"8","key":"1143_CR23","doi-asserted-by":"publisher","first-page":"774","DOI":"10.1049\/iet-its.2016.0282","volume":"12","author":"X Dong","year":"2018","unstructured":"Dong X, Dong W, Cai Y (2018) Ant colony optimisation for coloured travelling salesman problem by multi-task learning. IET Intel Transport Syst 12(8):774\u2013782","journal-title":"IET Intel Transport Syst"},{"key":"1143_CR24","doi-asserted-by":"publisher","first-page":"4412","DOI":"10.1007\/s10489-018-1216-0","volume":"48","author":"V Pandiri","year":"2018","unstructured":"Pandiri V, Singh A (2018) A swarm intelligence approach for the colored traveling salesman problem. Appl Intell 48:4412\u20134428","journal-title":"Appl Intell"},{"issue":"4","key":"1143_CR25","doi-asserted-by":"publisher","first-page":"1018","DOI":"10.1109\/TITS.2017.2706720","volume":"19","author":"X Meng","year":"2017","unstructured":"Meng X, Li J, Dai X, Dou J (2017) Variable neighborhood search for a colored traveling salesman problem. IEEE Trans Intell Transp Syst 19(4):1018\u20131026","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"1143_CR26","doi-asserted-by":"crossref","unstructured":"Li J, Dai X, Liu H, Zhou M, A decomposition approach to colored traveling salesman problems. In: (2015) IEEE International Conference on automation science and engineering (CASE). IEEE 2015:51\u201356","DOI":"10.1109\/CoASE.2015.7294040"},{"issue":"19","key":"1143_CR27","doi-asserted-by":"publisher","first-page":"27340","DOI":"10.1007\/s11227-024-06433-x","volume":"80","author":"Z Lin","year":"2024","unstructured":"Lin Z, Li J, Li Y (2024) A cloud computing approach to superscale colored traveling salesman problems. J Supercomput 80(19):27340\u201327369","journal-title":"J Supercomput"},{"key":"1143_CR28","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1016\/j.ins.2021.04.090","volume":"570","author":"P He","year":"2021","unstructured":"He P, Hao J-K, Wu Q (2021) Grouping memetic search for the colored traveling salesmen problem. Inf Sci 570:689\u2013707","journal-title":"Inf Sci"},{"key":"1143_CR29","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2020.104018","volume":"97","author":"P He","year":"2021","unstructured":"He P, Hao J-K (2021) Iterated two-phase local search for the colored traveling salesmen problem. Eng Appl Artif Intell 97:104018","journal-title":"Eng Appl Artif Intell"},{"issue":"1","key":"1143_CR30","doi-asserted-by":"publisher","first-page":"895","DOI":"10.1109\/TASE.2023.3236317","volume":"21","author":"Y Zhou","year":"2023","unstructured":"Zhou Y, Xu W, Zhou M, Fu Z-H (2023) Bi-trajectory hybrid search to solve bottleneck-minimized colored traveling salesman problems. IEEE Trans Autom Sci Eng 21(1):895\u2013905","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"1143_CR31","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2023.101406","volume":"83","author":"X Dong","year":"2023","unstructured":"Dong X, Lin Q, Shen F, Guo Q, Li Q (2023) A novel hybrid simulated annealing algorithm for colored bottleneck traveling salesman problem. Swarm Evol Comput 83:101406","journal-title":"Swarm Evol Comput"},{"issue":"8","key":"1143_CR32","doi-asserted-by":"publisher","first-page":"6125","DOI":"10.1007\/s10489-024-05473-3","volume":"54","author":"S Majumder","year":"2024","unstructured":"Majumder S, Singh A (2024) An evolution strategy with tailor-made mutation operator for colored balanced traveling salesman problem. Appl Intell 54(8):6125\u20136137","journal-title":"Appl Intell"},{"key":"1143_CR33","first-page":"237","volume":"2019","author":"B Miloradovic","year":"2019","unstructured":"Miloradovic B, C\u00fcr\u00fckl\u00fc B, Ekstr\u00f6m M, Papadopoulos AV (2019) Extended colored traveling salesperson for modeling multi-agent mission planning problems. ICORES 2019:237\u2013244","journal-title":"ICORES"},{"key":"1143_CR34","doi-asserted-by":"crossref","unstructured":"Zhu T, Shi X, Xu X, Cao J (2024) Reinforcement learning for solving colored traveling salesman problems: an entropy-insensitive attention approach. IEEE Trans Artif Intell 5(12), 6699-6708","DOI":"10.1109\/TAI.2024.3461630"},{"issue":"1","key":"1143_CR35","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s40747-024-01716-5","volume":"11","author":"J Luo","year":"2025","unstructured":"Luo J, Heng H, Wu G (2025) Graph attention, learning 2-opt algorithm for the traveling salesman problem. Complex Intell Syst 11(1):117","journal-title":"Complex Intell Syst"},{"key":"1143_CR36","doi-asserted-by":"crossref","unstructured":"Manthey B, van Rhijn J (2025) Improved smoothed analysis of 2-opt for the euclidean tsp. Algorithmica 87, 1008-1039","DOI":"10.1007\/s00453-025-01309-9"}],"container-title":["Evolutionary Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-026-01143-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12065-026-01143-0","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-026-01143-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:08:59Z","timestamp":1773655739000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12065-026-01143-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,2]]}},"alternative-id":["1143"],"URL":"https:\/\/doi.org\/10.1007\/s12065-026-01143-0","relation":{},"ISSN":["1864-5909","1864-5917"],"issn-type":[{"value":"1864-5909","type":"print"},{"value":"1864-5917","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2]]},"assertion":[{"value":"22 September 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 November 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 January 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 February 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"There is no ethical conflict.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}],"article-number":"30"}}