Issue:Generalized net models of the process of ant colony optimization with intuitionistic fuzzy estimations

shortcut

http://ifigenia.org/wiki/issue:iwgn-2008-041-048

Title of paper: Generalized net models of the process of ant colony optimization with intuitionistic fuzzy estimations Author(s): Stefka Fidanova IPP — Bulgarian Academy of Sciences, Acad. G. Bonchev Str., Bl. 25A, Sofia-1113, Bulgaria stefka@parallel.bas.bg Krassimir Atanassov CLBME — Bulgarian Academy of Sciences, Acad. G. Bonchev Str., Bl. 105, Sofia-1113, Bulgaria krat@bas.bg Presented at: 9th IWGN, Sofia, 4 July 2008 Published in: Conference proceedings, pages 41—48 Download:  PDF (136  Kb, File info) Abstract: Ant Colony Optimization has been used successfully to solve hard combinatorial optimization problems. This meta heuristic method is inspired by the foraging behavior of ant colonies, which manage to establish the shortest routes to feeding sources and back. In this paper a generalized net model of the process of ant colony optimization is constructed. The present model is the first one on this theme and it will be a basis of next authors research. Keywords: Ant colony optimization, Generalized nets, Intuitionistic fuzzy sets References: Atanassov K., Generalized Nets, World Scientific, Singapore, New Jersey, London, 1991. Atanassov K., Intuitionistic Fuzzy Sets, Springer, Heidelberg, 1999. Atanassov K., On Generalized Nets Theory. Prof. M. Drinov Publishing House, Sofia, 2007. 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. Fidanova S., Evolutionary Algorithm for Multiple Knapsack Problem, Int. Conference Parallel Problems Solving from Nature, Real World Optimization Using Evolutionary Computing, ISBN 0-9543481-0-9,Granada, Spain, 2002. Fidanova S., K. Atanassov. Issues on Intuitionistic Fuzzy Sets and Generalized Nets, Vol 7, 2008 (in press). Lessing L., Dumitrescu I., Stutzle T. A Comparison Between ACO Algorithms for the Set Covering Problem. ANTS Workshop 2004, 1-12. 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. 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. 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, 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.