Application of ACO in continuous domain

Authors:
Min Kong;Peng Tian
Affiliations:
Shanghai Jiaotong University, Shanghai, China;Shanghai Jiaotong University, Shanghai, China
Venue:
ICNC'06 Proceedings of the Second international conference on Advances in Natural Computation - Volume Part II
Year:
2006

Citing 9
Cited 3

Swarm intelligence: from natural to artificial systems

Swarm intelligence: from natural to artificial systems
MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows

New ideas in optimization
On how pachycondyla apicalis ants suggest a new search algorithm

Future Generation Computer Systems
A New Ant Colony Algorithm Using the Heterarchical Concept Aimed at Optimization of Multiminima Continuous Functions

ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
The Ant Colony Metaphor for Searching Continuous Design Spaces

Selected Papers from AISB Workshop on Evolutionary Computing
Ant Colony Optimization

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
The hyper-cube framework for ant colony optimization

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

A comparative study of optimization algorithms for low NOx combustion modification at a coal-fired utility boiler

Expert Systems with Applications: An International Journal
Extended ant colony optimization for non-convex mixed integer nonlinear programming

Computers and Operations Research
Robot routing in sparse wireless sensor networks with continuous ant colony optimization

Proceedings of the 13th annual conference companion on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Ant Colony Optimization has gained great success in applications to combinatorial optimization problems, but few of them are proposed in the continuous domain. This paper proposes an ant algorithm, called Direct Ant Colony Optimization (DACO), for the function optimization problem in continuous domain. In DACO, artificial ants generate solutions according to a set of normal distribution, of which the characteristics are represented by pheromone modified by ants according to the previous search experience. Experimental results show the advantage of DACO over other ACO based algorithms for the function optimization problems of different characteristics.