{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T14:40:09Z","timestamp":1774968009915,"version":"3.50.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T00:00:00Z","timestamp":1757376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T00:00:00Z","timestamp":1757376000000},"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":[[2025,10]]},"DOI":"10.1007\/s12065-025-01088-w","type":"journal-article","created":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T07:48:17Z","timestamp":1757404097000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A new ant stridulation-based local search for combinatorial optimization problems"],"prefix":"10.1007","volume":"18","author":[{"given":"Samia","family":"Sammoud","sequence":"first","affiliation":[]},{"given":"Ines","family":"Alaya","sequence":"additional","affiliation":[]},{"given":"Moncef","family":"Tagina","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,9,9]]},"reference":[{"key":"1088_CR1","doi-asserted-by":"crossref","unstructured":"Teodorovi\u0107 D, Davidovi\u0107 T,\u0160elmi\u0107 M, Nikoli\u0107 M (2021) Bee colony optimization and its applications. Handbook of AI-based metaheuristics, pp 301\u2013322","DOI":"10.1201\/9781003162841-16"},{"issue":"3","key":"1088_CR2","doi-asserted-by":"publisher","first-page":"2077","DOI":"10.1007\/s12065-021-00613-x","volume":"15","author":"M Bouzid","year":"2022","unstructured":"Bouzid M, Alaya I, Tagina M (2022) A new artificial bee colony algorithm using a gradual weight method for the bi-objective traveling salesman problems. Evol Intel 15(3):2077\u20132088","journal-title":"Evol Intel"},{"key":"1088_CR3","doi-asserted-by":"publisher","DOI":"10.7717\/peerj-cs.2671","volume":"11","author":"Y Wang","year":"2025","unstructured":"Wang Y, Wei M (2025) An improved termite life cycle optimizer algorithm for global function optimization. PeerJ Comput Sci 11:e2671","journal-title":"PeerJ Comput Sci"},{"key":"1088_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.114430","volume":"167","author":"A Tharwat","year":"2021","unstructured":"Tharwat A, Schenck W (2021) A conceptual and practical comparison of PSO-style optimization algorithms. Expert Syst Appl 167:114430","journal-title":"Expert Syst Appl"},{"key":"1088_CR5","doi-asserted-by":"crossref","unstructured":"Dorigo M, St\u00fctzle T (2018) Ant colony optimization: overview and recent advances. Handbook of metaheuristics, pp 311\u2013351","DOI":"10.1007\/978-3-319-91086-4_10"},{"key":"1088_CR6","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s12065-019-00222-9","volume":"12","author":"I Ben Mansour","year":"2019","unstructured":"Ben Mansour I, Alaya I, Tagina M (2019) A gradual weight-based ant colony approach for solving the multiobjective multidimensional knapsack problem. Evol Intel 12:253\u2013272","journal-title":"Evol Intel"},{"key":"1088_CR7","doi-asserted-by":"crossref","unstructured":"Sammoud S, Alaya I (2022) A new Ant colony optimization metaheuristic based on pheromone guided local search instead of constructive approach. In: Proceedings of the genetic and evolutionary computation conference, pp 13\u201321","DOI":"10.1145\/3512290.3528733"},{"key":"1088_CR8","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/S0927-0507(05)80121-5","volume":"7","author":"M J\u00fcnger","year":"1995","unstructured":"J\u00fcnger M, Reinelt G, Rinaldi G (1995) The traveling salesman problem. Handbooks Oper Res Manag Sci 7:225\u2013330","journal-title":"Handbooks Oper Res Manag Sci"},{"key":"1088_CR9","doi-asserted-by":"crossref","unstructured":"Wong KY (2008) Parameter tuning for ant colony optimization: a review. In: 2008 International conference on computer and communication engineering. IEEE, pp 542\u2013545","DOI":"10.1109\/ICCCE.2008.4580662"},{"key":"1088_CR10","doi-asserted-by":"crossref","unstructured":"Skinderowicz R (2024) Enhancing focused ant colony optimization for large-scale traveling salesman problems through adaptive parameter tuning. In: International conference on computational collective intelligence. Springer, Cham, pp 41\u201354","DOI":"10.1007\/978-3-031-70816-9_4"},{"issue":"8","key":"1088_CR11","doi-asserted-by":"publisher","first-page":"5181","DOI":"10.1016\/j.asoc.2011.05.042","volume":"11","author":"M Pedemonte","year":"2011","unstructured":"Pedemonte M, Nesmachnow S, Cancela H (2011) A survey on parallel ant colony optimization. Appl Soft Comput 11(8):5181\u20135197","journal-title":"Appl Soft Comput"},{"issue":"2","key":"1088_CR12","doi-asserted-by":"publisher","first-page":"2568","DOI":"10.3934\/mbe.2024113","volume":"21","author":"J Si","year":"2024","unstructured":"Si J, Bao X (2024) A novel parallel ant colony optimization algorithm for mobile robot path planning. Math Biosci Eng MBE 21(2):2568\u20132586","journal-title":"Math Biosci Eng MBE"},{"key":"1088_CR13","doi-asserted-by":"crossref","unstructured":"Dorigo M, St\u00fctzle T (2018) Ant colony optimization: overview and recent advances. Handbook of metaheuristics, pp 311\u2013351","DOI":"10.1007\/978-3-319-91086-4_10"},{"issue":"10","key":"1088_CR14","doi-asserted-by":"publisher","first-page":"1399","DOI":"10.3390\/jmse10101399","volume":"10","author":"Y Zheng","year":"2022","unstructured":"Zheng Y, Lv X, Qian L, Liu X (2022) An optimal BP neural network track prediction method based on a GA-ACO hybrid algorithm. J Mar Sci Eng 10(10):1399","journal-title":"J Mar Sci Eng"},{"issue":"2","key":"1088_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11277-021-09174-9","volume":"123","author":"P Kumari","year":"2022","unstructured":"Kumari P, Sahana SK (2022) Swarm based hybrid ACO-PSO meta-heuristic (HAPM) for QoS multicast routing optimization in MANETs. Wirel Pers Commun 123(2):1\u201323","journal-title":"Wirel Pers Commun"},{"issue":"1","key":"1088_CR16","first-page":"1","volume":"3","author":"A Ahmad","year":"2025","unstructured":"Ahmad A (2025) Optimizing the traveling salesman problem using machine learning and predictive algorithms. J Comput Sci Appl Eng 3(1):1\u20135","journal-title":"J Comput Sci Appl Eng"},{"issue":"4","key":"1088_CR17","doi-asserted-by":"publisher","first-page":"1920","DOI":"10.1121\/1.1290515","volume":"108","author":"R Hickling","year":"2000","unstructured":"Hickling R, Brown RL (2000) Analysis of acoustic communication by ants. J Acoust Soc Am 108(4):1920\u20131929","journal-title":"J Acoust Soc Am"},{"key":"1088_CR18","first-page":"17","volume-title":"Evolution of acoustic communication in insects. Insect hearing","author":"MD Greenfield","year":"2016","unstructured":"Greenfield MD (2016) Evolution of acoustic communication in insects. Insect hearing. Springer, Cham, pp 17\u201347"},{"issue":"1","key":"1088_CR19","doi-asserted-by":"publisher","first-page":"5933","DOI":"10.1038\/s41598-021-84925-z","volume":"11","author":"A Masoni","year":"2021","unstructured":"Masoni A, Frizzi F, Nieri R, Casacci LP, Mazzoni V, Turillazzi S, Santini G (2021) Ants modulate stridulatory signals depending on the behavioural context. Sci Rep 11(1):5933","journal-title":"Sci Rep"},{"key":"1088_CR20","volume-title":"Theoretical acoustics","author":"PM Morse","year":"1986","unstructured":"Morse PM, Ingard KU (1986) Theoretical acoustics. Princeton University Press"},{"issue":"8","key":"1088_CR21","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T St\u00fctzle","year":"2000","unstructured":"St\u00fctzle T, Hoos HH (2000) MAX-MIN ant system. Futur Gener Comput Syst 16(8):889\u2013914","journal-title":"Futur Gener Comput Syst"},{"issue":"1","key":"1088_CR22","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":"4","key":"1088_CR23","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","journal-title":"ORSA J Comput"},{"issue":"6","key":"1088_CR24","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"6","author":"GA Croes","year":"1958","unstructured":"Croes GA (1958) A method for solving traveling-salesman problems. Oper Res 6(6):791\u2013812","journal-title":"Oper Res"},{"key":"1088_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106720","volume":"97","author":"AF Tuani","year":"2020","unstructured":"Tuani AF, Keedwell E, Collett M (2020) Heterogenous adaptive ant colony optimization with 3-opt local search for the travelling salesman problem. Appl Soft Comput 97:106720","journal-title":"Appl Soft Comput"},{"key":"1088_CR26","doi-asserted-by":"publisher","first-page":"67205","DOI":"10.1109\/ACCESS.2020.2985498","volume":"8","author":"Y Liu","year":"2020","unstructured":"Liu Y, Cao B (2020) A novel ant colony optimization algorithm with Levy flight. IEEE Access 8:67205\u201367213","journal-title":"IEEE Access"},{"key":"1088_CR27","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 \u00d6K, 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"},{"key":"1088_CR28","doi-asserted-by":"publisher","first-page":"1669","DOI":"10.1007\/s00500-016-2432-3","volume":"22","author":"\u015e G\u00fclc\u00fc","year":"2018","unstructured":"G\u00fclc\u00fc \u015e, Mahi M, Baykan \u00d6K, 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:1669\u20131685","journal-title":"Soft Comput"},{"key":"1088_CR29","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s11831-017-9247-y","volume":"26","author":"AH Halim","year":"2019","unstructured":"Halim AH, Ismail I (2019) Combinatorial optimization: comparison of heuristic algorithms in travelling salesman problem. Arch Comput Method Eng 26:367\u2013380","journal-title":"Arch Comput Method Eng"},{"issue":"12","key":"1088_CR30","doi-asserted-by":"publisher","first-page":"7339","DOI":"10.3390\/app13127339","volume":"13","author":"F Uddin","year":"2023","unstructured":"Uddin F, Riaz N, Manan A, Mahmood I, Song OY, Malik AJ, Abbasi AA (2023) An improvement to the 2-opt heuristic algorithm for approximation of optimal TSP tour. Appl Sci 13(12):7339","journal-title":"Appl Sci"},{"key":"1088_CR31","unstructured":"Available Online: https:\/\/github.com\/saper0\/tsp-heuristics"}],"container-title":["Evolutionary Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-025-01088-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12065-025-01088-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-025-01088-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T12:17:36Z","timestamp":1761394656000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12065-025-01088-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,9]]},"references-count":31,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,10]]}},"alternative-id":["1088"],"URL":"https:\/\/doi.org\/10.1007\/s12065-025-01088-w","relation":{},"ISSN":["1864-5909","1864-5917"],"issn-type":[{"value":"1864-5909","type":"print"},{"value":"1864-5917","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,9]]},"assertion":[{"value":"29 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 June 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 August 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 September 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":"All authors certify that they have no affiliations with or involvement in any organization or entity with any financial interest or non-financial interest in the subject matter or materials discussed in this manuscript.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"102"}}