A Generator for Multimodal Test Functions with Multiple Global Optima
The topic of multimodal function optimization, where the aim is to locate more than one solution, has attracted a growing interest especially in the evolutionary computing research community. To experimentally evaluate the strengths and weaknesses of multimodal optimization algorithms, it is important to use test functions representing different characteristics and of various levels of difficulty. However, the available selection of multimodal test problems with multiple global optima is rather limited at the moment and no general framework exists. This paper describes our attempt in constructing a test function generator to allow the generation of easily tunable test functions. The aim is to provide a general and easily expandable environment for testing different methods of multimodal optimization. Several function families with different characteristics are included. The generator implements new parameterizable function families for generating desired landscapes and a selection of well known test functions from literature, which can be rotated and stretched. The module can be easily imported to any optimization algorithm implementation compatible with C programming language.
KeywordsMultimodal optimization test function generator global optimization
Unable to display preview. Download preview PDF.
- 1.Mahfoud, S.: A comparison of parallel and sequential niching methods. In: Proceedings of 6th International Conference on Genetic Algorithms, pp. 136–143 (1995)Google Scholar
- 2.De Jong, K.: An analysis of the behavior of a class of genetic adaptive systems. PhD thesis, University of Michigan (1975)Google Scholar
- 3.Goldberg, D., Richardson, J.: Genetic algorithms with sharing for multimodal function optimization. In: Grefenstette, J. (ed.) Proc. of the Second International Conference on Genetic Algorithms, pp. 41–49 (1987)Google Scholar
- 4.Mahfoud, S.: Niching methods for genetic algorithms. PhD thesis, Urbana, IL, USA (1995)Google Scholar
- 6.Harik, G.: Finding multimodal solutions using restricted tournament selection. In: Eshelman, L. (ed.) Proc. of the Sixth International Conference on Genetic Algorithms, pp. 24–31. Morgan Kaufmann, San Francisco (1995)Google Scholar
- 7.Pétrowski, A.: A clearing procedure as a niching method for genetic algorithms. In: Proc. of the 3rd IEEE International Conference on Evolutionary Computation, pp. 798–803 (1996)Google Scholar
- 9.Wolpert, D., Macready, W., William, G.: No free lunch theorems for search. Technical report, The Santa Fe Institute (1995)Google Scholar
- 10.Morrison, R., Jong, K.D.: A test problem generator for nonstationary evironments. In: Proceedings of the Congress of Evolutionary Computation, Piscataway, NJ, pp. 1843–1850. IEEE Press, Los Alamitos (1999)Google Scholar
- 16.Singh, G., Deb, K.: Comparison of multi-modal optimization algorithms based on evolutionary algorithms. In: Proceedings of the Genetic and Evolutionary Computation Conference, Seattle, WA, pp. 1305–1312. ACM Press, New York (2006)Google Scholar
- 21.Ursem, R.: Multinational evolutionary algorithms. In: Proceedings of Congress of Evolutionary Computation (CEC 1999), vol. 3. IEEE Press, Los Alamitos (1999)Google Scholar