Sciweavers

238 search results - page 2 / 48
» Parallel Ant Colonies for Combinatorial Optimization Problem...
Sort
View
JCST
2008
134views more  JCST 2008»
13 years 4 months ago
Orthogonal Methods Based Ant Colony Search for Solving Continuous Optimization Problems
Research into ant colony algorithms for solving continuous optimization problems forms one of the most significant and promising areas in swarm computation. Although traditional an...
Xiaomin Hu, Jun Zhang, Yun Li
GPEM
2002
163views more  GPEM 2002»
13 years 4 months ago
Fast Ant Colony Optimization on Runtime Reconfigurable Processor Arrays
Ant Colony Optimization (ACO) is a metaheuristic used to solve combinatorial optimization problems. As with other metaheuristics, like evolutionary methods, ACO algorithms often sh...
Daniel Merkle, Martin Middendorf
ICEC
1996
123views more  ICEC 1996»
13 years 6 months ago
Solving Symmetric and Asymmetric TSPs by Ant Colonies
- In this paper we present ACS, a distributed algorithm for the solution of combinatorial optimization problems which was inspired by the observation of real colonies of ants. We a...
Luca Maria Gambardella, Marco Dorigo
IAT
2003
IEEE
13 years 10 months ago
Classification Rule Discovery with Ant Colony Optimization
—Ant-based algorithms or ant colony optimization (ACO) algorithms have been applied successfully to combinatorial optimization problems. More recently, Parpinelli and colleagues ...
Bo Liu, Hussein A. Abbass, Bob McKay
IMCSIT
2010
13 years 2 months ago
Effectiveness of Solving Traveling Salesman Problem Using Ant Colony Optimization on Distributed Multi-Agent Middleware
Recently we have setup the goal of investigating new truly distributed forms of Ant Colony Optimization. We proposed a new distributed approach for Ant Colony Optimization (ACO) al...
Sorin Ilie, Costin Badica