𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An ant colony algorithm for the pos/neg weightedp-median problem

✍ Scribed by Jafar Fathali; Hossein T. Kakhki; Rainer E. Burkard


Publisher
Springer-Verlag
Year
2006
Tongue
English
Weight
192 KB
Volume
14
Category
Article
ISSN
1435-246X

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A new hybrid ant colony optimization alg
✍ 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

An improved ant colony optimization for
✍ 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