A Direct Application of Ant Colony Optimization to Function Optimization Problem in Continuous Domain
This paper proposes a direct application of Ant Colony Optimization to the function optimization problem in continuous domain. In the proposed algorithm, artificial ants construct solutions by selecting values for each variable randomly biased by a specific variable-related normal distribution, of which the mean and deviation values are represented by pheromone modified by ants according to the previous search experience. Some methods to avoid premature convergence, such as local search in different neighborhood structure, pheromone re-initialization and different solutions for pheromone intensification are incorporated into the proposed algorithm. Experimental setting of the parameters are presented, and the experimental results show the potential of the proposed algorithm in dealing with the function optimization problem of different characteristics.
KeywordsLocal Search Premature Convergence Continuous Domain Global Good Solution Function Optimization Problem
Unable to display preview. Download preview PDF.
- 3.Bilchev, G., Parmee, I.: 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
- 4.Bilchev, G., Parmee, I.: Constrained optimization with an ant colony search model. In: 2nd International Conference on Adaptive Computing in Engineering Design and Control, pp. 26–28 (1996)Google Scholar
- 14.Chelouah, R., Siarry, P.: Enhanced continuous tabu search. In: Voss, S., Martello, S., Osman, I., Roucairol, C. (eds.) Meta-heuristics: advances and trends in local search paradigms for optimization, ch. 4, pp. 49–61. Kluwer Academic Publishers, Dordrecht (1999)Google Scholar