Referenced Items are not available for this document.
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| - 1. This paper proposes three new multi-parent recombination operators using different methods to choose parents in genetic algorithm for solving bounded diameter minimum spanning tree problem. Results of computational experiments are reported to show the efficiency of proposed algorithms.
Published in:
Intelligent Information and Database Systems, 2009. ACIIDS 2009. First Asian Conference on
Date of Conference: 1-3 April 2009
- Page(s):
- 283 - 288
- Print ISBN:
- 978-0-7695-3580-7
- INSPEC Accession Number:
- 10803829
- Conference Location :
- Dong Hoi
- Digital Object Identifier :
- 10.1109/ACIIDS.2009.89
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
