{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,20]],"date-time":"2026-08-20T14:51:18Z","timestamp":1787237478056,"version":"build-2736575974"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2025,8,19]],"date-time":"2025-08-19T00:00:00Z","timestamp":1755561600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,8,19]],"date-time":"2025-08-19T00:00:00Z","timestamp":1755561600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2021YFF0500904"],"award-info":[{"award-number":["2021YFF0500904"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. King Saud Univ. Comput. Inf. Sci."],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s44443-025-00127-x","type":"journal-article","created":{"date-parts":[[2025,8,19]],"date-time":"2025-08-19T10:22:27Z","timestamp":1755598947000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A hybrid genetic algorithm with cycle reassembly for solving colored traveling salesman problems"],"prefix":"10.1007","volume":"37","author":[{"given":"Zhicheng","family":"Lin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jun","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,8,19]]},"reference":[{"key":"127_CR1","doi-asserted-by":"publisher","unstructured":"Li J, Zhou M, Sun Q, et\u00a0al (2014) Colored traveling salesman problem. IEEE Trans Cybern 45(11):2390\u20132401. https:\/\/doi.org\/10.1109\/TCYB.2014.2371918","DOI":"10.1109\/TCYB.2014.2371918"},{"key":"127_CR2","doi-asserted-by":"publisher","unstructured":"Li J, Meng X, Dai X (2018) Collision-free scheduling of multi-bridge machining systems: A colored traveling salesman problem-based approach. IEEE\/CAA J Autom Sin 5(1):139\u2013147. https:\/\/doi.org\/10.1109\/JAS.2017.7510415","DOI":"10.1109\/JAS.2017.7510415"},{"key":"127_CR3","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.cor.2019.01.002","volume":"105","author":"F Arnold","year":"2019","unstructured":"Arnold F, S\u00f6rensen K (2019) Knowledge-guided local search for the vehicle routing problem. Comput Oper Res 105:32\u201346. https:\/\/doi.org\/10.1016\/j.cor.2019.01.002","journal-title":"Comput Oper Res"},{"issue":"10","key":"127_CR4","doi-asserted-by":"publisher","first-page":"1483","DOI":"10.1049\/iet-its.2018.5359","volume":"13","author":"X Dong","year":"2019","unstructured":"Dong X, Lin Q, Xu M et al (2019) Artificial bee colony algorithm with generating neighbourhood solution for large scale coloured traveling salesman problem. IET Intell Transp Syst 13(10):1483\u20131491. https:\/\/doi.org\/10.1049\/iet-its.2018.5359","journal-title":"IET Intell Transp Syst"},{"issue":"2","key":"127_CR5","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1016\/j.ejor.2016.04.065","volume":"255","author":"V Fran\u00e7ois","year":"2016","unstructured":"Fran\u00e7ois V, Arda Y, Crama Y et al (2016) Large neighborhood search for multi-trip vehicle routing. Eur J Oper Res 255(2):422\u2013441. https:\/\/doi.org\/10.1016\/j.ejor.2016.04.065","journal-title":"Eur J Oper Res"},{"key":"127_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.jii.2021.100287","volume":"27","author":"E Guzman","year":"2022","unstructured":"Guzman E, Andres B, Poler R (2022) Models and algorithms for production planning, scheduling and sequencing problems: A holistic framework and a systematic review. J Ind Inf Integr 27:100287. https:\/\/doi.org\/10.1016\/j.jii.2021.100287","journal-title":"J Ind Inf Integr"},{"key":"127_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2020.104018","volume":"97","author":"P He","year":"2021","unstructured":"He P, Hao JK (2021) Iterated two-phase local search for the colored traveling salesmen problem. Eng Appl Artif Intell 97:104018. https:\/\/doi.org\/10.1016\/j.engappai.2020.104018","journal-title":"Eng Appl Artif Intell"},{"key":"127_CR8","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 JK, Wu Q (2021) Grouping memetic search for the colored traveling salesmen problem. Inf Sci 570:689\u2013707. https:\/\/doi.org\/10.1016\/j.ins.2021.04.090","journal-title":"Inf Sci"},{"key":"127_CR9","doi-asserted-by":"publisher","unstructured":"Scott D, Manyam SG, Casbeer DW, et\u00a0al (2022) A lagrangian algorithm for multiple depot traveling salesman problem with revisit period constraints. IEEE T AUTOM SCI ENG 20(1):690\u2013702. https:\/\/doi.org\/10.1109\/TASE.2022.3181512","DOI":"10.1109\/TASE.2022.3181512"},{"key":"127_CR10","unstructured":"Hu P (2022) Travel the same path: A novel tsp solving strategy. arXiv preprint arXiv:2210.05906"},{"issue":"10","key":"127_CR11","doi-asserted-by":"publisher","first-page":"10855","DOI":"10.1109\/TCYB.2021.3069942","volume":"52","author":"YH Jia","year":"2021","unstructured":"Jia YH, Mei Y, Zhang M (2021) A bilevel ant colony optimization algorithm for capacitated electric vehicle routing problem. IEEE Trans Cybern 52(10):10855\u201310868. https:\/\/doi.org\/10.1109\/TCYB.2021.3069942","journal-title":"IEEE Trans Cybern"},{"issue":"11","key":"127_CR12","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 et al (2014) Colored traveling salesman problem. IEEE Trans Cybern 45(11):2390\u20132401. https:\/\/doi.org\/10.1109\/TCYB.2014.2371918","journal-title":"IEEE Trans Cybern"},{"issue":"1","key":"127_CR13","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1109\/JAS.2017.7510415","volume":"5","author":"J Li","year":"2018","unstructured":"Li J, Meng X, Dai X (2018) Collision-free scheduling of multi-bridge machining systems: A colored traveling salesman problem-based approach. IEEE\/CAA J Autom Sin 5(1):139\u2013147. https:\/\/doi.org\/10.1109\/JAS.2017.7510415","journal-title":"IEEE\/CAA J Autom Sin"},{"issue":"19","key":"127_CR14","doi-asserted-by":"publisher","first-page":"27340","DOI":"10.1109\/TCYB.2014.2371918","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. The Journal of Supercomputing 80(19):27340\u201327369. https:\/\/doi.org\/10.1109\/TCYB.2014.2371918","journal-title":"The Journal of Supercomputing"},{"key":"127_CR15","unstructured":"Nagata Y, Kobayashi S (1997) Edge assembly crossover: A high-power genetic algorithm for the travelling salesman problem. In: International Conference on Genetic Algorithms, https:\/\/api.semanticscholar.org\/CorpusID:40076436"},{"key":"127_CR16","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.engappai.2019.01.014","volume":"80","author":"Y Lu","year":"2019","unstructured":"Lu Y, Benlic U, Wu Q et al (2019) Memetic algorithm for the multiple traveling repairman problem with profits. Eng Appl Artif Intell 80:35\u201347. https:\/\/doi.org\/10.1016\/j.engappai.2019.01.014","journal-title":"Eng Appl Artif Intell"},{"key":"127_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2023.106455","volume":"162","author":"S Mahmoudinazlou","year":"2024","unstructured":"Mahmoudinazlou S, Kwon C (2024) A hybrid genetic algorithm for the min-max multiple traveling salesman problem. Comput Oper Res 162:106455. https:\/\/doi.org\/10.1016\/j.cor.2023.106455","journal-title":"Comput Oper Res"},{"issue":"2","key":"127_CR18","doi-asserted-by":"publisher","first-page":"1446","DOI":"10.1016\/j.eswa.2009.06.085","volume":"37","author":"Y Marinakis","year":"2010","unstructured":"Marinakis Y, Marinaki M (2010) A hybrid genetic-particle swarm optimization algorithm for the vehicle routing problem. Expert Syst Appl 37(2):1446\u20131455. https:\/\/doi.org\/10.1016\/j.eswa.2009.06.085","journal-title":"Expert Syst Appl"},{"issue":"2","key":"127_CR19","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1109\/TSMC.2016.2591267","volume":"48","author":"X Meng","year":"2018","unstructured":"Meng X, Li J, Zhou M et al (2018) Population-based incremental learning algorithm for a serial colored traveling salesman problem. IEEE Trans Syst Man Cybern Syst 48(2):277\u2013288. https:\/\/doi.org\/10.1109\/TSMC.2016.2591267","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"issue":"4","key":"127_CR20","doi-asserted-by":"publisher","first-page":"1018","DOI":"10.1109\/TITS.2017.2706720","volume":"19","author":"X Meng","year":"2018","unstructured":"Meng X, Li J, Dai X et al (2018) Variable neighborhood search for a colored traveling salesman problem. IEEE Trans Intell Transp Syst 19(4):1018\u20131026. https:\/\/doi.org\/10.1109\/TITS.2017.2706720","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"127_CR21","doi-asserted-by":"publisher","unstructured":"He P, Hao JK (2021) Iterated two-phase local search for the colored traveling salesmen problem. Eng Appl Artif Intell 97:104018. https:\/\/doi.org\/10.1016\/j.engappai.2020.104018","DOI":"10.1016\/j.engappai.2020.104018"},{"issue":"2","key":"127_CR22","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1287\/ijoc.1120.0506","volume":"25","author":"Y Nagata","year":"2013","unstructured":"Nagata Y, Kobayashi S (2013) A powerful genetic algorithm using edge assembly crossover for the traveling salesman problem. INFORMS J Comput 25(2):346\u2013363. https:\/\/doi.org\/10.1287\/ijoc.1120.0506","journal-title":"INFORMS J Comput"},{"key":"127_CR23","doi-asserted-by":"publisher","unstructured":"Lu Y, Benlic U, Wu Q, et\u00a0al (2019) Memetic algorithm for the multiple traveling repairman problem with profits. Eng Appl Artif Intell 80:35\u201347. https:\/\/doi.org\/10.1016\/j.engappai.2019.01.014","DOI":"10.1016\/j.engappai.2019.01.014"},{"key":"127_CR24","doi-asserted-by":"publisher","unstructured":"Zheng J, Zhong J, Chen M, et\u00a0al (2023) A reinforced hybrid genetic algorithm for the traveling salesman problem. Comput Oper Res 157:106249. https:\/\/doi.org\/10.1016\/j.cor.2023.106249","DOI":"10.1016\/j.cor.2023.106249"},{"key":"127_CR25","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. https:\/\/doi.org\/10.1007\/s10489-018-1216-0","journal-title":"Appl Intell"},{"issue":"12","key":"127_CR26","doi-asserted-by":"publisher","first-page":"1433","DOI":"10.1057\/jors.1995.204","volume":"46","author":"JY Potvin","year":"1995","unstructured":"Potvin JY, Rousseau JM (1995) An exchange heuristic for routeing problems with time windows. J Oper Res Soc 46(12):1433\u20131446. https:\/\/doi.org\/10.1057\/jors.1995.204","journal-title":"J Oper Res Soc"},{"issue":"4","key":"127_CR27","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt G (1991) Tsplib\u2014a traveling salesman problem library. ORSA J Comput 3(4):376\u2013384. https:\/\/doi.org\/10.1287\/ijoc.3.4.376","journal-title":"ORSA J Comput"},{"issue":"1","key":"127_CR28","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1109\/TASE.2022.3181512","volume":"20","author":"D Scott","year":"2022","unstructured":"Scott D, Manyam SG, Casbeer DW et al (2022) A lagrangian algorithm for multiple depot traveling salesman problem with revisit period constraints. IEEE T AUTOM SCI ENG 20(1):690\u2013702. https:\/\/doi.org\/10.1109\/TASE.2022.3181512","journal-title":"IEEE T AUTOM SCI ENG"},{"issue":"2","key":"127_CR29","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/s00362-012-0443-4","volume":"54","author":"SM Taheri","year":"2013","unstructured":"Taheri SM, Hesamian G (2013) A generalization of the wilcoxon signed-rank test and its applications. Statistical Papers 54(2):457\u2013470. https:\/\/doi.org\/10.1007\/s00362-012-0443-4","journal-title":"Statistical Papers"},{"issue":"2","key":"127_CR30","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1016\/j.ejor.2018.06.039","volume":"272","author":"\u00c9D Taillard","year":"2019","unstructured":"Taillard \u00c9D, Helsgaun K (2019) Popmusic for the travelling salesman problem. Eur J Oper Res 272(2):420\u2013429. https:\/\/doi.org\/10.1016\/j.ejor.2018.06.039","journal-title":"Eur J Oper Res"},{"issue":"1","key":"127_CR31","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"D Wolpert","year":"1997","unstructured":"Wolpert D, Macready W (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1(1):67\u201382. https:\/\/doi.org\/10.1109\/4235.585893","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"127_CR32","doi-asserted-by":"publisher","first-page":"1583","DOI":"10.1109\/TITS.2020.2972389","volume":"22","author":"X Xu","year":"2021","unstructured":"Xu X, Li J, Zhou M (2021) Delaunay-triangulation-based variable neighborhood search to solve large-scale general colored traveling salesman problems. IEEE Trans Intell Transp Syst 22(3):1583\u20131593. https:\/\/doi.org\/10.1109\/TITS.2020.2972389","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"127_CR33","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2020.101866","volume":"135","author":"L Zhen","year":"2020","unstructured":"Zhen L, Ma C, Wang K et al (2020) Multi-depot multi-trip vehicle routing problem with time windows and release dates. Transp Res E 135:101866. https:\/\/doi.org\/10.1016\/j.tre.2020.101866","journal-title":"Transp Res E"},{"key":"127_CR34","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2023.106249","volume":"157","author":"J Zheng","year":"2023","unstructured":"Zheng J, Zhong J, Chen M et al (2023) A reinforced hybrid genetic algorithm for the traveling salesman problem. Comput Oper Res 157:106249. https:\/\/doi.org\/10.1016\/j.cor.2023.106249","journal-title":"Comput Oper Res"},{"issue":"9","key":"127_CR35","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 ZH et al (2022) Multi-neighborhood simulated annealing-based iterated local search for colored traveling salesman problems. IEEE Trans Intell Transp Syst 23(9):16072\u201316082. https:\/\/doi.org\/10.1109\/TITS.2022.3147924","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"127_CR36","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2024.3361910","author":"Y Zou","year":"2024","unstructured":"Zou Y, Hao JK, Wu Q (2024) A two-individual evolutionary algorithm for cumulative capacitated vehicle routing with single and multiple depots. IEEE Trans Evol Comput Early Access. https:\/\/doi.org\/10.1109\/TEVC.2024.3361910","journal-title":"IEEE Trans Evol Comput Early Access"},{"issue":"6","key":"127_CR37","doi-asserted-by":"publisher","first-page":"1049","DOI":"10.1287\/opre.43.6.1049","volume":"43","author":"Geoffrey Zweig","year":"1995","unstructured":"Zweig Geoffrey (1995) An effective tour construction and improvement procedure for the traveling salesman problem. Oper Res 43(6):1049\u20131057. https:\/\/doi.org\/10.1287\/opre.43.6.1049","journal-title":"Oper Res"}],"container-title":["Journal of King Saud University Computer and Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44443-025-00127-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s44443-025-00127-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44443-025-00127-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T12:41:46Z","timestamp":1758112906000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s44443-025-00127-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,19]]},"references-count":37,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["127"],"URL":"https:\/\/doi.org\/10.1007\/s44443-025-00127-x","relation":{},"ISSN":["1319-1578","2213-1248"],"issn-type":[{"value":"1319-1578","type":"print"},{"value":"2213-1248","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8,19]]},"assertion":[{"value":"1 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 June 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 August 2025","order":3,"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 that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}],"article-number":"182"}}