MOEAs Based on Dynamic Chaotic Mutation

Article Preview

Abstract:

In reality, there are varieties of practical problems which are all optimizing many objectives at the same time. Meanwhile, these problems are usually highly complex, which are called multi-objective optimization problem. Multi-Objective Evolutionary Algorithms, shorted as MOEAs, is very suitable for solving this kind of problem. Chaos is defined as a random phenomenon with a sensitive dependence on initial conditions, which is produced by deterministic system. It covers almost each branch of both natural science and social science. The main work of this paper is to analyze and make conclusion about the dynamic chaotic mutation and MOEAs. Based on it, this paper proves the convergence of dynamic chaos multi-objective optimization, and proposes MOEAs based on dynamic chaotic mutation.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 1049-1050)

Pages:

1427-1430

Citation:

Online since:

October 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Zhang Chungai, Xu Liyun & Shao Huihe. Improvement of chaos optimization and its application in nonlinear constraint optimization problems. Journal of Shanghai Jiaotong University, 2000, 34(5): 593-595.

Google Scholar

[2] Luo Chenzhong & Shao Huihe. With chaotic search to solve nonlinear constraint optimization problems. System Engineering Theory and Practice, 2000, 20(8): 54-57.

Google Scholar

[3] Liu M.M. Power System Technology[c],Proceeding of international Conference . ,2002: 793一797.

Google Scholar

[4] Shan Liang, Qiang Hao, Li Jun & Wang Zhishuan. Chaos optimization algorithm based on Tent chaotic mapping. Control and Decision, 2005, 20(2): 179-182.

Google Scholar

[5] C.C. Zhou,T. Hen. Chaotieannealingforoptization[J]. PhysiealReview,1997,55(3): 2580-2587.

Google Scholar

[6] H. G Beyer. The theory of evolution strategies[J]. Natural computing series. Springer, Heidelberg, (2001).

Google Scholar