9 search results - page 1 / 2 » Solving geometric TSP with ants |
GECCO
2005
Springer
13 years 10 months ago
2005
Springer
This paper presents an ant-based approach for solving the Traveling Salesman Problem (TSP). Novel concepts of this algorithm that distinguish it from the other heuristics are the ...
SAGA
2005
Springer
13 years 10 months ago
2005
Springer
Two general-purpose metaheuristic algorithms for solving multiobjective stochastic combinatorial optimization problems are introduced: SP-ACO (based on the Ant Colony Optimization ...
PREMI
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. The previously proposed cunning ant system (cAS), a variant of the ACO algorithm, worked well on the TSP and the results showed that the cAS could be one of the most prom...
ASIAN
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. Ant Colony Optimization (ACO) is a paradigm that employs a set of cooperating agents to solve functions or obtain good solutions for combinatorial optimization problems. ...
GECCO
2008
Springer
13 years 6 months ago
2008
Springer
This paper merges hierarchical reinforcement learning (HRL) with ant colony optimization (ACO) to produce a HRL ACO algorithm capable of generating solutions for large domains. Th...