Sciweavers

30 search results - page 2 / 6
» An improved discrete bat algorithm for symmetric and asymmet...
Sort
View
SODA
2010
ACM
168views Algorithms» more  SODA 2010»
14 years 2 months ago
An O(log n/log log n)-approximation algorithm for the asymmetric traveling salesman problem
We consider the Asymmetric Traveling Salesman problem for costs satisfying the triangle inequality. We derive a randomized algorithm which delivers a solution within a factor O(lo...
Arash Asadpour, Michel X. Goemans, Aleksander Madr...
WADS
2007
Springer
189views Algorithms» more  WADS 2007»
13 years 11 months ago
35/44-Approximation for Asymmetric Maximum TSP with Triangle Inequality
We describe a new approximation algorithm for the asymmetric maximum traveling salesman problem (ATSP) with triangle inequality. Our algorithm achieves approximation factor 35/44 ...
Lukasz Kowalik, Marcin Mucha
ICML
1995
IEEE
14 years 5 months ago
Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem
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...
Luca Maria Gambardella, Marco Dorigo
CAAN
2006
Springer
13 years 8 months ago
Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP
In this paper we improve the quality of a recently suggested class of construction heuristics for the Asymmetric Traveling Salesman Problem (ATSP), namely the Contract-or-Patch heu...
Boris Goldengorin, Gerold Jäger, Paul Molitor
COCOA
2008
Springer
13 years 6 months ago
Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order
We introduce a new combinatorial optimization problem, which is a generalization of the Traveling Salesman Problem (TSP) and which we call Traveling Salesman Problem of Second Orde...
Gerold Jäger, Paul Molitor