Skip to Main Content
This paper presents a particle swarm optimization algorithm for the multi-criteria degree constrained minimum spanning tree problem. The operators for the particle's velocity are based upon local search and path-relinking procedures. The proposed heuristic is compared with other evolutionary algorithm presented previously for the same problem. A computational experiment is reported. The results show that the method proposed in this paper finds high quality solutions for the problem.