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

A New Ant Colony Optimization Algorithm for the Lower Bound of Sum Coloring Problem

โœ Scribed by Sidi Mohamed Douiri, Souad Elbernoussi

Book ID
113069875
Publisher
Springer Netherlands
Year
2012
Tongue
English
Weight
296 KB
Volume
11
Category
Article
ISSN
1570-1166

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A new hybrid ant colony optimization alg
A new hybrid ant colony optimization algorithm for the vehicle routing problem
โœ Xiaoxia Zhang; Lixin Tang ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 251 KB

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