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