60 search results - page 9 / 12 » Ant Colony Optimization for dynamic Traveling Salesman Probl... |
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
This research screens the tuning parameters of a combinatorial optimization heuristic. Specifically, it presents a Design of Experiments (DOE) approach that uses a Fractional Fac...
82
Voted
GECCO
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. This paper is concerned with a dynamic vehicle routing problem. The problem is dynamic in the sense that the time it will take to traverse each edge is uncertain. The pro...
FLAIRS
2006
14 years 11 months ago
2006
There exist a number of algorithms that can solve dynamic constraint satisfaction/optimization problems (DynCSPs or DynCOPs). Because of the large variety in the characteristics o...
146
click to vote
NABIC
2010
14 years 4 months ago
2010
Abstract--Ant Colony Optimization (ACO) is a problemsolving technique that was inspired by the related research on the behavior of real-world ant colony. In the domain of Network-o...
IPPS
2007
IEEE
15 years 3 months ago
2007
IEEE
We address the problem of optimizing the distribution of partially replicated databases over a computer network. Replication is used to increase data availability in the presence ...