积分—水平集求全局最优的遗传算法实现  

Genetic Algorithm for Integral-level Set Global Optimization

作　　者：王延源[1] 王成永[1] 

机构地区：[1]临沂师范学院数学系,山东临沂276005

出　　处：《长沙电力学院学报（自然科学版）》2004年第3期8-11,共4页JOurnal of Changsha University of electric Power:Natural Science

摘　　要：在ChewSooHong等提出的一个积分──水平集求全局最优的概念性算法及Monte Carlo随机取点的实现途径的基础上,利用遗传算法给出了这一算法的另一种实现途径,并从理论和数值两个方面验证了算法的可行性.A theoretical algorithm for the integral-level set global optimization is proposed by Chew Soo Hong,et al,and the Monte-Carlo implementation of the algorithm is discussed.Based on the algorithm, another implementation approach is proposed by using the genetic algorithm. The proposed algorithm is varified to be efficient by some numerical results.

关 键 词：全局收敛性 最优 水平集 遗传算法 

分 类 号：O29[理学—应用数学]