Sciweavers

62 search results - page 1 / 13
» Orthogonal Methods Based Ant Colony Search for Solving Conti...
Sort
View
JCST
2008
134views more  JCST 2008»
13 years 3 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
GECCO
2003
Springer
148views Optimization» more  GECCO 2003»
13 years 8 months ago
Ant Colony Programming for Approximation Problems
Abstract. A method of automatic programming, called genetic programming, assumes that the desired program is found by using a genetic algorithm. We propose an idea of ant colony pr...
Mariusz Boryczka, Zbigniew J. Czech, Wojciech Wiec...
TEC
2002
163views more  TEC 2002»
13 years 3 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
ECAI
2000
Springer
13 years 7 months ago
Solving Permutation Constraint Satisfaction Problems with Artificial Ants
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...
Christine Solnon
IPPS
2006
IEEE
13 years 9 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...