By Topic

New Recombination Operator in Genetic Algorithm For Solving the Bounded Diameter Minimum Spanning Tree Problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
2 Author(s)
Nguyen Duc Nghia ; Fac. of Inf. Technol., Hanoi Univ. of Technol., Hanoi ; Huynh Binh

Given a connected, weighted, undirected graph G=(V, E) and a bound D, Bounded Diameter Minimum Spanning Tree problem (BDMST) seeks spanning tree on G with smallest weight in which no path between two vertices contains more than D edges. This problem is NP-hard for 4 les D les |V|i - 1. In present paper a new randomized greedy heuristic algorithm and a new recombination method in genetic algorithm for solving BDMST are developed. Results of computational experiments are reported to show the efficiency of these algorithms.

Published in:

Research, Innovation and Vision for the Future, 2007 IEEE International Conference on

Date of Conference:

5-9 March 2007