p.3622
p.3628
p.3634
p.3640
p.3647
p.3652
p.3659
p.3665
p.3669
A New Hybrid GRASP with the Pilot Method Forthe Delay-Constrained Multicast Routing Problem
Abstract:
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 Least-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.
Info:
Periodical:
Pages:
3647-3651
Citation:
Online since:
September 2013
Authors:
Price:
Сopyright:
© 2013 Trans Tech Publications Ltd. All Rights Reserved
Share:
Citation: