Modified inductive search and its covergence for solving global optimization problems

Abstract

Inductive Search for solving global optimization problems has attracted much attention because it showed the best performance at the First International Contest on Evolutionary Optimisation (1st ICEO). However, the details of this method are not clear. We therefore investigated the details of the method by analyzing codes, and we point out problems and notes of the method. In order to overcome the problems, we propose a modified inductive search by using a deterministic one-dimensional global search. Finally, we evaluate the performance among the original method, our implemented method and that of the proposed method.