A Novel Hybrid Ant Colony Optimization for a Multicast Routing Problem
AbstractQuality of service multicast routing is an important research topic in networks. Research has sought to obtain a multicast routing tree at the lowest cost that satisfies bandwidth, delay and delay jitter constraints. Due to its non-deterministic polynomial complete problem, many meta-heuristic algorithms have been adopted to solve this kind of problem. The paper presents a new hybrid algorithm, namely ACO&CM, to solve the problem. The primary innovative point is to combine the solution generation process of ant colony optimization (ACO) algorithm with the Cloud model (CM). Moreover, within the framework structure of the ACO, we embed the cloud model in the ACO algorithm to enhance the performance of the ACO algorithm by adjusting the pheromone trail on the edges. Although a high pheromone trail intensity on some edges may trap into local optimum, the pheromone updating strategy based on the CM is used to search for high-quality areas. In order to avoid the possibility of loop formation, we devise a memory detection search (MDS) strategy, and integrate it into the path construction process. Finally, computational results demonstrate that the hybrid algorithm has advantages of an efficient and excellent performance for the solution quality. View Full-Text
Share & Cite This Article
Zhang, X.; Shen, X.; Yu, Z. A Novel Hybrid Ant Colony Optimization for a Multicast Routing Problem. Algorithms 2019, 12, 18.
Zhang X, Shen X, Yu Z. A Novel Hybrid Ant Colony Optimization for a Multicast Routing Problem. Algorithms. 2019; 12(1):18.Chicago/Turabian Style
Zhang, Xiaoxia; Shen, Xin; Yu, Ziqiao. 2019. "A Novel Hybrid Ant Colony Optimization for a Multicast Routing Problem." Algorithms 12, no. 1: 18.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.