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

Jing Jiang; Li Dong Meng; Xiu Mei Xu

doi:10.4028/www.scientific.net/AMM.239-240.1511

Paper Titles

The Realization of Smoothed Pseudo Wigner-Ville Distribution Based on LabVIEW
p.1493

Grid Task Scheduling Algorithm Based on Non-Conflict Degree
p.1497

A Joint Energy Consumption Optimization Algorithm for Hybrid Air-Cushion Vehicles
p.1501

A Novel Grid Phase Estimating Algorithm Based on BP Neutral Network
p.1507

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

Fuzzy-Neural Networks Based on Subtractive Clustering and its Applications in Soft Sensor
p.1516

A Determinant Elimination Method for Bottleneck Assignment and Generalized Assignment Problems
p.1522

An Improved Quantum-Inspired Evolutionary Algorithm Based on P Systems with a Dynamic Membrane Structure for Knapsack Problems
p.1528

Classification of Chinese Herbal Medicine Based on Improved LDA Algorithm Using Machine Olfaction
p.1532

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 239-240The Study on Convergence and Convergence Rate of...

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

Abstract:

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.

You might also be interested in these eBooks

Measurement Technology and its Application

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 239-240)

Pages:

1511-1515

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.239-240.1511

Citation:

Cite this paper

Online since:

December 2012

Authors:

Jing Jiang, Li Dong Meng, Xiu Mei Xu

Keywords:

Convergence, Convergence Rate, Genetic Algorithm (GA), Markov Chain

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] He Shuyuan. Stochastic Process[M]. The Peking University Press,(2008)

Google Scholar

[2] Wang Liyan, Shen Yubo, Liu Hong. Stochastic Process[M]. The Dalian University of Technology Press,(2008)

Google Scholar

[3] Yu Y , Zhou Z H. A new approach to estimating the expected first hitting time of evolutionary algorithms.Proceedings of the 21st N ational Conference on Artificial Intelligence (AAAI 06). Boston, MA, California, USA, 2006: 555-572

DOI: 10.1016/j.artint.2008.07.001

Google Scholar

[4] Huang Han, Hao Zhifeng. Convergence rate of ant colony algorithm[J].Chinese Journal of Computers, 20O7, 30(8): 1344-1353.

Google Scholar

[5] Li Junhua, Li Ming. An analysis on convergence and convergence rate estimate of GA in noisy environments[J]. Chinese Journal of Electronics, 2011, 39(8): 1898-1902.

Google Scholar

[6] Lu wei,Huang Tianmin. An intuitive explanation of convergence of GA[J]. Journal of Mianyang Teachers College, 2002, 21(2): 22-23

Google Scholar

[7] Li Minqiang, Kou Jisong, Lin dan. Basic theories and applications of genetic algorithm[M]. Beijing: Science Press,(2002)

Google Scholar

[8] T Nakama. Theoretical analysis of genetic algorithms in noisy environments based on a Markov model[A]. Proceedings of the 2008 Genetic and Evolutionary Computation Conference. Atlanta, Georgia, USA: ACM, 2008,1001-1008.

DOI: 10.1145/1389095.1389283

Google Scholar