Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
An Island Model Based Ant System with Lookahead for the Shortest Supersequence Problem
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Hybrid ant colony algorithms for path planning in sparse graphs
Soft Computing - A Fusion of Foundations, Methodologies and Applications
Parallel ant colony optimization for the traveling salesman problem
ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
The hyper-cube framework for ant colony optimization
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
AIKED'09 Proceedings of the 8th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases
SMO'09 Proceedings of the 9th WSEAS international conference on Simulation, modelling and optimization
A tool for comparing resource-constrained project scheduling problem algorithms
AIC'09 Proceedings of the 9th WSEAS international conference on Applied informatics and communications
WSEAS Transactions on Information Science and Applications
Ant colony optimization applied to minimum weight dominating set problem
ACMOS'10 Proceedings of the 12th WSEAS international conference on Automatic control, modelling & simulation
WSEAS Transactions on Computers
Swarm intelligence algorithms parameter tuning
AMERICAN-MATH'12/CEA'12 Proceedings of the 6th WSEAS international conference on Computer Engineering and Applications, and Proceedings of the 2012 American conference on Applied Mathematics
Hi-index | 0.00 |
This paper describes GRAF-ANT (Graphical Framework for Ant Colony Optimization), an object-oriented C# framework for developing ant colony systems that we have developed. While developing this framework, abstractions that are necessary for ant colony optimization algorithms were analyzed, as well as the features that their implementing classes should have. During creation of these classes, several problems were solved: implementation of individual ants and ant colonies, connection between visualization and problem spaces, creation of a multithread application in which multiple ant colonies can communicate, creation of a problem independent graphical user interface (GUI), establishing an opportunity for hybridization of ACO (Ant colony optimization). Effects of this hybridization to different variations of ant colony systems is analyzed. The use of the GRAF-ANT and its suitability is illustrated by few instances of the Traveling Salesman Problem (TSP). We also present a concept of escaping ACO stagnation in local optima, named suspicious path destruction, that is also a part of GRAF-ANT.