Node-Based Genetic Algorithm for Communication Spanning Tree Problem

Lin LIN
Mitsuo GEN

Publication
IEICE TRANSACTIONS on Communications   Vol.E89-B    No.4    pp.1091-1098
Publication Date: 2006/04/01
Online ISSN: 1745-1345
DOI: 10.1093/ietcom/e89-b.4.1091
Print ISSN: 0916-8516
Type of Manuscript: Special Section PAPER (Special Section on Internet Technology VI)
Category: 
Keyword: 
minimum spanning tree (MST),  communication network design,  genetic algorithm (GA),  node-based encoding,  

Full Text: PDF(587.9KB)>>
Buy this Article


Summary: 
Genetic Algorithm (GA) and other Evolutionary Algorithms (EAs) have been successfully applied to solve constrained minimum spanning tree (MST) problems of the communication network design and also have been used extensively in a wide variety of communication network design problems. Choosing an appropriate representation of candidate solutions to the problem is the essential issue for applying GAs to solve real world network design problems, since the encoding and the interaction of the encoding with the crossover and mutation operators have strongly influence on the success of GAs. In this paper, we investigate a new encoding crossover and mutation operators on the performance of GAs to design of minimum spanning tree problem. Based on the performance analysis of these encoding methods in GAs, we improve predecessor-based encoding, in which initialization depends on an underlying random spanning-tree algorithm. The proposed crossover and mutation operators offer locality, heritability, and computational efficiency. We compare with the approach to others that encode candidate spanning trees via the Pr?fer number-based encoding, edge set-based encoding, and demonstrate better results on larger instances for the communication spanning tree design problems.