TY - GEN

T1 - Efficiently minimizing expensive cost functions with a hybrid evolutionary algorithm using clustering and a derivative-free optimizer

T2 - 2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005

AU - Tenne, Yoel

AU - Armfield, S. W.

PY - 2005

Y1 - 2005

N2 - A novel hybrid algorithm is presented to efficiently locate the global minimum of a function where each function evaluation is expensive and no expression is available for the function nor its derivatives. The hybrid employs an evolutionary algorithm, a density cluster analysis algorithm and a derivate-free optimizer in a multi-level hierarchical structure. The hybrid algorithm utilizes information generated during the minimization to reduce the number of function evaluations and to improve its domain exploration. The hybrid was compared to an evolutionary algorithm and to a multi-start derivative-free optimizer since both are candidate algorithms to handle this global minimization problem. The algorithms were tested using a small and a large domain. Test results showed that while the evolutionary algorithm did not progress much after an initial phase the hybrid maintained a high rate of minimization throughout and accordingly provided a final result which was on average ο(10 6) more accurate for the small domain and ο(108) more accurate for the large domain. Furthermore, the number of function evaluations required by the multi-start derivative-free optimizer was affected by the initial random population and accordingly by an increase in the domain size. In contrast the hybrid was not affected since it employed the explorative evolutionary algorithm phase and thus was able to locate better starting nodes in a larger domain.

AB - A novel hybrid algorithm is presented to efficiently locate the global minimum of a function where each function evaluation is expensive and no expression is available for the function nor its derivatives. The hybrid employs an evolutionary algorithm, a density cluster analysis algorithm and a derivate-free optimizer in a multi-level hierarchical structure. The hybrid algorithm utilizes information generated during the minimization to reduce the number of function evaluations and to improve its domain exploration. The hybrid was compared to an evolutionary algorithm and to a multi-start derivative-free optimizer since both are candidate algorithms to handle this global minimization problem. The algorithms were tested using a small and a large domain. Test results showed that while the evolutionary algorithm did not progress much after an initial phase the hybrid maintained a high rate of minimization throughout and accordingly provided a final result which was on average ο(10 6) more accurate for the small domain and ο(108) more accurate for the large domain. Furthermore, the number of function evaluations required by the multi-start derivative-free optimizer was affected by the initial random population and accordingly by an increase in the domain size. In contrast the hybrid was not affected since it employed the explorative evolutionary algorithm phase and thus was able to locate better starting nodes in a larger domain.

UR - http://www.scopus.com/inward/record.url?scp=27144447981&partnerID=8YFLogxK

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:27144447981

SN - 0780393635

T3 - 2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005. Proceedings

SP - 1937

EP - 1944

BT - 2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005. Proceedings

Y2 - 2 September 2005 through 5 September 2005

ER -