Unidimensional Search for Solving Continuous High-Dimensional Optimization Problems

This paper presents a performance study of two versions of a unidimensional search algorithm aimed at solving high-dimensional optimization problems. The algorithms were tested on 11 scalable benchmark problems. The aim is to observe how metaheuristics for continuous optimization problems respond with increasing dimension. To this end, we report the algorithms’ performance on the 50, 100, 200 and 500-dimension versions of each function. Computational results are given along with convergence graphs to provide comparisons with other algorithms during the conference and afterwards.

[1]  John A. Nelder,et al.  A Simplex Method for Function Minimization , 1965, Comput. J..

[2]  L. Darrell Whitley,et al.  Test driving three 1995 genetic algorithms: New test functions and geometric matching , 1995, J. Heuristics.

[3]  Janez Brest,et al.  High-dimensional real-parameter optimization using Self-Adaptive Differential Evolution algorithm with population size reduction , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[4]  Ponnuthurai Nagaratnam Suganthan,et al.  Benchmark Functions for the CEC'2013 Special Session and Competition on Large-Scale Global Optimization , 2008 .

[5]  Bin Li,et al.  A restart univariate estimation of distribution algorithm: sampling under mixed Gaussian and Lévy probability distribution , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[6]  Chun Chen,et al.  Multiple trajectory search for Large Scale Global Optimization , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[7]  Fred W. Glover,et al.  Principles of scatter search , 2006, Eur. J. Oper. Res..