A Study on Search Method considering Search Difficulty of Objective Functions

Abstract

In recent years, evolutionary computations have been actively applied to engineering applications. In these real engineering problems, the characteristics of objective functions are different one another, which causes the differences of search difficulty among objective functions. As the result, while the optimization of the objective functions with low search difficulty progresses, that with high search difficulty does not proceed. Therefore, there is a possibility that the search is biased. In the real problem, the objective functions should be optimized equally. In this paper, we propose a method to distribute the search resources in preference to high difficulty objective functions based on their search difficulties, and we study the performance of the proposed method using a benchmark problem.