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

Ant colony optimization with hill climbing for the bandwidth minimization problem

โœ Scribed by Andrew Lim; Jing Lin; Brian Rodrigues; Fei Xiao

Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
197 KB
Volume
6
Category
Article
ISSN
1568-4946

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An improved ant colony optimization for
An improved ant colony optimization for the communication network routing problem
โœ Dongming Zhao; Liang Luo; Kai Zhang ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 308 KB

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

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