DSpace
 

Tai Nguyen So - Vietnam National University, Ha Noi - VNU >
ĐẠI HỌC QUỐC GIA HÀ NỘI - VIETNAM NATIONAL UNIVERSITY, HANOI >
BÀI BÁO ĐĂNG TRÊN SCOPUS >
2009-2010 VNU-DOI-Publications >

Search

Please use this identifier to cite or link to this item: http://tainguyenso.vnu.edu.vn/jspui/handle/123456789/6808

Title: A novel particle swarm optimization - Based algorithm for the optimal communication spanning tree problem
Authors: Hoang ., A.T
Le, V.T.
Nguyen, N.G.
Keywords: Optimal communication spanning tree
Particle Swarm Optimization
Node biased encoding
Issue Date: 2010
Publisher: 2nd International Conference on Communication Software and Networks, ICCSN 2010
Citation: Page : 232-236
Abstract: In this paper, we propose a novel approach for the optimal communication spanning tree (OCST) problem. Our algorithm is based on the Particle Swarm Optimization (PSO) technique and take account into node biased encoding (NBE) scheme to find nearly optimal solution. The new algorithm can achieve a result that is better than known heuristic algorithms do, as verified by a set of public benchmark problem instances. ?? 2010 IEEE.
URI: http://tainguyenso.vnu.edu.vn/jspui/handle/123456789/6808
ISBN: 9.78E+12
Appears in Collections:2009-2010 VNU-DOI-Publications

Files in This Item:

File Description SizeFormat
153.pdf46.61 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback