Abstract: Link enhancement problem is a combinatorial optimization problem, and genetic algorithm is suitable to solve the combinatorial optimization problem. Commonly, the genetic algorithms are adopt one dimension code, this paper adopt the dual-structure code and Adaptive probabilities of crossover and mutation to solve the link enhancement problem. In the Simulation experiment, we compare the performance of dual-structure code genetic algorithm and one dimension code genetic algorithm.

摘要： 连接增强问题是个组合优化问题，遗传算法适合解决组合优化问题，一般的遗传算法都采用一重编码方法，本文采取二重编码方法来解决连接增强问题，采取了自适应方法来调整交叉和变异概率，模拟实验中比较了二重编码遗传算法和一重编码的遗传算法的性能。