As of August 2024, International Journal "Notes on Intuitionistic Fuzzy Sets" is being indexed in Scopus.
Please check our Instructions to Authors and send your manuscripts to nifs.journal@gmail.com. Next issue: September/October 2024.
Open Call for Papers: International Workshop on Intuitionistic Fuzzy Sets • 13 December 2024 • Banska Bystrica, Slovakia/ online (hybrid mode).
Deadline for submissions: 16 November 2024.

Issue:Intuitionistic fuzzy estimation of the ant colony optimization starting points: Part 2

From Ifigenia, the wiki for intuitionistic fuzzy sets and generalized nets
Jump to navigation Jump to search
shortcut
http://ifigenia.org/wiki/issue:nifs/17/2/75-81
Title of paper: Intuitionistic fuzzy estimation of the ant colony optimization starting points: Part 2
Author(s):
Stefka Fidanova
Institute of Information and Communication Technologies, Bulgarian Academy of Sciences, Acad. G. Bonchev Str., Bl. 25A, 1113 Sofia, Bulgaria
stefka@parallel.bas.bg
Pencho Marinov
Institute of Information and Communication Technologies, Bulgarian Academy of Sciences, Acad. G. Bonchev Str., Bl. 25A, 1113 Sofia, Bulgaria
pencho@parallel.bas.bg
Presented at: 15th ICIFS, Burgas, 11-12 May 2011
Published in: "Notes on Intuitionistic Fuzzy Sets", Volume 17 (2011) Number 2, pages 75—81
Download:  PDF (136  Kb, File info)
Abstract: 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 es Ant Colony Optimization (ACO). 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 estimation parameters is made. As a test problem is used Multidimensional (Multiple) Knapsack Problem (MKP).
Keywords: Ant colony optimization, Intuitionistic fuzzy sets, Knapsack problem.
AMS Classification: 03E72, 90C59, 68T20
References:
  1. Atanassov, K. Intuitionistic Fuzzy Sets, Springer, Heidelberg, 1999.
  2. Bonabeau, E., Dorigo M., Theraulaz G., Swarm Intelligence: From Natural to Artificial Systems, New York, Oxford University Press, 1999.
  3. Diffe, W., Hellman, M. E., New direction in cryptography. IEEE Trans Inf. Theory. IT-36, 1976, 644–654.
  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.
  5. Dorigo M., Stutzle T., Ant Colony Optimization, MIT Press, 2004.
  6. Fidanova S., Evolutionary Algorithm for Multiple Knapsack Problem, Int. Conference Parallel Problems Solving from Nature, RealWorld Optimization Using Evolutionary Computing, ISBN No 0-9543481-0-9,Granada, Spain, 2002.
  7. Fidanova, S., Ant colony optimization and multiple knapsack problem, in: Renard, J.Ph. (Eds.), Handbook of Research on Nature Inspired Computing for Economics ad Management, Idea Grup Inc., ISBN 1-59140-984-5, 2006, 498–509.
  8. Fidanova S., Atanassov K., Marinov P., Parvathi R., Ant Colony Optimization for Multiple Knapsack Problems with Controlled Starts, Int. J. Bioautomation, Vol 13(4), 271–280.
  9. Fidanova S., Atanassov K., Marinov P., Parvathi R.,Intuitionistic Fuzzy Estimation of the Ant Colony Optimization Starting Points: Part 2, Large Scale sciantific Computing, Lecture Notes in Computer Science (in press).
  10. Martello, S., Toth, P., A mixtures of dynamic programming and branch-and-bound for the subset-sum problem, Management Science 30, 1984, 756–771.
  11. 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, 2004, 1–10.
  12. Sinha, A., Zoltner, A. A., The multiple-choice knapsack problem, J. Operational Research 27, 1979, 503–515.
  13. Stutzle T. Dorigo M., ACO Algorithm for the Traveling Salesman Problem, In K. Miettinen, M. Makela, P. Neittaanmaki, J. Periaux eds., Evolutionary Algorithms in Engineering and Computer Science, Wiley, 163–183, 1999.
  14. Stutzle T. and Hoos H. H.: MAX-MIN Ant System, In Dorigo M., Stutzle T., Di Caro G. (eds). Future Generation Computer Systems, Vol 16, 2000, 889–914.
  15. Zhang T.,Wang S., TianW., Zhang Y., ACO-VRPTWRV: A New Algorithm for the Vehicle Routing Problems with Time Windows and Re-used Vehicles based on Ant Colony Optimization, Sixth International Conference on Intelligent Systems Design and Applications, IEEE press, 2006, 390–395.
Citations:

The list of publications, citing this article may be empty or incomplete. If you can provide relevant data, please, write on the talk page.

Retrieved from "https://ifigenia.org/index.php?title=Issue:Intuitionistic_fuzzy_estimation_of_the_ant_colony_optimization_starting_points:_Part_2&oldid=12985"