๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An improved ant colony optimization for the communication network routing problem

โœ Scribed by Dongming Zhao; Liang Luo; Kai Zhang

Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
308 KB
Volume
52
Category
Article
ISSN
0895-7177

No coin nor oath required. For personal study only.

โœฆ Synopsis

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.

๐Ÿ“œ SIMILAR VOLUMES

A new hybrid ant colony optimization alg
A new hybrid ant colony optimization algorithm for the vehicle routing problem
โœ Xiaoxia Zhang; Lixin Tang ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 251 KB

This paper presents a novel hybrid ant colony optimization approach called SS\_ACO algorithm to solve the vehicle routing problem. The main feature of the hybrid algorithm is to hybridize the solution construction mechanism of the ant colony optimization (ACO) with scatter search (SS). In our hybrid

HOPNET: A hybrid ant colony optimization
HOPNET: A hybrid ant colony optimization routing algorithm for mobile ad hoc network
โœ Jianping Wang; Eseosa Osagie; Parimala Thulasiraman; Ruppa K. Thulasiram ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 704 KB

Mobile ad hoc network (MANET) is a group of mobile nodes which communicates with each other without any supporting infrastructure. Routing in MANET is extremely challenging because of MANETs dynamic features, its limited bandwidth and power energy. Nature-inspired algorithms (swarm intelligence) suc

An ant colony optimization routing based
An ant colony optimization routing based on robustness for ad hoc networks with GPSs
โœ Daisuke Kadono; Tomoko Izumi; Fukuhito Ooshita; Hirotsugu Kakugawa; Toshimitsu M ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 889 KB

a b s t r a c t Ant colony optimization (ACO) routing algorithm is one of adaptive and efficient routing algorithms for mobile ad hoc networks (MANETs). In ACO routing algorithms, ant-like agents traverse the network to search a path from a source to a destination, and lay down pheromone on the path