Skip to Main Content
Skip Nav Destination
ASME Press Select Proceedings

International Conference on Computer Technology and Development, 3rd (ICCTD 2011)

By
Jianhong Zhou
Jianhong Zhou
Search for other works by this author on:
ISBN:
9780791859919
No. of Pages:
2000
Publisher:
ASME Press
Publication date:
2011

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.

Abstract
Keywords
1. Introduction Minimum Routing Cost Spanning Tree Problem
2. Supplemental Problems
3 PSO Approach
4 Comparison PSO with GA and Possibility of Combining Some Metaheuristics
5 Conclutions and Future Works
References
This content is only available via PDF.
You do not currently have access to this chapter.
Close Modal

or Create an Account

Close Modal
Close Modal