| 초록 |
A new global optimization algorithm is proposed for unconstrained problems which uses a local optimization algorithm. Robust algorithm for local optimization are well-developed and readily available for use. Therefore we take a advantage of it. But using local optimization algorithm itself, we may be trapped in a local optimum solution. So we need a escape phase. We can escape the local optimum point by this phase. The proposed algorithm is composed of two phases, local optimization phase and escape phase. Three examples are shown and solved by the proposed algorithm.
|
