A new hybrid GRASP with the pilot method for the delay-constrained multicast routing problem
- 10.2991/iccia.2012.99How to use a DOI?
- GRASP(Greedy Randomised Adaptive Search Procedure), Pilot Method, Multicast Routing
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.
- © 2013, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - Ying Xu AU - Xiongfei Zheng AU - Renfa Li PY - 2014/05 DA - 2014/05 TI - A new hybrid GRASP with the pilot method for the delay-constrained multicast routing problem BT - Proceedings of the 2012 2nd International Conference on Computer and Information Application (ICCIA 2012) PB - Atlantis Press SP - 410 EP - 414 SN - 1951-6851 UR - https://doi.org/10.2991/iccia.2012.99 DO - 10.2991/iccia.2012.99 ID - Xu2014/05 ER -