A new hybrid Genetic Algorithm for solving the Bounded Diameter Minimum Spanning Tree problem

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.