The Expected First Hitting Time of a class of Evolutionary Algorithms

2011 ◽  
Vol 3 (6) ◽  
pp. 160-168
Author(s):  
Xin Du ◽  
Youcong Ni ◽  
Ruliang Xiao ◽  
Huang Faliang
Keyword(s):  
Evolutionary Algorithms ◽  
Hitting Time ◽  
First Hitting Time

First hitting time analysis of continuous evolutionary algorithms based on average gain

2016 ◽  
Vol 19 (3) ◽  
pp. 1323-1332 ◽  
Author(s):  
Zhang Yushan ◽  
Huang Han ◽  
Hao Zhifeng ◽  
Hu Guiwu
Keyword(s):  
Evolutionary Algorithms ◽  
Hitting Time ◽  
First Hitting Time ◽  
Time Analysis ◽  
Average Gain

scholarly journals Randomization in the first hitting time problem

2009 ◽  
Vol 79 (23) ◽  
pp. 2422-2428 ◽  
Author(s):  
Ken Jackson ◽  
Alexander Kreinin ◽  
Wanhe Zhang
Keyword(s):  
Hitting Time ◽  
First Hitting Time ◽  
Time Problem

The Study on Convergence and Convergence Rate of Genetic Algorithm Based on an Absorbing Markov Chain

2012 ◽  
Vol 239-240 ◽  
pp. 1511-1515 ◽  
Author(s):  
Jing Jiang ◽  
Li Dong Meng ◽  
Xiu Mei Xu
Keyword(s):  
Genetic Algorithm ◽  
Markov Chain ◽  
Convergence Rate ◽  
Hitting Time ◽  
Sufficient Condition ◽  
First Hitting Time ◽  
Absorbing Markov Chain ◽  
Expected Hitting Time ◽  
Optimization Efficiency ◽  
Theoretical Issues

The study on convergence of GA is always one of the most important theoretical issues. This paper analyses the sufficient condition which guarantees the convergence of GA. Via analyzing the convergence rate of GA, the average computational complexity can be implied and the optimization efficiency of GA can be judged. This paper proposes the approach to calculating the first expected hitting time and analyzes the bounds of the first hitting time of concrete GA using the proposed approach.

Sign in / Sign up

Export Citation Format

Share Document