Next Article in Journal
Algorithm for Producing Rankings Based on Expert Surveys
Previous Article in Journal
Shadowed Type-2 Fuzzy Systems for Dynamic Parameter Adaptation in Harmony Search and Differential Evolution Algorithms
Article Menu

Export Article

Open AccessArticle
Algorithms 2019, 12(1), 18; https://doi.org/10.3390/a12010018

A Novel Hybrid Ant Colony Optimization for a Multicast Routing Problem

College of Software Engineering, University of Science and Technology LiaoNing, Anshan 114051, China
*
Author to whom correspondence should be addressed.
Received: 8 December 2018 / Revised: 23 December 2018 / Accepted: 2 January 2019 / Published: 10 January 2019
Full-Text   |   PDF [2151 KB, uploaded 10 January 2019]   |  
  |   Review Reports

Abstract

Quality 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
Keywords: ant colony optimization; multicast routing; memory detection search; cloud model ant colony optimization; multicast routing; memory detection search; cloud model
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Zhang, X.; Shen, X.; Yu, Z. A Novel Hybrid Ant Colony Optimization for a Multicast Routing Problem. Algorithms 2019, 12, 18.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top