A New Genetic Algorithm with Local Search Method for Degree-Constrained Minimum Spanning Tree Problem

Authors:
Yong Zeng;Yu-Ping Wang
Affiliations:
-;-
Venue:
ICCIMA '03 Proceedings of the 5th International Conference on Computational Intelligence and Multimedia Applications
Year:
2003

Citing 0
Cited 2

Priority-Based genetic local search and its application to the traveling salesman problem

SEAL'06 Proceedings of the 6th international conference on Simulated Evolution And Learning
Degree constrained minimum spanning tree problem: a learning automata approach

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new evolutionary algorithm for degree-constrained minimum spanning tree problem, which is an NP-complete problem, is proposed, and Pr fer 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.