A novel metaheuristics approach for continuous global optimization

  • Authors:

  • Theodore B. Trafalis;Suat Kasap

  • Affiliations:

  • School of Industrial Engineering, University of Oklahoma, Norman, Oklahoma 73019, USACorresponding author. e-mail: ttrafalis@ ou.edu;School of Industrial Engineering, University of Oklahoma, Norman, Oklahoma 73019, USA e-mail: suat@ou.edu.

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

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper proposes a novel metaheuristics approach to find the global optimum of continuous global optimization problems with box constraints. This approach combines the characteristics of modern metaheuristics such as scatter search (SS), genetic algorithms (GAs), and tabu search (TS) and named as hybrid scatter genetic tabu (HSGT) search. The development of the HSGT search, parameter settings, experimentation, and efficiency of the HSGT search are discussed. The HSGT has been tested against a simulated annealing algorithm, a GA under the name GENOCOP, and a modified version of a hybrid scatter genetic (HSG) search by using 19 well known test functions. Applications to Neural Network training are also examined. From the computational results, the HSGT search proved to be quite effective in identifying the global optimum solution which makes the HSGT search a promising approach to solve the general nonlinear optimization problem.