Title :
A Novel Particle Swarm Optimization-Based Algorithm for the Optimal Communication Spanning Tree Problem
Author :
Hoang, Anh Tuan ; Le, Vinh Trong ; Nguyen, Nhu Gia
Author_Institution :
Dept. of Math. - Mech. - Inf., Hanoi Univ. of Sci., Hanoi, Vietnam
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.
Keywords :
computational complexity; encoding; particle swarm optimisation; trees (mathematics); heuristic algorithms; node biased encoding scheme; optimal communication spanning tree problem; particle swarm optimization based algorithm; public benchmark problem; Biological cells; Birds; Costs; Encoding; Equations; Genetic algorithms; Particle swarm optimization; Polynomials; Symmetric matrices; Tree graphs; Node Biased Encoding; Optimal Communication Spanning Tree; Particle Swarm Optimization;
Conference_Titel :
Communication Software and Networks, 2010. ICCSN '10. Second International Conference on
Conference_Location :
Singapore
Print_ISBN :
978-1-4244-5726-7
Electronic_ISBN :
978-1-4244-5727-4
DOI :
10.1109/ICCSN.2010.111
