✦ LIBER ✦

An improved ant colony optimization based algorithm for the capacitated arc routing problem

✍ Scribed by Luís Santos; João Coutinho-Rodrigues; John R. Current

Book ID: 116937532
Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 338 KB
Volume: 44
Category: Article
ISSN: 0191-2615
DOI: 10.1016/j.trb.2009.07.004

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Hybrid Ant Colony Optimization Algorit

A Hybrid Ant Colony Optimization Algorithm for the Extended Capacitated Arc Routing Problem

✍ Li-Ning Xing; Rohlfshagen, P.; Ying-Wu Chen; Xin Yao 📂 Article 📅 2011 🏛 IEEE 🌐 English ⚖ 728 KB

An improved ant colony optimization for

An improved ant colony optimization for vehicle routing problem

✍ Bin Yu; Zhong-Zhen Yang; Baozhen Yao 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 503 KB

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

An improved heuristic for the capacitate

An improved heuristic for the capacitated arc routing problem

✍ Luís Santos; João Coutinho-Rodrigues; John R. Current 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 179 KB

BRKGA Algorithm for the Capacitated Arc

BRKGA Algorithm for the Capacitated Arc Routing Problem

✍ C. Martinez; I. Loiseau; M.G.C. Resende; S. Rodriguez 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 750 KB

Decomposition-Based Memetic Algorithm fo

Decomposition-Based Memetic Algorithm for Multiobjective Capacitated Arc Routing Problem

✍ Yi Mei; Ke Tang; Xin Yao 📂 Article 📅 2011 🏛 IEEE 🌐 English ⚖ 1019 KB