辽宁工程技术大学学报（自然科学版）Issue(7)：987-991,5.DOI:10.3969/j.issn.1008-0562.2013.07.026
单纯同伦算法的改进遗传算法
An improved genetic algorithm based on PL homotopy methods
摘要
Abstract
For the shortcoming of low convergent speed and poor stability of the simple genetic algorithm in practical applications, an improved genetic algorithm is presented based on PL homotopy methods, and the n-dimensional solution space of the optimization problem is transformed as n+1 dimensional. The algorithm follows the path of the homotopy parameter to find the optimal solution, using the simplex subdivision with refining network diameter to improve the accuracy of the target solution step by step. Meanwhile, the vertex integer label information of simplex subdivision is used as convergence criteria to improve the stability of the simple genetic algorithm. The examples show that the improved genetic algorithm is superior to the simple genetic algorithm, the algorithm of the aspects of accuracy and accelerating convergence.关键词
遗传算法/同伦算法/渐细剖分/不动点/单纯剖分/整数标号/全局最优/路径跟踪Key words
genetic algorithm/homotopy algorithm/refining simplicial subdivision/fixed point/simplex subdivision/integer Label/global optimal solution/path tracking分类
信息技术与安全科学引用本文复制引用
张京军,吕品,高瑞贞,张海军..单纯同伦算法的改进遗传算法[J].辽宁工程技术大学学报（自然科学版）,2013,(7):987-991,5.基金项目
国家自然科学基金资助项目（60875037，11272112）；河北省自然科学基金资助项目 （）
