Stochastic Global Optimization: Problem Classes and Solution Techniques

  • Authors:

  • A. Törn;M. M. Ali;S. Viitanen

  • Affiliations:

  • Department of Computer Science, Åbo Akademi University, Datacity, 20520 Åbo, Finland (e-mail: atorn@abo.fi);Centre for Control Theory and Optimization, Department of Computational & Applied Mathematics, The University of Witwatersrand, Johannesburg, Republic of South Africa;Department of Computer Science, Åbo Akademi University, Datacity, 20520 Åbo, Finland

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

Quantified Score

Hi-index 0.00

Visualization

Abstract

There is a lack of a representative set of test problems for comparing global optimization methods. To remedy this a classification of essentially unconstrained global optimization problems into unimodal, easy, moderately difficult, and difficult problems is proposed. The problem features giving this classification are the chance to miss the region of attraction of the global minimum, embeddedness of the global minimum, and the number of minimizers. The classification of some often used test problems are given and it is recognized that most of them are easy and some even unimodal. Global optimization solution techniques treated are global, local, and adaptive search and their use for tackling different classes of problems is discussed. The problem of fair comparison of methods is then adressed. Further possible components of a general global optimization tool based on the problem classes and solution techniques is presented.