{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T16:48:17Z","timestamp":1765039697744,"version":"build-2065373602"},"reference-count":40,"publisher":"MDPI AG","issue":"5","license":[{"start":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T00:00:00Z","timestamp":1683849600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Croatian Science Foundation","award":["IP-2019-04-4864"],"award-info":[{"award-number":["IP-2019-04-4864"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>Ant colony optimization (ACO) is a well-known class of swarm intelligence algorithms suitable for solving many NP-hard problems. An important component of such algorithms is a record of pheromone trails that reflect colonies\u2019 experiences with previously constructed solutions of the problem instance that is being solved. By using pheromones, the algorithm builds a probabilistic model that is exploited for constructing new and, hopefully, better solutions. Traditionally, there are two different strategies for updating pheromone trails. The best-so-far strategy (global best) is rather greedy and can cause a too-fast convergence of the algorithm toward some suboptimal solutions. The other strategy is named iteration best and it promotes exploration and slower convergence, which is sometimes too slow and lacks focus. To allow better adaptability of ant colony optimization algorithms we use \u03ba-best, max-\u03ba-best, and 1\/\u03bb-best strategies that form the entire spectrum of strategies between best-so-far and iteration best and go beyond. Selecting a suitable strategy depends on the type of problem, parameters, heuristic information, and conditions in which the ACO is used. In this research, we use two representative combinatorial NP-hard problems, the symmetric traveling salesman problem (TSP) and the asymmetric traveling salesman problem (ATSP), for which very effective heuristic information is widely known, to empirically analyze the influence of strategies on the algorithmic performance. The experiments are carried out on 45 TSP and 47 ATSP instances by using the MAX-MIN ant system variant of ACO with and without local optimizations, with each problem instance repeated 101 times for 24 different pheromone reinforcement strategies. The results show that, by using adjustable pheromone reinforcement strategies, the MMAS outperformed in a large majority of cases the MMAS with classical strategies.<\/jats:p>","DOI":"10.3390\/a16050251","type":"journal-article","created":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T10:49:51Z","timestamp":1683888591000},"page":"251","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Adjustable Pheromone Reinforcement Strategies for Problems with Efficient Heuristic Information"],"prefix":"10.3390","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1730-2518","authenticated-orcid":false,"given":"Nikola","family":"Ivkovi\u0107","sequence":"first","affiliation":[{"name":"Faculty of Organization and Informatics, University of Zagreb, Pavlinska 2, 42000 Vara\u017edin, Croatia"}]},{"given":"Robert","family":"Kudeli\u0107","sequence":"additional","affiliation":[{"name":"Faculty of Organization and Informatics, University of Zagreb, Pavlinska 2, 42000 Vara\u017edin, Croatia"}]},{"given":"Marin","family":"Golub","sequence":"additional","affiliation":[{"name":"Faculty of Electrical Engineering and Computing, University of Zagreb, Unska 3, 10000 Zagreb, Croatia"}]}],"member":"1968","published-online":{"date-parts":[[2023,5,12]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Leguizam\u00f3n, G., and Coello, C.A.C. (2010, January 8\u201310). An alternative ACOR algorithm for continuous optimization problems. Proceedings of the 7th International Conference on Swarm Intelligence, ANTS\u201910, Brussels, Belgium.","DOI":"10.1007\/978-3-642-15461-4_5"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1109\/TEVC.2013.2281531","article-title":"Ant Colony Optimization for Mixed-Variable Optimization Problems","volume":"18","author":"Liao","year":"2014","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"116605","DOI":"10.1016\/j.eswa.2022.116605","article-title":"Modified continuous Ant Colony Optimisation for multiple Unmanned Ground Vehicle path planning","volume":"196","author":"Liu","year":"2022","journal-title":"Expert Syst. Appl."},{"key":"ref_4","first-page":"3241","article-title":"Hybrid ant colony optimization algorithms for mixed discrete\u2013continuous optimization problems","volume":"219","author":"Liao","year":"2012","journal-title":"Appl. Math. Comput."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"818","DOI":"10.1016\/j.engappai.2019.08.009","article-title":"Improved continuous Ant Colony Optimization algorithms for real-world engineering optimization problems","volume":"85","author":"Omran","year":"2019","journal-title":"Eng. Appl. Artif. Intell."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/j.eswa.2017.03.036","article-title":"A robust ant colony optimization for continuous functions","volume":"81","author":"Chen","year":"2017","journal-title":"Expert Syst. Appl."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/j.eswa.2018.12.021","article-title":"Ant inspired Monte Carlo algorithm for minimum feedback arc set","volume":"122","year":"2019","journal-title":"Expert Syst. Appl."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","article-title":"MAX-MIN Ant System","volume":"16","author":"Hoos","year":"2000","journal-title":"Future Gener. Comput. Syst."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Klatte, D., L\u00fcthi, H.J., and Schmedders, K. (2012). Operations Research Proceedings 2011, Proceedings of the International Conference on Operations Research (OR 2011), Zurich, Switzerland, 30 August\u20132 September 2011, Springer.","DOI":"10.1007\/978-3-642-29210-1"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cor.2017.04.012","article-title":"An improved Ant Colony System for the Sequential Ordering Problem","volume":"86","author":"Skinderowicz","year":"2017","journal-title":"Comput. Oper. Res."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Ky Phuc, P.N., and Phuong Thao, N.L. (2021). Ant Colony Optimization for Multiple Pickup and Multiple Delivery Vehicle Routing Problem with Time Window and Heterogeneous Fleets. Logistics, 5.","DOI":"10.3390\/logistics5020028"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"10855","DOI":"10.1109\/TCYB.2021.3069942","article-title":"A Bilevel Ant Colony Optimization Algorithm for Capacitated Electric Vehicle Routing Problem","volume":"52","author":"Jia","year":"2022","journal-title":"IEEE Trans. Cybern."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Mernik, M., Eftimov, T., and \u010crepin\u0161ek, M. (2022). Bioinspired Optimization Methods and Their Applications, Springer International Publishing.","DOI":"10.1007\/978-3-031-21094-5"},{"key":"ref_14","first-page":"662","article-title":"Extended Trail Reinforcement Strategies for Ant Colony Optimization","volume":"Volume 7076","author":"Panigrahi","year":"2011","journal-title":"Swarm, Evolutionary, and Memetic Computing, Proceedings of the Second International Conference, SEMCCO 2011, Visakhapatnam, India, 19\u201321 December 2011"},{"key":"ref_15","unstructured":"Dorigo, M., Maniezzo, V., and Colorni, A. (1991). Positive Feedback as a Search Strategy, Dipartimento di Elettronica, Politecnico di Milano. Technical Report 91-016."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/3477.484436","article-title":"Ant system: Optimization by a colony of cooperating agents","volume":"26","author":"Dorigo","year":"1996","journal-title":"IEEE Trans. Syst. Man Cybern. Part B"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/4235.585892","article-title":"Ant colony system: A cooperative learning approach to the traveling salesman problem","volume":"1","author":"Dorigo","year":"1997","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_18","unstructured":"Dorigo, M. (1992). Optimization, Learning and Natural Algorithms. [Ph.D. Thesis, Politecnico di Milano]. (In Italian)."},{"key":"ref_19","first-page":"25","article-title":"A New Rank Based Version of the Ant System: A Computational Study","volume":"7","author":"Bullnheimer","year":"1999","journal-title":"Cent. Eur. J. Oper. Res. Econ."},{"key":"ref_20","unstructured":"Cord\u00f3n, O., de Viana, I.F., and Herrera, F. (2002). Ant Algorithms, Proceedings of the Third International Workshop, ANTS 2002, Brussels, Belgium, 12\u201314 September 2002, Springer."},{"key":"ref_21","first-page":"177","article-title":"Analysis of the Best-Worst Ant System and its Variants on the TSP","volume":"9","author":"Herrera","year":"2002","journal-title":"Mathw. Soft Comput."},{"key":"ref_22","unstructured":"Guntsch, M., and Middendorf, M. (2002). Ant Algorithms, Proceedings of the Third International Workshop, ANTS 2002, Brussels, Belgium, 12\u201314 September 2002, Springer."},{"key":"ref_23","first-page":"72","article-title":"A Population Based Approach for ACO","volume":"Volume 2279","author":"Cagnoni","year":"2002","journal-title":"Applications of Evolutionary Computing, Proceedings of the EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM\/EvoPLAN, Kinsale, Ireland, 3\u20134 April 2002"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/j.neucom.2012.12.084","article-title":"Pheromone mark ant colony optimization with a hybrid node-based pheromone update strategy","volume":"148","author":"Deng","year":"2015","journal-title":"Neurocomputing"},{"key":"ref_25","first-page":"213","article-title":"Pheromone Modification Strategies for Ant Algorithms Applied to Dynamic TSP","volume":"Volume 2037","author":"Boers","year":"2001","journal-title":"Applications of Evolutionary Computing, Proceedings of the EvoWorkshops 2001: EvoCOP, EvoFlight, EvoIASP, EvoLearn, and EvoSTIM, Como, Italy, 18\u201320 April 2001"},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Wang, L., Shen, J., and Luo, J. (July, January 27). Impacts of Pheromone Modification Strategies in Ant Colony for Data-Intensive Service Provision. Proceedings of the 2014 IEEE International Conference on Web Services, ICWS, Anchorage, AK, USA.","DOI":"10.1109\/ICWS.2014.36"},{"key":"ref_27","unstructured":"Wang, H., Yuen, S.Y., Wang, L., Shao, L., and Wang, X. (2013, January 23\u201325). An improved Ant Colony Algorithm based on dynamic weight of pheromone updating. Proceedings of the Ninth International Conference on Natural Computation, ICNC 2013, Shenyang, China."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"2309","DOI":"10.1587\/transinf.E96.D.2309","article-title":"An Improved Model of Ant Colony Optimization Using a Novel Pheromone Update Strategy","volume":"E96.D","author":"Lalbakhsh","year":"2013","journal-title":"IEICE Trans. Inf. Syst."},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Bacanin, N., Stoean, R., Zivkovic, M., Petrovic, A., Rashid, T.A., and Bezdan, T. (2021). Performance of a Novel Chaotic Firefly Algorithm with Enhanced Exploration for Tackling Global Optimization Problems: Application for Dropout Regularization. Mathematics, 9.","DOI":"10.3390\/math9212705"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"2533","DOI":"10.1007\/s00521-018-3937-8","article-title":"A GA based hierarchical feature selection approach for handwritten word recognition","volume":"32","author":"Malakar","year":"2019","journal-title":"Neural Comput. Appl."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Michel, R., and Middendorf, M. (1998, January 27\u201330). An Island Model Based Ant System with Lookahead for the Shortest Supersequence Problem. Proceedings of the 5th International Conference on Parallel Problem Solving from Nature\u2014PPSN V, Amsterdam, The Netherlands.","DOI":"10.1007\/BFb0056911"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/s10732-006-4295-8","article-title":"A study of ACO capabilities for solving the maximum clique problem","volume":"12","author":"Solnon","year":"2006","journal-title":"J. Heuristics"},{"key":"ref_33","unstructured":"Gambardella, L.M., Taillard, E., and Agazzi, G. (1999). New Ideas in Optimization, McGraw-Hill Ltd."},{"key":"ref_34","unstructured":"Ivkovi\u0107, N. (2014). Modeling, Analysis and Improvement of Ant Colony Optimization Algorithms. [Ph.D. Thesis, University of Zagreb]. (In Croatian)."},{"key":"ref_35","first-page":"280","article-title":"A New Ant Colony Optimization Algorithm: Three Bound Ant System","volume":"Volume 8667","author":"Dorigo","year":"2014","journal-title":"Swarm Intelligence, Proceedings of the 9th International Conference, ANTS 2014, Brussels, Belgium, 10\u201312 September 2014"},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Ivkovi\u0107, N. (2018). Swarm Intelligence\u2014Volume 1: Principles, Current Algorithms and Methods, The Institution of Engineering and Technology.","DOI":"10.1049\/PBCE119F_ch1"},{"key":"ref_37","doi-asserted-by":"crossref","unstructured":"Dorigo, M., and St\u00fctzle, T. (2004). Ant Colony Optimization, The MIT Press.","DOI":"10.7551\/mitpress\/1290.001.0001"},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"167","DOI":"10.18178\/ijmlc.2016.6.3.593","article-title":"Measuring Performance of Optimization Algorithms in Evolutionary Computation","volume":"6","author":"Ivkovic","year":"2016","journal-title":"Int. J. Mach. Learn. Comput."},{"key":"ref_39","doi-asserted-by":"crossref","unstructured":"Ivkovi\u0107, N., Kudeli\u0107, R., and \u010crepin\u0161ek, M. (2022). Probability and Certainty in the Performance of Evolutionary and Swarm Optimization Algorithms. Mathematics, 10.","DOI":"10.3390\/math10224364"},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","article-title":"A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms","volume":"1","author":"Derrac","year":"2011","journal-title":"Swarm Evol. Comput."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/16\/5\/251\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T19:34:04Z","timestamp":1760124844000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/16\/5\/251"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,12]]},"references-count":40,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2023,5]]}},"alternative-id":["a16050251"],"URL":"https:\/\/doi.org\/10.3390\/a16050251","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2023,5,12]]}}}