Sciweavers

659 search results - page 24 / 132
» Data mining with an ant colony optimization algorithm
Sort
View
ANTSW
2010
Springer
14 years 9 months ago
Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem
Ant colony optimization (ACO) has been widely used for different combinatorial optimization problems. In this paper, we investigate ACO algorithms with respect to their runtime beh...
Timo Kötzing, Frank Neumann, Heiko Rögli...
IPPS
2006
IEEE
15 years 5 months ago
Ant stigmergy on the grid: optimizing the cooling process in continuous steel casting
The paper presents a new distributed metaheuristic algorithm in an optimal control problem related to the cooling process in the continuous casting of steel. The optimization task...
Peter Korosec, Jurij Silc, Bogdan Filipic, Erkki L...
GECCO
2007
Springer
183views Optimization» more  GECCO 2007»
15 years 5 months ago
Screening the parameters affecting heuristic performance
This research screens the tuning parameters of a combinatorial optimization heuristic. Specifically, it presents a Design of Experiments (DOE) approach that uses a Fractional Fac...
Enda Ridge, Daniel Kudenko
GECCO
2007
Springer
241views Optimization» more  GECCO 2007»
15 years 5 months ago
Binary ant algorithm
When facing dynamic optimization problems the goal is no longer to find the extrema, but to track their progression through the space as closely as possible. Over these kind of ov...
Carlos Fernandes, Agostinho C. Rosa, Vitorino Ramo...
AINA
2006
IEEE
15 years 5 months ago
Partitioned optimization algorithms for multiple sequence alignment
Multiple sequence alignment is an important and difficult problem in molecular biology and bioinformatics. In this paper, we propose a partitioning approach that significantly impr...
Yixin Chen, Yi Pan, Juan Chen, Wei Liu, Ling Chen