An Orthogonal Search Embedded Ant Colony Optimization Approach to Continuous Function Optimization
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.
KeywordsOrthogonal Array Elitist Strategy Orthogonal Experimental Design Function Optimization Problem Future Generation Computer System
Unable to display preview. Download preview PDF.
- 6.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
- 15.Elberhart, R.C., Kennedy, J.: A new optimizer using particle swarm theory. In: Proc. 6th Int. Symp. Micromachine Human Sci., Nagoya, Japan, pp. 39–43 (1995)Google Scholar