Intuitionistic Fuzzy Estimation of the Ant Colony Optimization Starting Points

  • Stefka Fidanova
  • Krassimir Atanassov
  • Pencho Marinov
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7116)


The ability of ant colonies to form paths for carrying food is rather fascinating. The problem is solved collectively by the whole colony. This ability is explained by the fact that ants communicate in an indirect way by laying trails of pheromone. The higher the pheromone trail within a particular direction, the higher the probability of choosing this direction. The collective problem solving mechanism has given rise to a metaheuristic referred to as Ant Colony Optimization. On this work we use intoitionistic fuzzy estimation of start nodes with respect to the quality of the solution. Various start strategies are offered. Sensitivity analysis of the algorithm behavior according to estimation parameters is made. As a test problem Multidimensional (Multiple) Knapsack Problem is used.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Atanassov, K.: Intuitionistic Fuzzy Sets. Springer, Heidelberg (1999)zbMATHGoogle Scholar
  2. 2.
    Bonabeau, E., Dorigo, M., Theraulaz, G.: Swarm Intelligence: From Natural to Artificial Systems. Oxford University Press, New York (1999)zbMATHGoogle Scholar
  3. 3.
    Diffe, W., Hellman, M.E.: New direction in cryptography. IEEE Trans Inf. Theory IT-36, 644–654 (1976)CrossRefGoogle Scholar
  4. 4.
    Dorigo, M., Gambardella, L.M.: Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem. IEEE Transactions on Evolutionary Computation 1, 53–66 (1997)CrossRefGoogle Scholar
  5. 5.
    Dorigo, M., Stutzle, T.: Ant Colony Optimization. MIT Press (2004)Google Scholar
  6. 6.
    Fidanova, S.: Evolutionary Algorithm for Multiple Knapsack Problem. In: Int. Conference Parallel Problems Solving from Nature, Real World Optimization Using Evolutionary Computing, Granada, Spain (2002) ISBN No 0-9543481-0-9Google Scholar
  7. 7.
    Fidanova, S.: Ant colony optimization and multiple knapsack problem. In: Renard, J.P. (ed.) Handbook of Research on Nature Inspired Computing for Economics and Management, pp. 498–509. Idea Grup. Inc. (2006) ISBN 1-59140-984-5Google Scholar
  8. 8.
    Fidanova, S., Atanassov, K., Marinov, P., Parvathi, R.: Ant Colony Optimization for Multiple Knapsack Problems with Controlled Starts. Int. J. Bioautomation 13(4), 271–280 (2008)Google Scholar
  9. 9.
    Martello, S., Toth, P.: A mixtures of dynamic programming and branch-and-bound for the subset-sum problem. Management Science 30, 756–771 (1984)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Reiman, M., Laumanns, M.: A Hybrid ACO algorithm for the Capacitated Minimum Spanning Tree Problem. In: Proc. of First Int. Workshop on Hybrid Metahuristics, Valencia, Spain, pp. 1–10 (2004)Google Scholar
  11. 11.
    Sinha, A., Zoltner, A.A.: The multiple-choice knapsack problem. J. Operational Research 27, 503–515 (1979)zbMATHGoogle Scholar
  12. 12.
    Stutzle, T., Dorigo, M.: ACO Algorithm for the Traveling Salesman Problem. In: Miettinen, K., Makela, M., Neittaanmaki, P., Periaux, J. (eds.) Evolutionary Algorithms in Engineering and Computer Science, pp. 163–183. Wiley (1999)Google Scholar
  13. 13.
    Stutzle, T., Hoos, H.H.: MAX-MIN Ant System. In: Dorigo, M., Stutzle, T., Di Caro, G. (eds.) Future Generation Computer Systems, vol. 16, pp. 889–914 (2000)Google Scholar
  14. 14.
    Zhang, T., Wang, S., Tian, W., Zhang, Y.: ACO-VRPTWRV: A New Algorithm for the Vehicle Routing Problems with Time Windows and Re-used Vehicles based on Ant Colony Optimization. In: Sixth International Conference on Intelligent Systems Design and Applications, pp. 390–395. IEEE Press (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Stefka Fidanova
    • 1
  • Krassimir Atanassov
    • 2
  • Pencho Marinov
    • 1
  1. 1.IICTBulgarian Academy of SciencesSofiaBulgaria
  2. 2.CLBMEBulgarian Academy of ScienceSofiaBulgaria

Personalised recommendations