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
Ant Colony Optimization
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
Hi-index | 0.00 |
Ant colony optimization has been one of the most promising meta-heuristics since its appearance in early 1990s but it is specialized in discrete space optimization problems. To explore the utility of ACO in the filed of continuous problems, this paper proposes an orthogonal search embedded ACO (OSEACO) algorithm. By generating some grids in the search space and embedding an orthogonal search scheme into ACO, the search space is learned much more comprehensively with only few computation efforts consumed. Hence, solutions are obtained in higher precision. Some adaptive strategies are also developed to prevent the algorithm from trapping in local optima as well as to improve its performance. Moreover, the effectiveness of this algorithm is demonstrated by experimental results on 9 diverse test functions for it is able to obtain near-optimal solutions in all cases.