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
β¦ LIBER β¦
Ant colony algorithm for solving QoS routing problem
β Scribed by Sun Li-juan; Wang Liang-jun; Wang Ru-chuan
- Publisher
- Wuhan University
- Year
- 2004
- Tongue
- English
- Weight
- 448 KB
- Volume
- 9
- Category
- Article
- ISSN
- 1007-1202
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
Solving the mesh-partitioning problem wi
β
Peter KoroΕ‘ec; Jurij Ε ilc; Borut RobiΔ
π
Article
π
2004
π
Elsevier Science
π
English
β 706 KB
An improved ant colony optimization algo
β
Jingan Yang; Yanbin Zhuang
π
Article
π
2010
π
Elsevier Science
π
English
β 371 KB
A new multi-objective ant colony algorit
β
Li-Ping Ding; Yi-Xiong Feng; Jian-Rong Tan; Yi-Cong Gao
π
Article
π
2010
π
Springer
π
English
β 393 KB
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
An efficient QoS routing algorithm for s
β
Noureddine Kettaf; Hafid Abouaissa; Thang Vu duong; Pascal Lorenz
π
Article
π
2006
π
Springer US
π
English
β 397 KB