AN APPROACH OF PARTICLE SWARM OPTIMIZATION FOR SOLVING MINIMUM ROUTING COST SPANNING TREE PROBLEM

摘要：

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.

关键词： Minimum routing cost spanning tree Metaheuristic Particle swarm optimization Velocity Location

作者: QUOC PHAN TAN

作者单位: Department of Information Technology Saigon University Ho Chi Mirth City,Vietnam

会议类型: 国际会议

会议名称: 2011 3rd International Conference on Computer Technology and Development(2011第三届计算机技术与发展国际会议 ICCTD2011)

会议地点: 成都

会议语种:英文

页码: 511-517

在线出版日期: 2011-11-25（万方平台首次上网日期，不代表论文的发表时间）