A new hybrid GRASP with the pilot method for the delay-constrained multicast routing problem
Multicast routing problem is a well know optimization problem for transmitting real-time multimedia applications in telecommunication networks.As the underpinning mathematical model,the constrained minimum Steiner tree problem in graphs is a well-known NP-complete problem.In this paper we investigate a new hybrid GRASP (Greedy Randomized Adaptive Search Procedure) approach where a pilot method is applied to further enhance the search for the Delay-Constrained Lenst-Cost (DCLC) multicast routing problem.Experimental results demonstrate the efficiency of the hybrid GRASP algorithm and the contributions of the post-processing pilot method to better solutions in most cases.The proposed GRASP approach is a competitive approach in solving the DCLC multicast routing problem.
GRASP(Greedy Randomised Adaptive Search Procedure) Pilot Method Multicast Routing
Ying Xu Xiongfei Zheng Renfa Li
College of Information Science and Engineering, Hunan University, Changsha Hunan, 410082, CHINA
国际会议
太原
英文
410-414
2012-12-08（万方平台首次上网日期，不代表论文的发表时间）