✦ LIBER ✦

A selfish routing based network improvement problem

✍ Scribed by Binwu Zhang; Shu-Cherng Fang

Book ID: 107347293
Publisher: Academy of Mathematics and Systems Science, Chinese Academy of Sciences
Year: 2011
Tongue: English
Weight: 242 KB
Volume: 24
Category: Article
ISSN: 1009-6124
DOI: 10.1007/s11424-011-8156-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improvement heuristics for the Vehicle R

Improvement heuristics for the Vehicle Routing Problem based on simulated annealing

✍ Alex Van Breedam 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 802 KB

A Network Improvement Problem Under Diff

A Network Improvement Problem Under Different Norms

✍ J.Z. Zhang; X.G. Yang; M.C. Cai 📂 Article 📅 2004 🏛 Springer US 🌐 English ⚖ 128 KB

A network-based VPN architecture using v

A network-based VPN architecture using virtual routing

✍ Zhang Bao-liang; Hu Han-ping; Wu Xiao-gang; Kong Tao 📂 Article 📅 2005 🏛 Wuhan University 🌐 English ⚖ 426 KB

The solution of routing problem based on

The solution of routing problem based on neural network and immunological algorithms

✍ L. G. Komartsova; Y. N. Lavrenkov 📂 Article 📅 2011 🏛 Allerton Press, Inc. 🌐 English ⚖ 144 KB

A reliability-based network design probl

A reliability-based network design problem

✍ Piya Chootinan; S. C. Wong; Anthony Chen 📂 Article 📅 2005 🏛 Institute for Transportation Inc. 🌐 English ⚖ 1020 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