Study of the Application of Election- Survey Algorithm for Nonlinear ConstrainedOptimization Problems
For the nonlinear constrained optimization problems, election-survey algorithm is combined with dynamic penalty function method to get the optimum in order to demonstrate solving capability of the algorithm. The tests of classic function and engineering optimization application model show that the election-survey algorithm can constringe rapidly to global optimal solution and achieve better optimization solution of objective function. It is feasible and effective in solving nonlinear constrained optimal problems, and available for engineering optimization.
nonlinear constrained optimization election-survey algorithm penalty function method golbal optimization
He Chun-hua Zhang Xiang-wei Lv Wen-ge Xie Qing-hua
Faculty of materials and energyGuangdong University of TechnologyGuangzhou, China Faculty of Electro-mechanics Engineering Guangdong University of Technology Guangzhou, China
国际会议
Third International Conference on Information and Computing(第三届信息与计算科学国际会议 ICIC 2010)
无锡
英文
96-99
2010-06-04(万方平台首次上网日期,不代表论文的发表时间)