A Numerical Evaluation of Several Stochastic Algorithms on Selected Continuous Global Optimization Test Problems

  • Authors:

  • M. Montaz Ali;Charoenchai Khompatraporn;Zelda B. Zabinsky

  • Affiliations:

  • School of Computational and Applied Mathematics, Witwatersrand University, Johannesburg, South Africa Wits-2050;Industrial Engineering, University of Washington, Seattle, USA 98195-2650;Industrial Engineering, University of Washington, Seattle, USA 98195-2650

  • Venue:
  • Journal of Global Optimization
  • Year:
  • 2005

Quantified Score

Hi-index 0.01

Visualization

Abstract

There is a need for a methodology to fairly compare and present evaluation study results of stochastic global optimization algorithms. This need raises two important questions of (i) an appropriate set of benchmark test problems that the algorithms may be tested upon and (ii) a methodology to compactly and completely present the results. To address the first question, we compiled a collection of test problems, some are better known than others. Although the compilation is not exhaustive, it provides an easily accessible collection of standard test problems for continuous global optimization. Five different stochastic global optimization algorithms have been tested on these problems and a performance profile plot based on the improvement of objective function values is constructed to investigate the macroscopic behavior of the algorithms. The paper also investigates the microscopic behavior of the algorithms through quartile sequential plots, and contrasts the information gained from these two kinds of plots. The effect of the length of run is explored by using three maximum numbers of function evaluations and it is shown to significantly impact the behavior of the algorithms.