{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T15:08:02Z","timestamp":1781104082716,"version":"3.54.1"},"reference-count":30,"publisher":"IGI Global Scientific Publishing","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,7]]},"abstract":"<jats:p>The combinatorial optimization problem is attracting research because they have a wide variety of applications ranging from route planning and supply chain optimization to industrial scheduling and the IoT. Solving such problems using heuristics and bio-inspired techniques is an alternative to exact solutions offering acceptable solutions at fair computational costs. In this article, a new hierarchical hybrid method is proposed as a hybridization of Ant Colony Optimization (ACO), Firefly Algorithm (FA), and local search (AS-FA-Ls). The proposed methods are compared to similar techniques on the traveling salesman problem, (TSP). ACO is used in a hierarchical collaboration schema together with FA which is used to adapt ACO parameters. A local search strategy is used which is the 2 option method to avoid suboptimal solutions. A comparative review and experimental investigations are conducted using the TSP benchmarks. The results showed that AS-FA-Ls returned better results than the listed works in the following cases: berlin52, st70, eil76, rat99, kroA100, and kroA200. Computational investigations allowed determining a set of recommended parameters to be used with ACO for the TSP instances of the study.<\/jats:p>","DOI":"10.4018\/ijsda.2020070104","type":"journal-article","created":{"date-parts":[[2020,6,23]],"date-time":"2020-06-23T10:11:50Z","timestamp":1592907110000},"page":"58-73","source":"Crossref","is-referenced-by-count":2,"title":["A Hybrid Hierarchical Heuristic-ACO With Local Search Applied to Travelling Salesman Problem, AS-FA-Ls"],"prefix":"10.4018","volume":"9","author":[{"given":"Nizar","family":"Rokbani","sequence":"first","affiliation":[{"name":"High Institute of Applied Science and Technology of Sousse, University of Sousse, Tunisia & REGIM-Lab, University of Sfax, Tunisia & National Engineering School of Sfax, Tunisia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pavel","family":"Kromer","sequence":"additional","affiliation":[{"name":"Department of Computer Science, FEECS, VSB - Technical University of Ostrava, Czech Republic"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ikram","family":"Twir","sequence":"additional","affiliation":[{"name":"High Institute of Applied Science and Technology of Sousse, University of Sousse, Tunisia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Adel M.","family":"Alimi","sequence":"additional","affiliation":[{"name":"REGIM-Lab, University of Sfax, Tunisia & National Engineering School of Sfax, Tunisia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"IJSDA.2020070104-0","doi-asserted-by":"publisher","DOI":"10.1504\/IJSI.2018.091415"},{"key":"IJSDA.2020070104-1","doi-asserted-by":"publisher","DOI":"10.4018\/IJSDA.2016040101"},{"key":"IJSDA.2020070104-2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.6.6.791"},{"key":"IJSDA.2020070104-3","doi-asserted-by":"publisher","DOI":"10.4249\/scholarpedia.1462"},{"key":"IJSDA.2020070104-4","doi-asserted-by":"crossref","unstructured":"Dorigo, M., & Gambardella, L. M. (1997). Ant colonies for the travelling salesman problem. Biosystems, 43(2), 73-81.","DOI":"10.1016\/S0303-2647(97)01708-5"},{"key":"IJSDA.2020070104-5","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1290.001.0001"},{"key":"IJSDA.2020070104-6","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocs.2017.12.012"},{"key":"IJSDA.2020070104-7","doi-asserted-by":"publisher","DOI":"10.3906\/elk-1210-147"},{"key":"IJSDA.2020070104-8","unstructured":"Helsgaun, K. (2006). An effective implementation of K-opt moves for the Lin-Kernighan TSP heuristic [Doctoral dissertation]. Roskilde University."},{"key":"IJSDA.2020070104-9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107338388"},{"key":"IJSDA.2020070104-10","doi-asserted-by":"publisher","DOI":"10.1080\/08839514.2017.1339983"},{"key":"IJSDA.2020070104-11","unstructured":"Karaboga, D. (2005). An idea based on honey bee swarm for numerical optimization. Erciyes University."},{"key":"IJSDA.2020070104-12","doi-asserted-by":"publisher","DOI":"10.1109\/SMC.2016.7844999"},{"key":"IJSDA.2020070104-13","doi-asserted-by":"publisher","DOI":"10.1109\/ICNN.1995.488968"},{"key":"IJSDA.2020070104-14","unstructured":"Kumbharana, S. N. & Pandey, G. M. (2013). Solving travelling salesman problem using firefly algorithm. International Journal for Research in science & advanced Technologies, 2(2), 53-57."},{"key":"IJSDA.2020070104-15","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(90)90100-Q"},{"key":"IJSDA.2020070104-16","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2015.01.068"},{"key":"IJSDA.2020070104-17","doi-asserted-by":"crossref","DOI":"10.1201\/b19035","author":"W. L.Martinez","year":"2015","journal-title":"Computational statistics handbook with MATLAB"},{"key":"IJSDA.2020070104-18","doi-asserted-by":"publisher","DOI":"10.4018\/IJSDA.2015100104"},{"key":"IJSDA.2020070104-19","doi-asserted-by":"publisher","DOI":"10.4018\/IJSDA.2017040102"},{"key":"IJSDA.2020070104-20","doi-asserted-by":"publisher","DOI":"10.4018\/ijsda.2014040103"},{"key":"IJSDA.2020070104-21","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.3.4.376"},{"key":"IJSDA.2020070104-22","doi-asserted-by":"publisher","DOI":"10.1109\/HIS.2013.6920491"},{"key":"IJSDA.2020070104-23","doi-asserted-by":"publisher","DOI":"10.3233\/HIS-180258"},{"key":"IJSDA.2020070104-24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11017-2_15"},{"key":"IJSDA.2020070104-25","doi-asserted-by":"publisher","DOI":"10.1504\/IJIEI.2019.101565"},{"key":"IJSDA.2020070104-26","first-page":"171","article-title":"Experimental Investigation of Ant Supervised by Simplified PSO with Local Search Mechanism (SAS-PSO-2Opt).","author":"I.Twir","year":"2017","journal-title":"International Conference on Soft Computing and Pattern Recognition"},{"key":"IJSDA.2020070104-27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-72550-5_2"},{"key":"IJSDA.2020070104-28","first-page":"169","article-title":"Firefly algorithms for multimodal optimization.","author":"X. S.Yang","year":"2009","journal-title":"International symposium on stochastic algorithms"},{"key":"IJSDA.2020070104-29","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84882-983-1_15"}],"container-title":["International Journal of System Dynamics Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=257243","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,6]],"date-time":"2022-05-06T08:41:33Z","timestamp":1651826493000},"score":1,"resource":{"primary":{"URL":"http:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/IJSDA.2020070104"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2020,7]]},"references-count":30,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.4018\/ijsda.2020070104","relation":{},"ISSN":["2160-9772","2160-9799"],"issn-type":[{"value":"2160-9772","type":"print"},{"value":"2160-9799","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,7]]}}}