基于 GAs 求解整数规划问题的算法设计

Algorithm Design Based on Genetic Algorithm for Integer Programming Problem

对于遗传算法（ＧＡｓ）求解整数规划问题，提出一种新的位串编码结构，采用一种新的加速变异算子，可明显改善寻优的收敛速度，并为保持种群多样性引入分散型淘汰法．

An algorithm is designed based on genetic algorithms for integer programming problem. A new structure of chromosome is proposed for solving integer programming problem. In order to improve the convergence of finding the best solution,a new mutation operator,speed up mutation operator is designed and simulating test proves to be effective. Niche method is introduced into the proposed algorithm to maintain the diversity of population.