Anzeige
Erschienen in:
2005 | OriginalPaper | Buchkapitel
A Novel Genetic Algorithm for Multi-criteria Minimum Spanning Tree Problem
verfasst von : Lixia Han, Yuping Wang
Erschienen in: Computational Intelligence and Security
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.