New heuristic and hybrid genetic algorithm for solving the bounded diameter minimum spanning tree problem

Authors:
Thanh Thi Huynh Binh;Robert I. McKay;Nguyen Xuan Hoai;Nguyen Duc Nghia
Affiliations:
Ha Noi University of Technology, Hanoi, Vietnam;Seoul National University, Seoul, South Korea;Seoul National University, Seoul, South Korea;Hanoi University of Technology, Hanoi, Vietnam
Venue:
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Year:
2009

Citing 14
Cited 0

A tree-based algorithm for distributed mutual exclusion

ACM Transactions on Computer Systems (TOCS)
Compression of correlated bit-vectors

Information Systems
Approximating shallow-light trees

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Approximating the weight of shallow Steiner trees

Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Computing a diameter-constrained minimum spanning tree

Computing a diameter-constrained minimum spanning tree
Greedy heuristics and an evolutionary algorithm for the bounded-diameter minimum spanning tree problem

Proceedings of the 2003 ACM symposium on Applied computing
A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees

Networks
Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO

Proceedings of the 8th annual conference on Genetic and evolutionary computation
Representations for Genetic and Evolutionary Algorithms

Representations for Genetic and Evolutionary Algorithms
Improved heuristics for the bounded-diameter minimum spanning tree problem

Soft Computing - A Fusion of Foundations, Methodologies and Applications
Greedy heuristics for the bounded diameter minimum spanning tree problem

Journal of Experimental Algorithmics (JEA)
New Multi-parent Recombination in Genetic Algorithm for Solving Bounded Diameter Minimum Spanning Tree Problem

ACIIDS '09 Proceedings of the 2009 First Asian Conference on Intelligent Information and Database Systems
Edge sets: an effective evolutionary coding of spanning trees

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a new heuristic, called Center-Based Recursive Clustering - CBRC, for solving the bounded diameter minimum spanning tree (BDMST) problem. Our proposed hybrid genetic algorithm [12] is also extended to include the new heuristic and a multi-parent crossover operator. We test the new heuristic and genetic algorithm on two sets of benchmark problem instances for the Euclidean and Non-Euclidean cases. Experimental results show the effectiveness of the proposed heuristic and genetic algorithm.