A new genetic algorithm for the optimal communication spanning tree problem

25Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper proposes a new genetic algorithm to solve the Optimal Communication Spanning Tree problem. The proposed algo-rithm works on a tree chromosome without intermediate encoding and decoding, and uses crossovers and mutations which manipulate direc-tly trees, while a traditional genetic algorithm generally works on linear chromosomes. Usually, an initial population is constructed by the stan-dard uniform sampling procedure. But, our algorithm employs a simple heuristic based on Prim's algorithm to randomly generate an initial po-pulation. Experimental results on known data sets show that our genetic algorithm is simple and e_cient to get an optimal or near-optimal solu-tion to the OCST problem. © Springer-Verlag Berlin Heidelberg 2000.

Cite

CITATION STYLE

APA

Li, Y., & Bouchebaba, Y. (2000). A new genetic algorithm for the optimal communication spanning tree problem. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1829, 162–173. https://doi.org/10.1007/10721187_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free