GENERALIZED NET MODELS OF THE PROCESS OF ANT COLONY OPTIMIZATION WITH DIFFERENT STRATEGIES AND INTUITIONISTIC FUZZY ESTIMATIONS
1
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
Ant Colony Optimization has been used successfully to solve hard combinatorial optimization problems. This metaheuristic 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 and on each iteration intuitionistic fuzzy estimations (see [2]) are made of the start nodes of the ants. Several start strategies are prepared and combined.
Abstract
Ant Colony Optimization has been used successfully to solve hard combinatorial optimization problems. This metaheuristic 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 and on each iteration intuitionistic fuzzy estimations (see [2]) are made of the start nodes of the ants. Several start strategies are prepared and combined.
참고문헌 (10)
- Atanassov K., "Generalized Nets" (1991), World Scientific, Singapore
- Atanassov, K., "Intuitionistic Fuzzy Sets" (1999), Springer
- Atanassov, K., "On Generalized Nets Theory" (2007), Prof. M. Drinov Publishing House
- Dorigo M., "Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem", IEEE Transactions on Evolutionary Computation, 1, pp.53~66 (1997)
- Fidanova S., "Evolutionary Algorithm for Multiple Knapsack Problem", Int. Conference Parallel Problems Solving from Nature, Real World Optimization Using Evolutionary Computing (2002)
- Fidanova S., , Issues on Intuitionistic Fuzzy Sets and Generalized Nets, 통권 : 7 (2008)
- Lessing L., "Comparison Between ACO Algorithms for the Set Covering Problem", ANTS Workshop 2004, pp.12~ (2004)
- Reiman M., "A Hybrid ACO algorithm for the Capacitated Minimum Spanning Tree Problem", In proc. of First Int. Workshop on Hybrid Metahuristics, pp.1~10 (2004)
- Stutzle T., "ACO Algorithm for the Traveling Salesman Problem. in: Evolutionary Algorithms in Engineering and Computer Science", pp.163~183 (1999), Wiley
- Zhang T., "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, pp.390~395 (2006), IEEE press