Applying genetic algorithm and simulated annealing to a combinatorial optimization problem

This paper applies the genetic algorithm and simulated annealing to the problem of optimal link enhancement, which is an NP-complete combinatorial optimization problem in the topological expansion of computer communication networks. Experimental results show that simulated annealing outperforms the genetic algorithm on this problem.