期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 148, 期 2, 页码 335-348出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/S0377-2217(02)00401-0
关键词
genetic algorithm; simplex search; global optimization; continuous variables; multiminima functions
A hybrid method combining two algorithms is proposed for the global optimization of multiminima functions. To localize a promising area, likely to contain a global minimum, it is necessary to well explore the whole search domain. When a promising area is detected, the appropriate tools must be used to exploit this area and obtain the optimum as accurately and quickly as possible. Both tasks are hardly performed through only one method. We propose an algorithm using two processes, each one devoted to one task. Global metaheuristics, such as simulated annealing, tabu search, and genetic algorithms (GAs) are efficient to localize the best areas. On the other hand, local search methods are classically available: in particular the hill climbing (e.g. the quasi-Newton method), and the Nelder-Mead simplex search (SS). Therefore we worked out an hybrid method, called continuous hybrid algorithm (CHA), performing the exploration with a GA, and the exploitation with a Nelder-Mead SS. To evaluate the efficiency of CHA, we implemented a set of benchmark functions, and compared our results to the ones supplied by other competitive methods. (C) 2002 Elsevier Science B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据