A Novel Particle Swarm Optimization-Based Algorithm for the Optimal Communication Spanning Tree Problem

Authors:
Anh Tuan Hoang;Vinh Trong Le;Nhu Gia Nguyen
Affiliations:
-;-;-
Venue:
ICCSN '10 Proceedings of the 2010 Second International Conference on Communication Software and Networks
Year:
2010

Citing 0
Cited 1

New hybrid genetic algorithm for solving optimal communication spanning tree problem

Proceedings of the 2011 ACM Symposium on Applied Computing

Quantified Score

Hi-index	0.00

Visualization

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.