期刊文献+

求解二重积分问题的差分进化算法 被引量:2

Solving Double Integral Problem Based on Evolution Algorithm
在线阅读 下载PDF
导出
摘要 传统计算二重积分方法大都是等距分割方法,但是在在被积函数区间变化快慢相差较大时,计算精度大为降低。为此,提出一种不等距点分割的差分进化算法用于求解复杂函数的二重积分问题。在积分区域x向与y向上选取一些节点,将积分区域分割成很多小的子矩形域,并通过差分进化算法对其进行优化,使函数变化较快的区域分得小一些,函数变化较慢的区域分得大一些,从而得到较准确的二重积分。仿真结果表明,提出的算法收敛速度快,计算精度高,能计算较复杂的二重积分。 The traditional methods of calculating double integral mostly are equidistant segmentation, but these methods greatly reduce the accuracy of double integral when changes in the range of the integrand are large differ- ence. Thus an approach based on inequality point' s segmentation differential evolution(DE) algorithm was presented to solve the complex function double integral. The node points on the x and y direction range in the integral region were selected, and the integral region was divided into many small sub-rectangular domains. DE was used to optimize the small sub-rectangular domains and make the rapid-change interval of function smaller or make the slow-change interval of function bigger. Thus, a more precise result was obtained. The result show that the algorithm not only is an efficient method with fast convergence and high precision, but also can calculate complex double integral.
出处 《计算机仿真》 CSCD 北大核心 2013年第1期319-322,共4页 Computer Simulation
基金 国家自然科学基金(11061005) 2010年度教育部科技重点项目(210164) 贵州省教育厅自然科学基金资助项目(黔教科2010072)
关键词 差分进化算法 二重积分 不等距点分割 Differential evolution Double integral Inequality point' s segmentation
  • 相关文献

参考文献9

二级参考文献21

  • 1李爱国.多粒子群协同优化算法[J].复旦学报(自然科学版),2004,43(5):923-925. 被引量:398
  • 2吴延科,徐晨,李国.基于粒子群统计规律的PSO算法[J].郑州大学学报(理学版),2006,38(4):98-101. 被引量:4
  • 3R Storn, K Price. Differential Evolution-a Simple and Efficient Adaptive Scheme for Global Optimization over Continuous Spaces [ R]. Technical Report, International Computer Science Institute, 1995, (8) :22-25.
  • 4J Kennedy, R Eberhart. Particle Swarm Optimization [ J ]. IEEE Intelnational Conference on Neural Network, 1995. 1942-1948.
  • 5Thomas P R, Y Xin. Stochastic Ranking for Constrainted Evolutionary Optimization [ J ]. IEEE Trans. on Evolutionary Computation, 2000. 284-294.
  • 6Z Michalewicz. A Survy of Constraint Handling Techniques in Evolutionary Computation Methods [ C ]. Proceedings of the Annual Conference on evolutionary Programming, 1995. 135-155.
  • 7S Koziel, Z Michalewicz. Evolutionary Algorithms, Homomorphous Mappings, and Constrained Parameter Optimization [ J ]. Evolutionary Compution, 1999,7 ( 1 ) : 19-44.
  • 8S B Hamida, A Schoenauerm. New Results Using Adaptive Segregational Constraint Handling[ C]. Proceedings of the 2002 Congress on Evolutionary Computation, Piseataway: IEEE Service Center,2002. 884-889.
  • 9M E Mezura, C A Coello, M I Tun. Simple Feasibility rules and Differential Evolution for Constrained Optimization[ C].Proceedings of the 3^rd Mexican International Conference on Artificial Intelligence, LNCS 2972. Heidelberg: Springer- Verlag, 2004. 707-716.
  • 10M E Mezura, A Carlos, C A Coello. Simple Evolution Strategy to Solve Constrained Optimization Problems [ J ]. IEEE Trans. on Evolutionary Compution, 2005,9 ( 1 ) : 1 - 17.

共引文献36

同被引文献17

引证文献2

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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