The Markov model of shuffled frog leaping algorithm and its convergence analysis

Tien Tzu Hsueh Pao/Acta Electronica Sinica

Volumn 38, Issue 12, 2010, Pages 2875-2880

  Luo, Jian Ping ^a   Li, Xia ^a   Chen, Min Rong ^a  

^a SHENZHEN UNIVERSITY   (China)

Author keywords

Global convergence; Intelligent optimization; Markov chain; Shuffled frog leaping algorithm

Indexed keywords

CONVERGENCE ANALYSIS; GLOBAL CONVERGENCE; INTELLIGENT OPTIMIZATION; MARKOV CHAIN; MARKOV CHAIN MODELS; MARKOV MODEL; MEMEPLEX; OPTIMAL STATE; RANDOM SEARCH ALGORITHM; SHUFFLED FROG-LEAPING ALGORITHMS; STATE SEQUENCES; TRANSITION PROCESS;

ALGORITHMS; MARKOV PROCESSES; OPTIMIZATION;

CONVERGENCE OF NUMERICAL METHODS;

EID: 79952476160     PISSN: 03722112     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (16)

1. Duan Q, Sorooshian S, Gupta V. Effective and efficient global optimization for conceptual rainfall-runoff models[J]. Water Resource Research, 1992, 28(4): 1015-1031.
2. Eusuff M M, Lansey K E. Optimization of water distribution network design using the shuffled frog leaping algorithm[J]. Journal of Water Sources Planning and Management, 2003, 129(3): 210-225.
3. Eusuff M M, Lansey K E, Pasha F. Shuffled frog-leaping algorithm: a memetic meta-heuristic for discrete optimization[J]. Engineering Optimization, 2006, 38(2): 129-154.
4. Hatem E, Emad E, Tarek H, Khaled S. Comparison of two evolutionary algorithms for optimization of bridge deck repairs[J]. Computer-Aided Civil and Infrastructure Engineering, 2006, 21: 561-57.
5. Huynh T H. A modified shuffled frog leaping algorithm for optimal tuning of multivariable PID controllers[A]. International Conference on Information Technology[C]. Singapore: IEEE Press, 2008. 128-134.
6. Alireza R V. A hybrid multi-objective shuffled frog-leaping algorithm for a mixed-model assembly line sequencing problem[J]. Computers & Industrial Engineering, 2007, 53: 642-666.
7. SUN Xia, WANG Zi-qiang. A web document classification method based on shuffled frog leaping algorithm[A]. Second International Conference on Genetic and Evolutionary Computing[C]. Jingzhou, Hubei, China: IEEE Press, 2008. 205-208.
8. LUO Xue-hui, YANG Ye, LI Xia. A modified shuffled frog leaping algorithm for TSP[J]. Journal on Communications, 2009, 30(7): 130-135. (in Chinese)
9. LIU Feng, LIU Gui-zhong, ZHANG Zhuo-sheng. Markovian process analyses and convergence of evolutionary programming[J]. Acta Electronica Sinica, 1998, 26(8): 76-79. (in Chinese)
10. Gidas B. Nonstationary Markov chains and convergence of the annealing algorithms[J]. Statistics Physics, 1985, 39(12): 73-131.
11. SU Zhao-pin, JIANG Jian-guo, LIANG Chang-yong, ZHANG Guo-fu, XIA Na. An almost everywhere strong convergence proof for a class of ant colony algorithms[J]. Acta Electronica Sinica, 2009, 37(8): 1646-1650. (in Chinese)
12. ZHANG Wen-xiu, LIANG Yi. Mathematics foundations of genetic algorithm[M]. Xi'an: Press of Xi'an Jiaotong University, 2003. 67-87. (in Chinese)
13. Clere M, Kennedy J. The particle swarm: Explosion, stability, and convergence in a multi-dimensional complex space[J]. IEEE Transactions on Evolutionary Computation, 2002, 16(1): 58-73.
14. LI Ning. Analysis and application of particle swarm optimization[D]. Wuhan: Huazhong University of Science and Technology, 2006. (in Chinese)
15. Van D B, Engelbrecht A P. A study of particle swarm optimization particle trajectories[J]. Information Sciences, 2006, 176(8): 937-971.
16. Solis F, Wets R. Minimization by random search techniques[J]. Mathematics of Operations Research, 1981, 6: 19-30.