求解线性互补问题的一种改进的遗传算法  

AnImproved Genetic Algorithm for Linear Complementarity Problems

作　　者：马俊 王秀玉 MA Jun;WANG Xiuyu(Colloge of Mathematics and Statistics,Changchun University of Technology,Changchun 130012,China;College of Science,Jilin Institute of Chemical Technology,Jilin 132022,China)

机构地区：[1]长春工业大学数学与统计学院,吉林长春130012 [2]吉林化工学院理学院,吉林吉林132022

出　　处：《吉林化工学院学报》2019年第11期74-76,共3页Journal of Jilin Institute of Chemical Technology

摘　　要：互补问题作为一类重要的优化问题,其传统算法中初始点的选取较为困难.本文通过引入阻尼最小二乘算法对遗传算法进行改进求解互补问题.计算结果表明,应用改进的遗传算法计算线性互补问题不依赖于初始点的选取,可以提高收敛效率,减少迭代次数.As an important optimization problem,it is difficult to choose the initial point in the traditional algorithm.In this paper,the damped least square algorithm is introduced to improve the genetic algorithm.The results show that the improved genetic algorithm does not depend on the selection of initial points,and can improve the convergence efficiency and reduce the number of iterations.

关 键 词：线性互补 NCP函数 阻尼最小二乘 遗传算法 

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