Sciweavers

48 search results - page 6 / 10
» Runtime Analysis of a Simple Ant Colony Optimization Algorit...
Sort
View
ATAL
2007
Springer
14 years 27 days ago
Convergence and rate of convergence of a simple ant model
We present a simple ant model that solves a discrete foraging problem. We describe simulations and provide a complete convergence analysis: we show that the ant population compute...
Amine M. Boumaza, Bruno Scherrer
ALIFE
2000
13 years 6 months ago
Pattern Formation and Optimization in Army Ant Raids
Army ant colonies display complex foraging raid patterns involving thousands of individuals communicating through chemical trails. In this article we explore, by means of a simple ...
Ricard V. Solé, Eric Bonabeau, Jordi Delgad...
ADHOC
2008
183views more  ADHOC 2008»
13 years 6 months ago
On ant routing algorithms in ad hoc networks with critical connectivity
This paper shows a novel self-organizing approach for routing datagrams in ad hoc networks, called Distributed Ant Routing (DAR). This approach belongs to the class of routing alg...
Laura Rosati, Matteo Berioli, Gianluca Reali
ICALP
2003
Springer
13 years 12 months ago
Analysis of a Simple Evolutionary Algorithm for Minimization in Euclidean Spaces
Although evolutionary algorithms (EAs) are widely used in practical optimization, their theoretical analysis is still in its infancy. Up to now results on the (expected) runtime ar...
Jens Jägersküpper
COR
2007
80views more  COR 2007»
13 years 6 months ago
A MAX-MIN ant system for unconstrained multi-level lot-sizing problems
In this paper we present an ant-based algorithm for solving unconstrained multi-level lot-sizing problems called ant system for multi-level lot-sizing algorithm (ASMLLS). We apply...
Rapeepan Pitakaso, Christian Almeder, Karl F. Doer...