An improved ant colony optimization for the communication network routing problem

Authors:
Dongming Zhao;Liang Luo;Kai Zhang
Affiliations:
School of Electronics Engineering and Computer Science, Peking University, Beijing, China;Department of Control Science and Engineering, Huazhong University of Science and Technology, China;School of Electronics Engineering and Computer Science, Peking University, Beijing, China
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
2010

Citing 2
Cited 1

Ant-based load balancing in telecommunications networks

Adaptive Behavior
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Ordinal optimization based approach to the optimal resource allocation of grid computing system

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.98

Visualization

Abstract

Ant colony optimization (ACO) is a population-based meta-heuristic for combinatorial optimization problems such as the communication network routing problem (CNRP). This paper proposes an improved ant colony optimization (IACO) technique, which adapts a new strategy to update the increased pheromone, called the ant-weight strategy, and a mutation operation, to solve the CNRP. The simulation results for a benchmark problem are reported and they are compared to the simple ant colony optimization (ACO) results.