遗传算法的性能分析研究
作者:
基金项目:

国家自然科学基金资助项目(69574022;69974026)


Study on the Performance Analysis of Genetic Algorithms
  • 摘要
  • | |
  • 访问统计
  • |
  • 参考文献 [8]
  • |
  • 相似文献 [20]
  • |
  • 引证文献
  • | |
  • 文章评论
    摘要:

    回顾了遗传算法的理论研究状况,介绍了NoFreeLunch定理,描述了遗传算法的通用框架,构造了遗传算法的性能分析矩阵,并通过模拟实验分析了一系列遗传算法的性能.实验表明,这种评价算法性能的方法切实可行,可操作性好,具有一定的通用性.

    Abstract:

    In this paper, the state of the theory of genetic algorithms is examined, and the No Free Lunch theorem is introduced. The general framework of genetic algorithms is described, in which the performance analysis matrix is built and used to test some typical genetic algorithms. The experimental results indicate that it is a feasible method, which is easy and adaptable to the evaluation of the performance of genetic algorithms.

    参考文献
    [1] Xu, Zong-ben, Li, Guo. Simulated biology algorithms for global optimization, Part (Ⅰ)——simulated evolutionary algorithms. Chinese Journal of Operations Research, 1995,(2):1~13 (in Chinese).徐宗本,李国.解全局优化问题的仿生类算法(Ⅰ)——模拟演化算法. 运筹学杂志,1995,(2):1~13.
    [2] Fogel, D.B. An introduction to simulated evolutionary optimization. IEEE Transactions on Neural Networks, 1994,5(1):3~14.
    [3] Asoh, H., Muhlenbein, H. On the mean convergence time of evolutionary alg orithms without selection and mutation. In: Davidor, Y., Schwefel, H., Manner, R ., eds. Parallel Problem Solving from Nature, PPSN III. Berlin: Springer-Verlag , 1994. 88~97.
    [4] Goldberg, D.E., Segrest, P. Finite Markov chain analysis of genetic algor ithms. In: Grefenstette, J.J., ed. Proceedings of the 2nd International Conference on Genetic Algorithms. Hillsdale, NJ: Lawrence Erlbaum Associates, 1987. 1~8.
    [5] Ankenbrandt, C.A. An extension to the theory of convergence and a proof the time complexity of genetic algorithms. In: Rawlins, G.J.E., ed. Foundations of Genetic Algorithms. San Francisco: Morgan Kaufmann Publishers, Inc., 1994. 53~ 58.
    [6] Wolpert, D.H., Macready, W.G. No free lunch theorems for search. IEEE Tra nsactions on Evolutionary Computation, 1997,1(1):67~82.
    [7] Radcliffe, N.J., Surry, P.D. Fundamental limitations on search algorithms : evolutionary computing in perspective. In: Van Leeuwen, J., ed. Computer Scien ce Today: Recent Trends and Developments. Berlin: Springer-Verlag, 1995. 274~29 1.
    [8] David, H.A. Order Statistics. 2 ed, New York: John Wiley and Sons, Inc., 1981. 73~78.
    网友评论
    网友评论
    分享到微博
    发 布
引用本文

戴晓晖,李敏强,寇纪淞.遗传算法的性能分析研究.软件学报,2001,12(5):742-750

复制
分享
文章指标
  • 点击次数:3927
  • 下载次数: 5069
  • HTML阅读次数: 0
  • 引用次数: 0
历史
  • 收稿日期:1999-05-20
  • 最后修改日期:2000-02-22
文章二维码
您是第19783709位访问者
版权所有:中国科学院软件研究所 京ICP备05046678号-3
地址:北京市海淀区中关村南四街4号,邮政编码:100190
电话:010-62562563 传真:010-62562533 Email:jos@iscas.ac.cn
技术支持:北京勤云科技发展有限公司

京公网安备 11040202500063号