제어로봇시스템학회:학술대회논문집
- 제어로봇시스템학회 2004년도 ICCAS
- /
- Pages.857-862
- /
- 2004
A Study for Global Optimization Using Dynamic Encoding Algorithm for Searches
- Kim, Nam-Geun (Division of Electrical and Computer Engineering, POSTECH) ;
- Kim, Jong-Wook (Division of Electrical and Computer Engineering, POSTECH) ;
- Kim, Sang-Woo (Division of Electrical and Computer Engineering, POSTECH)
- 발행 : 2004.08.25
초록
This paper analyzes properties of the recently developed nonlinear optimization method, Dynamic Encoding Algorithm for Searches (DEAS) [1]. DEAS locates local minima with binary strings (or binary matrices for multi-dimensional problems) by iterating the two operators; bisectional search (BSS) and unidirectional search (UDS). BSS increases binary strings by one digit (i.e., zero or one), while UDS performs increment or decrement to binary strings with no change of string length. Owing to these search routines, DEAS retains the optimization capability that combines the special features of several conventional optimization methods. In this paper, a special feature of BSS and UDS in DEAS is analyzed. In addition, a effective global search strategy is established by using information of DEAS. Effectiveness of the proposed global search strategy is validated through the well-known benchmark functions.