Application of ACO in Continuous Domain
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.
KeywordsAnt Colony Optimization Function Optimization Problem Continuous Domain
Unable to display preview. Download preview PDF.
- 1.Bilchev, G., Parmee, I.C.: The ant colony metaphor for searching continuous design spaces. In: Fogarty, T.C. (ed.) AISB-WS 1995. LNCS, vol. 993, pp. 25–39. Springer, Heidelberg (1995)Google Scholar
- 2.Bilchev, G., Parmee, I.C.: Constrained optimization with an ant colony search model. In: 2nd International Conference on Adaptive Computing in Engineering Design and Control, pp. 26–28. PEDC, University of Plymouth (1996)Google Scholar
- 6.Dorigo, M., Stutzle, T.: Ant Colony Optimization. MIT Press, Boston (2003)Google Scholar
- 9.Gambardella, L.M., Taillard, E.D., Agazzi, G.: Macs-vrptw: a multiple ant colony system for vehicle routing problems with time windows. In: Corne, D., Dorgo, M., Glover, F. (eds.) New Ideas in Optimization, pp. 63–76. McGraw-Hill Ltd., London (1999)Google Scholar
- 16.Yao, X.: Evolutionary Computation: Theory and Applications. World Scientific, Singapore (1999)Google Scholar