A novel particle swarm optimization - Based algorithm for the optimal communication spanning tree problem
Năm xuất bản
2010
Tác giả
Hoang A.T.
Department of Mathematics - Mechanics - Informatics, Hanoi University of Science, Viet Nam
Faculty of Information Technology, Duy Tan University, Viet Nam
Nguyen N.G.
DOI
10.1109/ICCSN.2010.111
Tóm tắt
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.