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

An improved ant colony optimization algorithm for solving a complex combinatorial optimization problem

โœ Scribed by Jingan Yang; Yanbin Zhuang

Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
371 KB
Volume
10
Category
Article
ISSN
1568-4946

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

MOSA method: a tool for solving multiobj
MOSA method: a tool for solving multiobjective combinatorial optimization problems
โœ E.L. Ulungu; J. Teghem; P.H. Fortemps; D. Tuyttens ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 189 KB ๐Ÿ‘ 2 views

The success of modern heuristics (Simulated Annealing (S.A.), Tabu Search, Genetic Algorithms, . . . ) in solving classical combinatorial optimization problems has drawn the attention of the research community in multicriteria methods. In fact, for large-scale problems, the simultaneous difficultie