遗传算法在最优化问题中的应用  

Application of Genetic Algorithms in Optimization Problem

作　　者：赵娟[1] 

机构地区：[1]西安工业大学北方信息工程学院

出　　处：《现代计算机（中旬刊）》2012年第8期17-20,共4页Modern Computer

基　　金：西安工业大学北方信息工程学院院长科研基金(No.BXXJJ-1016)

摘　　要：0引言使用遗传算法解决最优化问题,其实质是将物理问题数学化,即将最优化问题转换为求解目标函数的最优解问题。由于遗传算法对求解的目标函数的连续、可导或单峰等性质不作约束,使得遗传算法具有较好的全局最优解求解能力。将遗传算法引入到布井优化中,通过最大化净现值来优化井数。Using a genetic algorithm to solve the optimization problem, its essence is the physical mathe- matics, is about optimization problem into solving the problem of the optimal solution of the ob- jective function. Since genetic algorithm is able to overcome many of the limitations of the con- tinuity and derivability of the objective function, cause it to have ability of solving the global optimum solution. Introduces genetic algorithm in well placement optimization, and optimizes the number of well through maximizing NPV.

关 键 词：遗传算法 全局最优解 最优化 净现值 

分 类 号：O224[理学—运筹学与控制论]