期刊文献+

基于多代竞争遗传算法的数值函数优化 被引量:3

Function Optimization Problems Based on Multi-Generation Competitive Genetic Algorithm
下载PDF
导出
摘要 目的对标准遗传算法的过早收敛问题进行改进。方法保持种群的多样性,将上几代个体中的一部分与本代共同参与竞争,提出多代竞争遗传算法,通过理论分析和对数值函数优化证明该算法的有效性。结果推导出多代竞争遗传算法的模式定理,经验证明显优于标准遗传算法。结论多代竞争遗传算法有利于保持种群的多样性,避免了过早收敛。 Objective To improve the prematurity of standard Genetic Algorithm. Methods In order to avoid prematurity, we kept the diversity of population, that was, some schemas of previous generation compete with schemas of present generation. Results In this paper, we present multi-generation competitive genetic algorithm and the schema theorem which were tested by theory analysis and applied practice. We took the De Jong testing functions to evaluate the performance of the multi-generation competitive genetic algorithm. Conclusion Multi-generation competitive genetic algorithm can avoid prematurity by keeping the diversity of population.
出处 《上海第二医科大学学报》 CSCD 北大核心 2005年第8期809-811,共3页 Acta Universitatis Medicinalis Secondae Shanghai
关键词 遗传算法 模式定理 多代竞争遗传算法 函数优化 genetic algorithm schema theorem multi-generation competitive genetic algorithm function optimization
  • 相关文献

参考文献6

  • 1周明 孙树栋.遗传算法原理及应用[M].北京:国防工业出版社,2001..
  • 2Kalyanmoy Deb. Multi-objective optimization of a leg mechanism using genetic algorithm [J].Engineering Optimization,2003,35(5): 445-470.
  • 3De Jong KA.An analysis of the behavior of a class of genetic adaptive systems Ph.D dissertation [J].University of Michigan,1975,76: 234-236.
  • 4Larson K,Sandholm,TW. Anytime coalition structure generation in an average study [J].In Proceeding of the third International Conference on Autonomous Agents,2003,121: 40-47.
  • 5熊志辉,李思昆,陈吉华.遗传算法与蚂蚁算法动态融合的软硬件划分[J].软件学报,2005,16(4):503-512. 被引量:87
  • 6刘芳,杨海潮.参数可调的克隆多播路由算法[J].软件学报,2005,16(1):145-150. 被引量:16

二级参考文献24

  • 1Parsa M. An interative algorithm for delay-constrained minimum-cost muticasting. IEEE/ACM Trans on Networking, 1998,6(4):461-474.
  • 2Kompella VP, Pasquale JC, Polyzos GC. Multicast routing for multimedia communication. IEEE/ACM Trans on Networking,1993,1 (3):286-292.
  • 3Widyono R. The design and evaluation of routing algorithms for real-time channels. Technical Report, Tr-94-024, Tenet Group, Deparment of EECS, University of California at Berkeley, 1994.
  • 4Salama HF. Evaluation of multicast routing algorithm for real-time communication on high-speed networks. IEEE Journal of Selected Areas in Commuications, 1997,15(3):332-345.
  • 5Waxman BM. Routing of multiple connections. IEEE Journal of Selected Areas in Commuications, 1988,6(9): 1617-1622.
  • 6Widyono R. The design and evaluation of routing algorithms for real-time channels. Technical Report, Tr-94-024, Tenet Group,Deparment of EECS, University of California at Berkeley, 1994.
  • 7Salama HF. Evaluation of multicast routing algorithm for real-time communication on high-speed networks. IEEE Journal of Selected Areas in Commuications, 1997,15(3):332-345.
  • 8Gupta RK, Micheli GD. System-Level synthesis using re-programmable components. In: Hugo DM, Herman B, eds. Proc. of the European Conf. on Design Automation (EDAC). Brussels: IEEE Computer Society Press, 1992.2-7.
  • 9Garey MR, Johnson DS. Computers and Intractability: A Guide to the Theory ofNP-Completeness. W.H.Freeman Company, 1979.
  • 10Kastner R. Synthesis techniques and optimizations for reconfigurable systems [Ph.D. Thesis]. Los Angeles: University of California, 2002.

共引文献128

同被引文献23

引证文献3

二级引证文献18

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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