IPL
2008
13 years 4 months ago
2008
In this paper, we prove polynomial running time bounds for an Ant Colony Optimization (ACO) algorithm for the single-destination shortest path problem on directed acyclic graphs. ...
CN
2007
13 years 4 months ago
2007
Although the ant metaphor has been successfully applied to routing of data packets both in wireless and fixed networks, little is known yet about its appropriateness for search i...
EOR
2006
13 years 5 months ago
2006
One of the most important, common and critical management issues lies in determining the "best" project portfolio out of a given set of investment proposals. As this dec...
ECCC
2006
13 years 5 months ago
2006
Ant Colony Optimization (ACO) has become quite popular in recent years. In contrast to many successful applications, the theoretical foundation of this randomized search heuristic...
EOR
2008
13 years 5 months ago
2008
The car sequencing problem involves scheduling cars along an assembly line while satisfying capacity constraints. In this paper, we describe an Ant Colony Optimization (ACO) algor...
EOR
2008
13 years 5 months ago
2008
In this paper we present an extension of ant colony optimization (ACO) to continuous domains. We show how ACO, which was initially developed to be a metaheuristic for combinatoria...
CAS
2008
13 years 5 months ago
2008
: Ant Colony Optimization (ACO) is a class of metaheuristic algorithms sharing the common approach of constructing a solution on the basis of information provided both by a standar...
ACMDIS
2010
ACM
13 years 5 months ago
2010
ACM
Emergence is a concept that is not easy to grasp, since it contradicts our idea of central control and planning. In this work, we use a swarm of robots as a tangible tool to visua...
AIPS
2009
13 years 6 months ago
2009
In this paper a planning framework based on Ant Colony Optimization techniques is presented. It is well known that finding optimal solutions to planning problems is a very hard co...
ANTSW
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. Ant colony optimization (ACO) is a metaheuristic that produces good results for a wide range of combinatorial optimization problems. Often such successful applications us...