Title :
A new hybrid Genetic Algorithm for solving the Bounded Diameter Minimum Spanning Tree problem
Author :
Binh, Huynh Thi Thannh ; Hoai, Nguyen Xuan ; McKay, R. I Bob
Author_Institution :
Dept. of Inf. Technol., Hanoi Univ. of Technol., Hanoi
Abstract :
In this paper, a new hybrid genetic algorithm - known as HGA - is proposed for solving the bounded diameter minimum spanning tree (BDMST) problem. We experiment with HGA on two sets of benchmark problem instances, both Euclidean and Non-Euclidean. On the Euclidean problem instances, HGA is shown to outperform the previous best two genetic algorithms (GAs) reported in the BDMST literature, while on the Non-Euclidean problem instance, HGA performs comparably with these two GAs.
Keywords :
genetic algorithms; trees (mathematics); Euclidean problem instance; HGA; bounded diameter minimum spanning tree problem; hybrid genetic algorithm; nonEuclidean problem instance; Evolutionary computation; Genetic algorithms;
Conference_Titel :
Evolutionary Computation, 2008. CEC 2008. (IEEE World Congress on Computational Intelligence). IEEE Congress on
Conference_Location :
Hong Kong
Print_ISBN :
978-1-4244-1822-0
Electronic_ISBN :
978-1-4244-1823-7
DOI :
10.1109/CEC.2008.4631221
