I-Ching Divination Evolutionary Algorithm and its Convergence Analysis

doi:10.1109/TCYB.2015.2512286

Return

I-Ching Divination Evolutionary Algorithm and its Convergence Analysis

2017-01-01

100

PRE

陈晨 (C. L. Philip Chen) *

Tong Zhang

陈龙 (Long Chen)

S. C. Tam

DOI：10.1109/TCYB.2015.2512286

Original

Original request for help

Save

Abstract

En 中文

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.

Keywords:

Convergence analysis

evolutionary algorithm (EA)

I-Ching divination EA (IDEA)

I-Ching operators (ICOs)

Markov chain

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.