Solving degree constrained minimum spanning tree problem based on improved fireworks algorithm

Abstract

In the iterative process of fireworks algorithm, an improved algorithm is proposed to improve the local search ability of optimal fitness value and make it more suitable for solving discrete problems, so as to obtain a method to find degree constrained minimum spanning tree. Firstly, the corresponding mathematical model is constructed by analyzing the degree constrained minimum spanning tree, then the explosion operator and the corresponding fitness function are established according to the model, and finally the algorithm is improved to adapt to the discrete fireworks algorithm, so as to achieve the purpose of seeking the degree constrained minimum spanning tree. The example calculation shows that the improved fireworks algorithm can reduce the number of iterations and achieve high accuracy.