期刊
IEEE TRANSACTIONS ON CYBERNETICS
卷 47, 期 1, 页码 2-13出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TCYB.2015.2512286
关键词
Convergence analysis; evolutionary algorithm (EA); I-Ching divination EA (IDEA); I-Ching operators (ICOs); Markov chain
类别
资金
- National Natural Science Foundation of China [61572540]
- Macau Science and Technology Development Fund [008/2010/A1, 017/2012/A1]
- Multiyear Research Grants
An innovative simulated evolutionary algorithm (EA), called I-Ching divination EA (IDEA), and its convergence analysis are proposed and investigated in this paper. Inherited from ancient Chinese culture, I-Ching divination has always been used as a divination system in traditional and modern China. There are three operators evolved from I-Ching transformations in this new optimization algorithm, intrication operator, turnover operator, and mutual operator. These new operators are very flexible in the evolution procedure. Additionally, two new spaces are defined in this paper, which are denoted as hexagram space and state space. In order to analyze the convergence property of I-Ching divination algorithm, Markov model was adopted to analyze the characters of the operators. Meanwhile, the proposed algorithm is proved to be a homogeneous Markov chain with the positive transition matrix. After giving some basic concepts of necessary theorems, definition of admissible functions and I-Ching map, a precise proof of the states converge to the global optimum is presented. Compared with the genetic algorithm, particle swarm optimization, and differential evolution algorithm, our proposed IDEA is much faster in reaching the global optimum.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据