Sciweavers

203 search results - page 3 / 41
» Biogeography Migration Algorithm for Traveling Salesman Prob...
Sort
View
ICICIC
2006
IEEE
14 years 28 days ago
An Ant Colony Optimization Algorithm for Multiple Travelling Salesman Problem
Multiple travelling salesman problem (MTSP) is a typical computationally complex combinatorial optimization problem,which is an extension of the famous travelling salesman problem...
Pan Junjie, Wang Dingwei
CORR
2008
Springer
139views Education» more  CORR 2008»
13 years 7 months ago
Generalized Traveling Salesman Problem Reduction Algorithms
The generalized traveling salesman problem (GTSP) is an extension of the well-known traveling salesman problem. In GTSP, we are given a partition of cities into groups and we are ...
Gregory Gutin, Daniel Karapetyan
ANTSW
2010
Springer
13 years 5 months ago
Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem
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...
Timo Kötzing, Frank Neumann, Heiko Rögli...
WADS
2007
Springer
189views Algorithms» more  WADS 2007»
14 years 1 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