期刊文献+

用群体启发进化规划求解高维优化问题 被引量:1

Population Heuristic Evolutionary Programming for High-dimension Optimization
下载PDF
导出
摘要 提出一种新的进化规划方法,群体启发进化规划(PHEP),在进化过程中,通过控制群体的4个参数,把握群体中个体分布情况,并通过这些信息有效地调整个体的变异步长,克服了传统EP方法变异步长修正的盲目性.将PHEP方法应用于高维优化问题,实验结果表明,PHEP方法在高维条件下的性能明显优于其他EP方法. A new evolutionary programming method known as population heuristic evolutionary programming (PHEP) was proposed in this paper. The information of distribution-status of population can be known by controlling four parameters of population in the evolution process and the mutation size of individuals can be adjusted according to such information, so as to overcome the deficiency of traditional EP, which updates the mutation size blindly. PHEP was tested by using benchmark functions under high-dimension condition, the experimental results show that the performance of PHEP is better than that of other EP method obviously under high-dimension condition.
出处 《吉林大学学报(理学版)》 CAS CSCD 北大核心 2005年第5期622-626,共5页 Journal of Jilin University:Science Edition
基金 国家自然科学基金(批准号:60433020) 教育部"符号计算与知识工程"重点实验室基金
关键词 进化规划 高维优化 群体 evolutionary programming high-dimension optimization population
  • 相关文献

参考文献12

  • 1Fogel L J, Owens A J, Walsh M J. Artificial Intelligence Through Simulated Evolution [M]. New York: John Wiley and Sons Inc, 1966.
  • 2YAO Xin, LIU Yong, LIN Guang-ming. Evolutionary Programming Made Faster [J]. IEEE Trans Evolutionary Comput, 1999, 3(2): 82-102.
  • 3Matsumura Yoshiyuki, Ohkura Kazuhiro, Ueda Kanji. Evolutionary Programming with Non-coding Segments for Real-valued Function Optimization [C]. Proceedings of 1999 IEEE International Conference on Systems, Man and Cybernetics (SMC'99). Tokyo: IEEE Press, 1999, 4: 242-247.
  • 4Ohkura Kazuhiro, Matsumura Yoshiyuki, Ueda Kanji. Robust Evolution Strategies, Simulated Evolution and Learning [C]. In: Mckay B, Yao X, Newton C S, et al, eds. Second Asia-Pacific Conference on Simulated Evolution and Learning, SEAL'98: Lecture Notes in Computer Science. Berlin: Springer-Verlag, 1998, 1585/1999: 24-27.
  • 5Matsumura Yoshiyuki, Ohkura Kazuhiro, Ueda Kanji. Evolutionary Dynamics of Evolutionary Programming in Noisy Environment [C]. Proceedings of the 2001 Congress on Evolutionary Computation CEC2001. Piscataway, New Jersey: IEEE Press, 2001: 17-24.
  • 6YAO Xin, LIU Yong. Scaling up Evolutionary Programming Algorithms [C]. In: Porto V W, Saravanan N, Waagen D, et al, eds. Evolutionary Programming VII: Proceedings of the Seventh Annual Conference on Evolutionary Programming (EP98): Lecture Notes in Computer Science. Berlin: Springer-Verlag, 1998: 1447: 103-112.
  • 7LIU Yong, YAO Xin. Scaling up Fast Evolutionary Programming with Cooperative Coevolution [C]. Proceedings of the 2001 Congress on Evolutionary Computation. Piscataway, New Jersey: IEEE Press, 2001: 1101-1108.
  • 8YAO Xin, LIN Guang-ming, LIU Yong. An Analysis of Evolutionary Algorithms Based on Neighborhood and Step Sizes [C]. In: Peter J A, Robert G R, John R M, et al, eds. Proceedings of the 6th International Conference on Evolutionary Programming VI: Lecture Notes in Computer Science. Berlin: Springer-Verlag, 1997, 1213: 297-307.
  • 9Rudolph G. Self-adaptation and Global Convergence: a Counter-example [C]. Proceedings of Conference on Evolutionary Computing. Piscatauay, New Jersey: IEEE Press, 1999: 646-651.
  • 10Rudolph G. Self-adaptive Mutations May Lead to Premature Convergence [J]. IEEE Trans Evol Comput, 2001, 5: 410-414.

同被引文献12

引证文献1

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部