A novel genetic algorithm for multi-criteria minimum spanning tree problem

Authors:
Lixia Han;Yuping Wang
Affiliations:
School of Science, Xidian University, Xi’an, China;School of Computer Science and Technology, Xidian University, Xi’an, China
Venue:
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part I
Year:
2005

Citing 5
Cited 0

Probability, statistics, and queueing theory with computer science applications

Probability, statistics, and queueing theory with computer science applications
Multiobjective evolutionary algorithms: a comparative case studyand the strength Pareto approach

IEEE Transactions on Evolutionary Computation
A new evolutionary approach to the degree-constrained minimumspanning tree problem

IEEE Transactions on Evolutionary Computation
Genetic algorithms for communications network design - an empiricalstudy of the factors that influence performance

IEEE Transactions on Evolutionary Computation
Edge sets: an effective evolutionary coding of spanning trees

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The multi-criteria Minimum Spanning Tree problem is an NP-hard problem, and is difficult for the traditional network optimization techniques to deal with. In this paper, a novel genetic algorithm (NGA) is developed to deal with this problem. First, based on the topology of the problem, the proposed algorithm adopts a heuristic crossover operator and a new mutation operator. Then, in order to enhance the ability of exploration of crossover, a new local search operator is designed to improve the offspring of crossover. Furthermore, the convergence of the proposed algorithm to globally optimal solution with probability one is proved. The simulation results indicate that the proposed algorithm is effective.