1197 search results - page 3 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
APWEB
2003
Springer
14 years 1 months ago
2003
Springer
Routing strategy is one of the most important aspects in a mobile agent system, which is a complex combinatorial problem. Most of current mobile agent systems adopt static routing ...
FGCS
2000
13 years 7 months ago
2000
Ant colonies, and more generally social insect societies, are distributed systems that, in spite of the simplicity of their individuals, present a highly structured social organiz...
CEC
2009
IEEE
14 years 2 months ago
2009
IEEE
— Many real-world problems are dynamic, requiring an optimization algorithm which is able to continuously track a changing optimum over time. In this paper, we present a stigmerg...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
Modern vehicles possess an increasing number of software and hardware components that are integrated in electronic control units (ECUs). Finding an optimal allocation for all comp...
CEC
2007
IEEE
13 years 12 months ago
2007
IEEE
In this paper, we present an ant system algorithm variant designed to solve the job shop scheduling problem. The proposed approach is based on a recent biological study which showe...