1197 search results - page 3 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
139
Voted
APWEB
2003
Springer
15 years 10 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 ...
166
click to vote
FGCS
2000
15 years 5 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...
162
Voted
CEC
2009
IEEE
16 years 10 days 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...
175
click to vote
GECCO
2007
Springer
15 years 11 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...
155
click to vote
CEC
2007
IEEE
15 years 9 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...