文献类型：期刊文献

英文题名：Optimizing complex functions by chaos search

作者：Li, Bing[1]; Jiang, Weisun[1]

机构：[1]Tangshan Univ, Automat Dept, Tangshan 063000, Peoples R China;[2]E China Univ Sci & Technol, Res Inst Automat Control, Shanghai 200237, Peoples R China

年份：1998

卷号：29

期号：4

起止页码：409

外文期刊名：CYBERNETICS AND SYSTEMS

收录：;EI(收录号：1998454374942);WOS:【SCI-EXPANDED(收录号:WOS:000073761900006)】；

语种：英文

外文关键词：Algorithms - Problem solving - Simulated annealing

摘要：During past decades, the role of optimization has steadily increased in many fields. It is a hot problem in research on control theory. In practice, optimization problems become more and more complex. Traditional algorithms cannot solve them satisfactorily. Either they are trapped to local minima or they need much more search time. Chaos often exists in nonlinear systems. It has many good properties such as ergodicity, stochastic properties, and "regularity." A chaotic motion can go nonrepeatedly through every state in a certain domain. By use of these properties of chaos, an effective optimization method is proposed: the chaos optimization algorithm (COA). With chaos search, some complex optimization problems are solved very well. The test results illustrate that the efficiency of COA is much higher than that of some stochastic algorithms such as the simulated annealing algorithm (SAA) and chemotaxis algorithm (CA), which are often used to optimize complex problems. The chaos optimization method provides a new and efficient way to optimize kinds of complex problems with continuous variables.