Comparison of Different ACO Start Strategies Based on InterCriteria Analysis

  • Olympia Roeva
  • Stefka FidanovaEmail author
  • Marcin Paprzycki
Part of the Studies in Computational Intelligence book series (SCI, volume 717)


In the combinatorial optimization, the goal is to find the optimal object from a finite set of objects. From computational point of view the combinatorial optimization problems are hard to be solved. Therefore on this kind of problems usually is applied some metaheuristics. One of the most successful techniques for a lot of problem classes is metaheuristic algorithm Ant Colony Optimization (ACO). Some start strategies can be applied on ACO algorithms to improve the algorithm performance. We propose several start strategies when an ant chose first node, from which to start to create a solution. Some of the strategies are base on forbidding some of the possible starting nodes, for one or more iterations, because we suppose that no good solution starting from these nodes. The aim of other strategies are to increase the probability to start from nodes with expectations that there are good solutions starting from these nodes. We can apply any of the proposed strategy separately or to combine them. In this investigation InterCriteria Analysis (ICrA) is applied on ACO algorithms with the suggested different start strategies. On the basis of ICrA the ACO performance is examined and analysed.


InterCriteria analysis Ant colony optimization Start strategies Multiple knapsack problem 



Work presented here is partially supported by the National Scientific Fund of Bulgaria under Grants DFNI-02-5/2014 “Intercriteria Analysis – A Novel Approach to Decision Making” and DFNI I02/20 “Efficient Parallel Algorithms for Large Scale Computational Problems”, and by the Polish-Bulgarian collaborative Grant “Parallel and Distributed Computing Practices”.


  1. 1.
    Angelova, M., Roeva, O., Pencheva, T.: InterCriteria analysis of crossover and mutation rates relations in simple genetic algorithm. Proc. Fed. Conf. Comput. Sci. Inf. Syst. 5, 419–424 (2015)Google Scholar
  2. 2.
    Atanassov, K.: On index matrices, part 1: standard cases. Adv. Stud. Contemp. Math. 20(2), 291–302 (2010)MathSciNetzbMATHGoogle Scholar
  3. 3.
    Atanassov, K.: On Intuitionistic Fuzzy Sets Theory. Springer, Berlin (2012)CrossRefzbMATHGoogle Scholar
  4. 4.
    Atanassov, K., Mavrov, D., Atanassova, V.: Intercriteria decision making: a new approach for multicriteria decision making. Based Index Matrices Intuitionistic Fuzzy Sets. Issues IFSs GNs 11, 1–8 (2014)Google Scholar
  5. 5.
    Atanassova, V., Mavrov, D., Doukovska, L., Atanassov, K.: Discussion on the threshold values in the intercriteria decision making approach. Notes on Intuitionistic Fuzzy Sets 20(2), 94–99 (2014)Google Scholar
  6. 6.
    Atanassova, V., Doukovska, L., Atanassov, K., Mavrov, D.: Intercriteria decision making approach to EU member states competitiveness analysis. In: Proceedings of the International Symposium on Business Modeling and Software Design - BMSD’14, pp. 289–294 (2014)Google Scholar
  7. 7.
    Atanassova, V., Doukovska, L., Karastoyanov, D., Capkovic, F.: Intercriteria decision making approach to EU member states competitiveness analysis: trend analysis, In: Angelov, P., et al. (eds.) Intelligent Systems’ 2014. Advances in Intelligent Systems and Computing, vol. 322, pp. 107–115 (2014)Google Scholar
  8. 8.
    Atanassov, K., Atanassova, V., Gluhchev, G.: InterCriteria analysis: ideas and problems. Notes Intuitionistic Fuzzy Sets 21(1), 81–88 (2015)Google Scholar
  9. 9.
    Diffe, W., Hellman, M.E.: New direction in cryptography. IEEE Trans. Inf. Theory IT-36, 644–654 (1976)Google Scholar
  10. 10.
    Dorigo, M., Stutzler, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)Google Scholar
  11. 11.
    Dorigo, M., Birattari, M.: Ant colony optimization. In: Sammut, C.,  Webb, G.I (eds.) Encyclopedia of Machine Learning, pp. 36–39. Springer, Berlin (2010)Google Scholar
  12. 12.
    Fidanova, S.: Evolutionary algorithm for multiple knapsack problem. In: Proceedings of International Conference Parallel Problems Solving from Nature, Real World Optimization Using Evolutionary computing, Granada, Spain (2002)Google Scholar
  13. 13.
    Fidanova, S., Atanassov, K., Marinov, P.: Generalized Nets and Ant Colony Optimization. Academic Publishing House, Bulgarian Academy of Sciences (2011)Google Scholar
  14. 14.
    Gendreau, M., Potvin, J.-Y.: Handbook of Metaheuristics. International Series in Operations Research and Management Science. Springer, Berlin (2010)Google Scholar
  15. 15.
    Kochemberger, G., McCarl, G., Wymann, F.: Heuristic for general inter programming. J. Decision Sci. 5, 34–44 (1974)Google Scholar
  16. 16.
    Lessing, L., Dumitrescu, I., Stutzle, T.: A Comparison Between ACO Algorithms for the Set Covering Problem, Ant Colony Optimization and Swarm Intelligence. Lecture Notes in Computer Science, vol. 3172. Springer, Germany (2004)Google Scholar
  17. 17.
    Martello, S., Toth, P.: A mixtures of dynamic programming and branch-and-bound for the subset-sum problem. Manag. Sci. 30, 756–771 (1984)MathSciNetCrossRefzbMATHGoogle Scholar
  18. 18.
    Reiman, M., Loumanns, M.: A hybride ACO algorithm for a capacitated minimum spanning tree problem. In: Proceedings of First International Workshop on Hybrid Metaheuristics, Valencia, Spain, pp. 1–10 (2004)Google Scholar
  19. 19.
    Roeva, O., Fidanova, S., Vassilev, P., Gepner, P.: Intercriteria analysis of a model parameters identification using genetic algorithm. Proc. Fed. Conf. Comput. Sci. Inf. Syst. 5, 501–506 (2015)Google Scholar
  20. 20.
    Roeva, O., Fidanova, S., Paprzycki, M.: Intercriteria analysis of ACO and GA hybrid algorithms. Stud. Comput. Intell. 610, 107–126 (2016)MathSciNetGoogle Scholar
  21. 21.
    Sinha, A., Zoltner, A.A.: The multiple-choice knapsack problem. J. Op. Res. 27, 503–515 (1979)MathSciNetCrossRefzbMATHGoogle Scholar
  22. 22.
    Stutzle, T., Dorigo, M.: ACO algorithm for the traveling salesman problem. Evolutionary Algorithms in Engineerings and Computer Science, pp. 163–183. Wiley, New York (1999)Google Scholar
  23. 23.
    Todinova, S., Mavrov, D., Krumova, S., Marinov, P., Atanassova, V., Atanassov, K., Taneva, S.G.: Blood plasma thermograms dataset analysis by means of intercriteria and correlation analyses for the case of colorectal cancer. Int. J. Bioautomation 20(1), 115–124 (2016)Google Scholar
  24. 24.
    Zhang, T., Wang, S., Tian, W., Zhang, Y.: ACO-VRPTWRT: a new algorithm for the vehicle routing problems with time windows and re-used vehicles based on ant colony optimization. In: Proceedings of Sixth International Conference on Intelligent Systems Design and Applications, pp. 390–395. IEEE Press (2006)Google Scholar

Copyright information

© Springer International Publishing AG 2018

Authors and Affiliations

  • Olympia Roeva
    • 1
  • Stefka Fidanova
    • 2
    Email author
  • Marcin Paprzycki
    • 3
  1. 1.Institute of Biophysics and Biomedical EngineeringBulgarian Academy of SciencesSofiaBulgaria
  2. 2.Institute of Information and Communication TechnologyBulgarian Academy of SciencesSofiaBulgaria
  3. 3.System Research InstitutePolish Academy of Sciences Warsaw and Management AcademyWarsawPoland

Personalised recommendations