{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T14:02:35Z","timestamp":1777903355148,"version":"3.51.4"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T00:00:00Z","timestamp":1763683200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T00:00:00Z","timestamp":1763683200000},"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":["Cluster Comput"],"published-print":{"date-parts":[[2026,2]]},"DOI":"10.1007\/s10586-025-05789-w","type":"journal-article","created":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T15:51:56Z","timestamp":1763740316000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Essential mutation framework for solving travelling salesman problem"],"prefix":"10.1007","volume":"29","author":[{"given":"Iyad","family":"Abu Doush","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ra\u2019ed M.","family":"Al-Khatib","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bader","family":"Alotaibi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Salem","family":"Alhatamleh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,21]]},"reference":[{"key":"5789_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.109339","volume":"127","author":"P Zhang","year":"2022","unstructured":"Zhang, P., Wang, J., Tian, Z., Sun, S., Li, J., Yang, J.: A genetic algorithm with jumping gene and heuristic operators for traveling salesman problem. Applied Soft Computing 127, 109339 (2022). https:\/\/doi.org\/10.1016\/j.asoc.2022.109339","journal-title":"Applied Soft Computing"},{"issue":"6","key":"5789_CR2","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1080\/02564602.2023.2167742","volume":"40","author":"L Goel","year":"2023","unstructured":"Goel, L., Vaishnav, G., Ramola, S.C., Purohit, T.: A modified ant colony optimization algorithm with pheromone mutations for dynamic travelling salesman problem. IETE Technical Review 40(6), 767\u2013782 (2023)","journal-title":"IETE Technical Review"},{"key":"5789_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.rcim.2025.102981","volume":"95","author":"J Li","year":"2025","unstructured":"Li, J., Liu, Q., Wang, C., Li, X.: A disjunctive graph-based metaheuristic for flexible job-shop scheduling problems considering fixture shortages in customized manufacturing systems. Robotics and Computer-Integrated Manufacturing 95, 102981 (2025)","journal-title":"Robotics and Computer-Integrated Manufacturing"},{"key":"5789_CR4","first-page":"221","volume-title":"Foundations of Genetic Algorithms vol. 2","author":"WM Spears","year":"1993","unstructured":"Spears, W.M.: Crossover or mutation? In: Foundations of Genetic Algorithms vol. 2, pp. 221\u2013237. Elsevier (1993)"},{"issue":"3","key":"5789_CR5","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1504\/IJRIS.2019.102541","volume":"11","author":"RM Al-Khatib","year":"2019","unstructured":"Al-Khatib, R.M., Al-Betar, M.A., Awadallah, M.A., Nahar, K.M., Shquier, M.M.A., Manasrah, A.M., Doumi, A.B.: Mga-tsp: modernised genetic algorithm for the travelling salesman problem. International Journal of Reasoning-based Intelligent Systems 11(3), 215\u2013226 (2019)","journal-title":"International Journal of Reasoning-based Intelligent Systems"},{"key":"5789_CR6","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2025.2496971","author":"J Li","year":"2025","unstructured":"Li, J., Liu, Q., Li, X., Gao, L.: An efficient problem-specific evolutionary algorithm for flexible job shop scheduling problem with specific workers in highly customised manufacturing systems. International Journal of Production Research (2025). https:\/\/doi.org\/10.1080\/00207543.2025.2496971","journal-title":"International Journal of Production Research"},{"issue":"1","key":"5789_CR7","doi-asserted-by":"publisher","first-page":"35","DOI":"10.22452\/mjcs.vol33no1.3","volume":"33","author":"IA Doush","year":"2020","unstructured":"Doush, I.A., Sawalha, A.: Automatic music composition using genetic algorithm and artificial neural networks. Malays. J. Comput. Sci. 33(1), 35\u201351 (2020)","journal-title":"Malays. J. Comput. Sci."},{"issue":"6","key":"5789_CR8","doi-asserted-by":"publisher","first-page":"1297","DOI":"10.1080\/0952813X.2017.1354078","volume":"29","author":"I Abu Doush","year":"2017","unstructured":"Abu Doush, I., Al-Saleh, M.I.: Can genetic algorithms help virus writers reshape their creations and avoid detection? Journal of Experimental & Theoretical Artificial Intelligence 29(6), 1297\u20131310 (2017)","journal-title":"Journal of Experimental & Theoretical Artificial Intelligence"},{"issue":"3","key":"5789_CR9","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1145\/937503.937505","volume":"35","author":"C Blum","year":"2003","unstructured":"Blum, C., Roli, A.: Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Computing Surveys 35(3), 268\u2013308 (2003)","journal-title":"ACM Computing Surveys"},{"issue":"4","key":"5789_CR10","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1504\/IJCAT.2020.110417","volume":"63","author":"F Alkhateeb","year":"2020","unstructured":"Alkhateeb, F., Al-Khatib, R.M., Doush, I.A.: A survey for recent applications and variants of nature-inspired immune search algorithm. Int. J. Comput. Appl. Technol. 63(4), 354\u2013370 (2020)","journal-title":"Int. J. Comput. Appl. Technol."},{"issue":"1","key":"5789_CR11","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1038\/scientificamerican0792-66","volume":"267","author":"JH Holland","year":"1992","unstructured":"Holland, J.H.: Genetic algorithms. Scientific american 267(1), 66\u201373 (1992)","journal-title":"Genetic algorithms. Scientific american"},{"key":"5789_CR12","unstructured":"Koza, J.R.: Genetic programming: On the programming of computers. Means of natural selection (1992)"},{"issue":"1","key":"5789_CR13","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1023\/A:1015059928466","volume":"1","author":"H-G Beyer","year":"2002","unstructured":"Beyer, H.-G., Schwefel, H.-P.: Evolution strategies-a comprehensive introduction. Natural computing 1(1), 3\u201352 (2002)","journal-title":"Natural computing"},{"issue":"2","key":"5789_CR14","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1109\/4235.771163","volume":"3","author":"X Yao","year":"1999","unstructured":"Yao, X., Liu, Y., Lin, G.: Evolutionary programming made faster. IEEE Trans. Evol. Comput. 3(2), 82\u2013102 (1999)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"5789_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100796","volume":"60","author":"O Ramos-Figueroa","year":"2021","unstructured":"Ramos-Figueroa, O., Quiroz-Castellanos, M., Mezura-Montes, E., Kharel, R.: Variation operators for grouping genetic algorithms: A review. Swarm and Evolutionary Computation 60, 100796 (2021)","journal-title":"Swarm and Evolutionary Computation"},{"key":"5789_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2019.100643","volume":"53","author":"O Ramos-Figueroa","year":"2020","unstructured":"Ramos-Figueroa, O., Quiroz-Castellanos, M., Mezura-Montes, E., Sch\u00fctze, O.: Metaheuristics to solve grouping problems: A review and a case study. Swarm and Evolutionary Computation 53, 100643 (2020)","journal-title":"Swarm and Evolutionary Computation"},{"key":"5789_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.108653","volume":"120","author":"R Skinderowicz","year":"2022","unstructured":"Skinderowicz, R.: Improving ant colony optimization efficiency for solving large tsp instances. Applied Soft Computing 120, 108653 (2022)","journal-title":"Applied Soft Computing"},{"key":"5789_CR18","doi-asserted-by":"publisher","first-page":"164820","DOI":"10.1109\/ACCESS.2021.3133493","volume":"9","author":"BAS Emambocus","year":"2021","unstructured":"Emambocus, B.A.S., Jasser, M.B., Hamzah, M., Mustapha, A., Amphawan, A.: An enhanced swap sequence-based particle swarm optimization algorithm to solve tsp. Ieee Access 9, 164820\u2013164836 (2021)","journal-title":"Ieee Access"},{"key":"5789_CR19","doi-asserted-by":"crossref","unstructured":"Jiang, Y., Weise, T., L\u00e4ssig, J., Chiong, R., Athauda, R.: Comparing a hybrid branch and bound algorithm with evolutionary computation methods, local search and their hybrids on the tsp. In: 2014 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS), pp. 148\u2013155 (2014). IEEE","DOI":"10.1109\/CIPLS.2014.7007174"},{"key":"5789_CR20","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-021-04269-6","author":"J Monroe","year":"2022","unstructured":"Monroe, J., Srikant, T., Carbonell-Bejerano, P., Becker, C., Lensink, M., Exposito-Alonso, M., Klein, M., Hildebrandt, J., Neumann, M., Kliebenstein, D., et al.: Mutation bias reflects natural selection in arabidopsis thaliana. Nature (2022). https:\/\/doi.org\/10.1038\/s41586-021-04269-6","journal-title":"Nature"},{"key":"5789_CR21","doi-asserted-by":"crossref","unstructured":"Doush, I.A., Awadallah, M.A., Al-Betar, M.A.: A novel essential mutation method for evolutionary algorithms. In: 2022 2nd International Conference on Computing and Machine Intelligence (ICMI), pp. 1\u20135 (2022). IEEE","DOI":"10.1109\/ICMI55296.2022.9873805"},{"key":"5789_CR22","doi-asserted-by":"crossref","unstructured":"Bye, R.T., Gribbestad, M., Chandra, R., Osen, O.L.: A comparison of ga crossover and mutation methods for the traveling salesman problem. In: Innovations in Computational Intelligence and Computer Vision: Proceedings of ICICV 2020, pp. 529\u2013542 (2021). Springer","DOI":"10.1007\/978-981-15-6067-5_60"},{"key":"5789_CR23","unstructured":"Reinelt, G.: TSPLIB. University of Heidelberg. http:\/\/comopt.ifi.uni-heidelberg.de\/software\/TSPLIB95\/ (1996)"}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-025-05789-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10586-025-05789-w","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-025-05789-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T13:07:15Z","timestamp":1773925635000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10586-025-05789-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,21]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,2]]}},"alternative-id":["5789"],"URL":"https:\/\/doi.org\/10.1007\/s10586-025-05789-w","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"value":"1386-7857","type":"print"},{"value":"1573-7543","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,21]]},"assertion":[{"value":"20 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 July 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 September 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 November 2025","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":"Competing interests"}},{"value":"Not applicable.\u00a0","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics declaration"}}],"article-number":"49"}}