A new genetic algorithm with local search method for degree-constrained minimum spanning tree problem

Abstract

A new evolutionary algorithm for degree-constrained minimum spanning tree problem, which is an NP-complete problem, is proposed, and Prufer encoding method is adopted to encode the solutions of the problem. To enhance the algorithm, two new genetic operators are specifically designed, which can avoid producing infeasible solutions. In addition, two novel local search operators are designed and combined into the algorithm to further improve the quality of solutions. As a result, the proposed evolutionary algorithm can efficiently explore the search space.