178 search results - page 2 / 36 » Improving Ant Colony Optimization Algorithms for Solving Tra... |
ICICIC
2006
IEEE
13 years 11 months ago
2006
IEEE
Multiple travelling salesman problem (MTSP) is a typical computationally complex combinatorial optimization problem,which is an extension of the famous travelling salesman problem...
SWARM
2012
SPRINGER
12 years 25 days ago
2012
SPRINGER
Applying parameter adaptation means operating on parameters of an algorithm while it is tackling an instance. For ant colony optimization, several parameter adaptation methods have...
AEI
2004
13 years 5 months ago
2004
This research applies the meta-heuristic method of ant colony optimization (ACO) to an established set of vehicle routing problems (VRP). The procedure simulates the decision-maki...
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. ...
ICML
1995
IEEE
14 years 6 months ago
1995
IEEE
In this paper we introduce Ant-Q, a family of algorithms which present many similarities with Q-learning (Watkins, 1989), and which we apply to the solution of symmetric and asymm...