Sciweavers

10 search results - page 1 / 2
» An Ant Algorithm with a New Pheromone Evaluation Rule for To...
Sort
View
EVOW
2000
Springer
13 years 8 months ago
An Ant Algorithm with a New Pheromone Evaluation Rule for Total Tardiness Problems
Ant Colony Optimization is an evolutionary method that has recently been applied to scheduling problems. We propose an ACO algorithm for the Single Machine Total Weighted Tardiness...
Daniel Merkle, Martin Middendorf
EMO
2003
Springer
136views Optimization» more  EMO 2003»
13 years 10 months ago
Solving Multi-criteria Optimization Problems with Population-Based ACO
In this paper a Population-based Ant Colony Optimization approach is proposed to solve multi-criteria optimization problems where the population of solutions is chosen from the set...
Michael Guntsch, Martin Middendorf
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
TEC
2002
152views more  TEC 2002»
13 years 4 months ago
Ant colony optimization for resource-constrained project scheduling
An ant colony optimization (ACO) approach for the resource-constrained project scheduling problem (RCPSP) is presented. Several new features that are interesting for ACO in general...
Daniel Merkle, Martin Middendorf, Hartmut Schmeck
IJRR
2008
92views more  IJRR 2008»
13 years 5 months ago
Robust and Efficient Covering of Unknown Continuous Domains with Simple, Ant-Like A(ge)nts
We propose a new `Mark-Ant-Walk' algorithm for robust and efficient covering of continuous domains by ant-like robots with very limited capabilities. The robots can mark plac...
Eliyahu Osherovich, Vladimir Yanovski, Israel A. W...