|Table of Contents|

Improving Monkey-King Genetic Algorithm(PDF)

南京师范大学学报(工程技术版)[ISSN:1006-6977/CN:61-1281/TN]

Issue:
2004年03期
Page:
53-56
Research Field:
Publishing date:

Info

Title:
Improving Monkey-King Genetic Algorithm
Author(s):
LI Yuzhong 1 LIU Hongxing 1 ZHANG Shen 2
1.Department of Electronic Science and Engineering, Nanjing University, Nanjing 210093, China; 2.School of Physical Science and Technology, Nanjing Normal University, Nanjing 210097, China
Keywords:
genetic algorithm evolutionary computation evolutionary algorithms Monkey-King
PACS:
TP18
DOI:
-
Abstract:
Monkey-King Genetic Algorithm is a novel genetic algorithm , and the original research has revealed its some advan tages and potentials. Some aspects to be improved for Monkey-King Genetic Algorithm are : a number of running parameters are inconvenient to be determined by users ,and there is no local searching operator in the area of surrounding the Monkey-King point , so lacking the whole searching ability. Aiming to these two problems , the Monkey-King Genetic Algorithm is improved in this paper. The innovation includes two aspects : one is to enlarge the proportion of the introduced random individuals , thus re ducing the original running parameters , and another is to add a new local searching operator ———Monkey-King up-climbing op erator in the algorithm. A lot of testing experiments show that the improved Monkey-King genetic algorithm is good and satisfac tory.

References:

[1 ] 郭晨海,谢俊,刘军,等. 连续非线性规划的猴王遗传算法[J ] . 江苏大学学报(自然科学版) ,2002 ,23 (4) :87- 90.
[2 ] Wolpert D H , Macready W G. No Free lunch theorems for optimization[J ] . IEEE Transactions on Evolutionary Compu tation , 1997 ,1 (2) :62- 87.
[3 ] Kazarlis S A , Papadakis S E , Theocharis J B , et al . Micro genetic Algorithms as Generalized Hill2Climbing Operators for GA Optimization [ J ] . IEEE Transactions on Evolutionary Computation , 2001 ,5 (3) :204- 217.
[4 ] 周明,孙树栋. 遗传算法原理及应用[M] . 北京:国防工业出版社,1999. 125- 128.

Memo

Memo:
-
Last Update: 2013-04-29