Optimization Based on Simulation of Ants Colony

  • Mihailo JovanovićEmail author
  • Ermin Husak
Conference paper
Part of the Lecture Notes in Networks and Systems book series (LNNS, volume 76)


Natural processes optimize life on earth for thousands of years, so people are inspired by many problem-solving techniques in nature. Metaheuristics inspired by natural processes and systems have become a very active field of research in recent years. One of the most popular methods is Ant Colony Optimization (ACO). In this paper is considered the application of Ant Colony Optimization in the case of the Traveling Salesman Problem (TSP). Different cases, with a different number of ants (population size) with a different number of iteration using software simulation, are considered. It is shown that Roulette Wheel Selection has some impact on the speed of the result. On the other hand, with more ants in each iteration, we get more constructed solutions, which increases the probability of finding a better solution.


Ant Colony Optimization ACO Software Traveling Salesman Problem – TSP 


  1. 1.
    Hotomski, P.: Sistemi veštačke inteligencije. Tehnički fakultet “Mihajlo Pupin”, Zrenjanin (2006)Google Scholar
  2. 2.
    Amaldi, E., Capone, A., Malucelli, F.: Optimization models with power control and algorithm (2003)Google Scholar
  3. 3.
    Schauer, C., Hu, B.: Heuristic optimization techniques. A lecture held on University of Technology Vienna WS (2011)Google Scholar
  4. 4.
    Carić, T.: Optimizacija prometnih procesa. Sveučilište u Zagrebu (2014)Google Scholar
  5. 5.
    Dorigo, M., Maniezzo, V., Colorni, A.: Ant System: Optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybern.-Part B 26(1), 29–41 (1996)CrossRefGoogle Scholar
  6. 6.
    Goss, S., Aron, S., Deneubourg, J.-L., Pasteels, J.M.: Self-organized shortcuts in the Argentine ant. Naturwissenschaften 76, 579–581 (1989)CrossRefGoogle Scholar
  7. 7.
    Dorigo, M., Caro, D.G., Gambardella, L.M.: Ant algorithms for discrete optimization. Artif. Life 5(2), 137–172 (1999)CrossRefGoogle Scholar
  8. 8.
    Fidanova, S.: ACO algorithm for MKP using various heuristic information. In: Dimov, I., Lirkov, I., Margenov, S., Zlatev, Z. (eds.) Numerical Methods and Applications. LNCS, vol. 2542, pp. 434–330. Springer-Verlag, Berlin (2003)CrossRefGoogle Scholar
  9. 9.
    Dorigo, M., et al.: Ant System: An Autocatalytic Optimizing Process. Politecnico di Milano (1991)Google Scholar
  10. 10.
    Stützle, T, Hoos, H.H.: Improving the Ant System. A detailed report on MAX –MIN Ant System, Technical report, AIDA-96-12, TU DarmstadtGoogle Scholar
  11. 11.
    Dorigo, M., Gambardella, L.M.: Ant Colonies for the Traveling Salesman Problem. BioSystems 43, 73–81 (1997)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.Faculty of Management Herceg NoviHerceg NoviMontenegro
  2. 2.Technical FacultyUniversity of BihaćBihaćBosnia and Herzegovina

Personalised recommendations