Sciweavers

436 search results - page 36 / 88
» Ant algorithms and stigmergy
Sort
View
149
Voted
APWEB
2003
Springer
15 years 11 months ago
An Ant Algorithm Based Dynamic Routing Strategy for Mobile Agents
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 ...
Dan Wang, Ge Yu, Mingsong Lv, Baoyan Song, Derong ...
CEC
2003
IEEE
15 years 9 months ago
A modified ant colony algorithm for evolutionary design of digital circuits
Evolutionary computation presents a new paradigm shift in hardware design and synthesis. According to this paradigm, hardware design is pursued by deriving inspiration from biologi...
Mostafa Abd-El-Barr, Sadiq M. Sait, Bambang A. B. ...
ICICIC
2006
IEEE
16 years 4 days ago
An Ant Colony Optimization Algorithm for Multiple Travelling Salesman Problem
Multiple travelling salesman problem (MTSP) is a typical computationally complex combinatorial optimization problem,which is an extension of the famous travelling salesman problem...
Pan Junjie, Wang Dingwei
GECCO
2007
Springer
241views Optimization» more  GECCO 2007»
16 years 7 days 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...
AAIM
2005
Springer
110views Algorithms» more  AAIM 2005»
15 years 11 months ago
Dynamically Updating the Exploiting Parameter in Improving Performance of Ant-Based Algorithms
Abstract. The utilization of pseudo-random proportional rule to balance between the exploitation and exploration of the search process was shown in Ant Colony System (ACS) algorith...
Hoang Trung Dinh, Abdullah Al Mamun, Hieu T. Dinh