Sciweavers

6 search results - page 1 / 2
» Rigorous Analyses for the Combination of Ant Colony Optimiza...
Sort
View
ANTSW
2008
Springer
13 years 6 months ago
Rigorous Analyses for the Combination of Ant Colony Optimization and Local Search
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...
Frank Neumann, Dirk Sudholt, Carsten Witt
TEC
2002
163views more  TEC 2002»
13 years 4 months ago
Ants can solve constraint satisfaction problems
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...
Christine Solnon
ANTSW
2004
Springer
13 years 10 months ago
A Comparison Between ACO Algorithms for the Set Covering Problem
Abstract. In this paper we present a study of several Ant Colony Optimization (ACO) algorithms for the Set Covering Problem. In our computational study we emphasize the influence ...
Lucas Lessing, Irina Dumitrescu, Thomas Stütz...
AUSAI
2004
Springer
13 years 10 months ago
An ACO Algorithm for the Most Probable Explanation Problem
We describe an Ant Colony Optimization (ACO) algorithm, ANT-MPE, for the most probable explanation problem in Bayesian network inference. After tuning its parameters settings, we c...
Haipeng Guo, Prashanth R. Boddhireddy, William H. ...
GECCO
2004
Springer
152views Optimization» more  GECCO 2004»
13 years 10 months ago
Ant System for the k-Cardinality Tree Problem
This paper gives an algorithm for finding the minimum weight tree having k edges in an edge weighted graph. The algorithm combines a search and optimization technique based on phe...
Thang Nguyen Bui, Gnanasekaran Sundarraj