By Topic

A Novel Particle Swarm Optimization-Based Algorithm for the Optimal Communication 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.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Anh Tuan Hoang ; Dept. of Math. - Mech. - Inf., Hanoi Univ. of Sci., Hanoi, Vietnam ; Vinh Trong Le ; Nhu Gia Nguyen

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.

Published in:

Communication Software and Networks, 2010. ICCSN '10. Second International Conference on

Date of Conference:

26-28 Feb. 2010