提高变型标准遗传算法收敛速度的混合法及其推广

徐川育

徐川育. 提高变型标准遗传算法收敛速度的混合法及其推广[J]. 信息与控制, 1997, 26(4): 266-271.
引用本文: 徐川育. 提高变型标准遗传算法收敛速度的混合法及其推广[J]. 信息与控制, 1997, 26(4): 266-271.
XU Chuanyu. HYBRID APPROACH FOR RAISING CONVERGENCE RATE OF VARIANTS OF CANONICAL GENETIC ALGORITHMS AND ITS GENERALIZATION[J]. INFORMATION AND CONTROL, 1997, 26(4): 266-271.
Citation: XU Chuanyu. HYBRID APPROACH FOR RAISING CONVERGENCE RATE OF VARIANTS OF CANONICAL GENETIC ALGORITHMS AND ITS GENERALIZATION[J]. INFORMATION AND CONTROL, 1997, 26(4): 266-271.

提高变型标准遗传算法收敛速度的混合法及其推广

基金项目: 国家自然科学基金
详细信息
    作者简介:

    徐川育,男,52岁,副教授,工学博士.研究领域为发酵过程模型化和控制,进化算法.

HYBRID APPROACH FOR RAISING CONVERGENCE RATE OF VARIANTS OF CANONICAL GENETIC ALGORITHMS AND ITS GENERALIZATION

  • 摘要: 针对即使是全局收敛的变型标准遗传算法VCGA[1]有时也会发生收敛速度变慢的问题,提出了VCGA和最陡下降法相结合的混合法HVCSDA.该方法增强了VCGA在接近全局最优解时的微调能力.还将HVCSDA推广到一类修正的VCGA上.仿真实例表明了HVCSDA及其推广能有效地提高收敛速度.对30城市TSP的仿真结果为6.822,要好于用TABU得到的6.99的结果[6]
    Abstract: Aimed at the problem that VCGA with global conver gence so metimes slows the conver gence rate down,this paper suggests a hybrid approach called HVCSDA which can reinforces the capability of fine tunning of VCGA as it is near the global optimal solution. This paper also gener alizes HVCSDA in order to adapt for aclass of the modified VCGA. Two simulation examples show that HVCSDA and its gener alization can effectively raize the converg encerate of (aclass of modified)VCGA. In the second simulation example,the length of routing of 30 cities TSP is 6.882,it is better than one that is 6.99 by TABU.
  • [1] Rudoulph G C.Convergence Analysis of Canonical Genetic Algorithms.IEEET rans on NN,1994,5(1):96~101
    [2] Suzuki J. A Markov Chain Analysis in Simple Genetic Algorithms. IEEE Trans on SMC,1995,25(4):655~659
    [3] Holland J H. Adaptation in Natural and Artificial Systems. Ann Arbor:The University of Michigan Press,1975
    [4] Kreinovich V,Quintana C,Fuentes O. Genetic Algorithms:What Fitness Scaling is Optimal? Cybernetics and Systems,1993,24(1):9~36
    [5] Goldberg D E.Genetic Algorithms in Search,Optimization and Machine Learning.Reading,MA:Addis on Wesley,1989
    [6] Lin W,Delgado-Frias J G. Hybrid Newton-Raphson Genetic Algorithm for Traveling Sales man Problem. Cybernetics and Systems,1995,26(5):387~412
    [7] Percy P C Yip,Yoh-Han Pao.Combinatorial Optimization with Use of Guided Evolutionary Simulated Annealing.IEEE Trans on NN,1995,2(6):290~295
    [8] Davis L. Applying Adaptive Algorithms to Epistatic Domains. In Proc of the 1985 JCAI,Los Angeles,CA:Morgan Kaufmann,1985
    [9] Feng-Tse Lin,Cheng-Yan Kao,Chng-Chi Hsu. Applying the Genetic Approach to Simulated Annealingin Solving Some NP-Hard Problems.IEEE Trans on SMC,1993,6(23):1752~1767
计量
  • 文章访问数: 
  • HTML全文浏览量:  0
  • PDF下载量: 
  • 被引次数: 0
出版历程
  • 收稿日期:  1996-10-11
  • 发布日期:  1997-08-19

目录

    /

    返回文章
    返回
    x