๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An Ant colony optimization approach for binary knapsack problem under fuzziness

โœ Scribed by Changdar, C.; Mahapatra, G.S.; Pal, R.K.

Book ID
121183723
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
377 KB
Volume
223
Category
Article
ISSN
0096-3003

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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