75 search results - page 2 / 15 » A Multilevel Approach to the Travelling Salesman Problem |
CEC
2010
IEEE
13 years 4 months ago
2010
IEEE
We introduce a novel combinatorial optimization problem: the one-commodity traveling salesman problem with selective pickup and delivery (1-TSP-SELPD), characterized by the fact th...
ICML
1995
IEEE
14 years 7 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...
HEURISTICS
2007
13 years 6 months ago
2007
The Traveling Tournament Problem (TTP) is a combinatorial problem that combines features from the traveling salesman problem and the tournament scheduling problem. We propose a fa...
ANTSW
2010
Springer
13 years 4 months ago
2010
Springer
Ant colony optimization (ACO) has been widely used for different combinatorial optimization problems. In this paper, we investigate ACO algorithms with respect to their runtime beh...
FUN
2007
Springer
13 years 10 months ago
2007
Springer
Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that ...