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.