Ant algorithms for discrete optimization
Artificial Life
On how pachycondyla apicalis ants suggest a new search algorithm
Future Generation Computer Systems
The Ant Colony Metaphor for Searching Continuous Design Spaces
Selected Papers from AISB Workshop on Evolutionary Computing
Continuous interacting ant colony algorithm based on dense heterarchy
Future Generation Computer Systems - Special issue: Computational chemistry and molecular dynamics
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
Data mining with an ant colony optimization algorithm
IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Ant colony optimization for routing and load-balancing: survey and new directions
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
A clustering-based adaptive parameter control method for continuous ant colony optimization
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Self-adaptive ant colony system for the traveling salesman problem
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Advances in Engineering Software
Optimization of magnetic field assisted EDM using the continuous ACO algorithm
Applied Soft Computing
Hi-index | 0.00 |
A hybrid Orthogonal Scheme Ant Colony Optimization (OSACO) algorithm for continuous function optimization (CFO) is presented in this paper. The methodology integrates the advantages of Ant Colony Optimization (ACO) and Orthogonal Design Scheme (ODS). OSACO is based on the following principles: a) each independent variable space (IVS) of CFO is dispersed into a number of random and movable nodes; b) the carriers of pheromone of ACO are shifted to the nodes; c) solution path can be obtained by choosing one appropriate node from each IVS by ant; d) with the ODS, the best solved path is further improved. The proposed algorithm has been successfully applied to 10 benchmark test functions. The performance and a comparison with CACO and FEP have been studied.