Automatically Modeling Hybrid Evolutionary Algorithms from Past Executions
The selection of the most appropriate Evolutionary Algorithm for a given optimization problem is a difficult task. Hybrid Evolutionary Algorithms are a promising alternative to deal with this problem. By means of the combination of different heuristic optimization approaches, it is possible to profit from the benefits of the best approach, avoiding the limitations of the others. Nowadays, there is an active research in the design of dynamic or adaptive hybrid algorithms. However, little research has been done in the automatic learning of the best hybridization strategy. This paper proposes a mechanism to learn a strategy based on the analysis of the results from past executions. The proposed algorithm has been evaluated on a well-known benchmark on continuous optimization. The obtained results suggest that the proposed approach is able to learn very promising hybridization strategies.
Unable to display preview. Download preview PDF.
- 1.Caponio, A., Neri, F., Tirronen, V.: Super-fit control adaptation in memetic differential evolution frameworks. Soft Computing - A Fusion of Foundations, Methodologies and Applications 13(8), 811–831 (2009)Google Scholar
- 4.Lampinen, J., Zelinka, I.: On stagnation of the differential evolution algorithm. In: Proc. of Mendel 2000, pp. 76–83 (2000)Google Scholar
- 5.Muelas, S., LaTorre, A., Peña, J.M.: A memetic differential evolution algorithm for continuous optimization. In: Proc. of ISDA 2009 (November 2009)Google Scholar
- 8.Tang, K., Yao, X., Suganthan, P., MacNish, C., Chen, Y., Chen, C., Yang, Z.: Benchmark functions for the cec 2008 special session and competition on large scale global optimization. Technical report, USTC (2007)Google Scholar
- 11.Tseng, L., Chen, C.: Multiple trajectory search for large scale global optimization. In: Proc. of IEEE CEC 2008, June 2008, pp. 3052–3059 (2008)Google Scholar