A modified ant colony optimization algorithm for network coding resource minimization

Wang, Zhaoyuan and Xing, Huanlai and Li, Tianrui and Yang, Yan and 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

[img]
Preview
PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (3MB) | Preview

Abstract

The 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.

Item Type: Article
Additional Information: © 2015 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Keywords: Ant colony optimization, Network coding, Combinatorial optimization
Schools/Departments: University of Nottingham UK Campus > Faculty of Science > School of Computer Science
Identification Number: https://doi.org/10.1109/TEVC.2015.2457437
Depositing User: Qu, Rong
Date Deposited: 14 Dec 2015 13:17
Last Modified: 14 Sep 2016 23:39
URI: http://eprints.nottingham.ac.uk/id/eprint/31073

Actions (Archive Staff Only)

Edit View Edit View