International Conference on Computer Technology and Development, 3rd (ICCTD 2011) 2011
DOI: 10.1115/1.859919.paper86
|View full text |Cite
|
Sign up to set email alerts
|

An Approach of Particle Swarm Optimization for Solving Minimum Routing Cost Spanning Tree Problem

Abstract: Minimum Routing Cost Spanning Tree problem — MRCT is one of the spanning tree problems having several applications in network designing; this problem belongs to class of NP—hard. In this paper, we will apply Particle Swarm Optimization algorithm — PSO into MCRT problem, compare the effectivity of Genetic algorithm and PSO for MRCT problem and concurrently exploit the combining of PSO with other metaheuristic algorithms.

Help me understand this report

This publication either has no citations yet, or we are still processing them

Set email alert for when this publication receives citations?

See others like this or search for similar articles