238 search results - page 4 / 48 » Parallel Ant Colonies for Combinatorial Optimization Problem... |
ECAI
2000
Springer
13 years 10 months ago
2000
Springer
Abstract. We describe in this paper Ant-P-solver, a generic constraint solver based on the Ant Colony Optimization (ACO) metaheuristic. The ACO metaheuristic takes inspiration on t...
LSSC
2007
Springer
14 years 12 days ago
2007
Springer
The Ant Colony Optimization (ACO) algorithms are being applied successfully to a wide range of problems. ACO algorithms could be good alternatives to existing algorithms for hard c...
ICICIC
2006
IEEE
14 years 9 days ago
2006
IEEE
Multiple travelling salesman problem (MTSP) is a typical computationally complex combinatorial optimization problem,which is an extension of the famous travelling salesman problem...
ANTSW
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. Ant colony optimization (ACO) is a metaheuristic that produces good results for a wide range of combinatorial optimization problems. Often such successful applications us...
FGCS
2000
13 years 6 months ago
2000
This paper overviews recent work on ant algorithms, that is, algorithms for discrete optimization which took inspiration from the observation of ant colonies foraging behavior, an...