A modified ant colony optimization algorithm for network coding resource minimizationTools Wang, Zhaoyuan, Xing, Huanlai, Li, Tianrui, Yang, Yan, Qu, Rong and Pan, Yi (2015) A modified ant colony optimization algorithm for network coding resource minimization. IEEE Transactions on Evolutionary Computation . ISSN 1089-778X Full text not available from this repository.AbstractThe paper presents a modified ant colony optimization approach for the network coding resource minimization problem. It is featured with several attractive mechanisms specially devised for solving the network coding resource minimization problem: 1) a multi-dimensional pheromone maintenance mechanism is put forward to address the issue of pheromone overlapping; 2) problem-specific heuristic information is employed to enhance the heuristic search (neighboring area search) capability; 3) a tabu-table based path construction method is devised to facilitate the construction of feasible (link-disjoint) paths from the source to each receiver; 4) a local pheromone updating rule is developed to guide ants to construct appropriate promising paths; 5) a solution reconstruction method is presented, with the aim of avoiding prematurity and improving the global search efficiency of proposed algorithm. Due to the way it works, the ant colony optimization can well exploit the global and local information of routing related problems during the solution construction phase. The simulation results on benchmark instances demonstrate that with the five extended mechanisms integrated, our algorithm outperforms a number of existing algorithms with respect to the best solutions obtained and the computational time.
Actions (Archive Staff Only)
|
Tools
Tools
