Sciweavers

275 search results - page 14 / 55
» The Attractive Traveling Salesman Problem
Sort
View
HEURISTICS
2007
139views more  HEURISTICS 2007»
14 years 9 months ago
A composite-neighborhood tabu search approach to the traveling tournament problem
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...
Luca Di Gaspero, Andrea Schaerf
ANTSW
2010
Springer
14 years 7 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...
IMCSIT
2010
14 years 7 months ago
Effectiveness of Solving Traveling Salesman Problem Using Ant Colony Optimization on Distributed Multi-Agent Middleware
Recently we have setup the goal of investigating new truly distributed forms of Ant Colony Optimization. We proposed a new distributed approach for Ant Colony Optimization (ACO) al...
Sorin Ilie, Costin Badica
IJCAI
2003
14 years 11 months ago
Phase Transitions of the Asymmetric Traveling Salesman
We empirically study phase transitions of the asymmetric Traveling Salesman. Using random instances of up to 1,500 cities, we show that many properties of the problem, including t...
Weixiong Zhang
ALENEX
2001
151views Algorithms» more  ALENEX 2001»
14 years 11 months ago
The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests
The purpose of this paper is to provide a preliminary report on the rst broad-based experimental comparison of modern heuristics for the asymmetric traveling salesmen problem ATSP....
Jill Cirasella, David S. Johnson, Lyle A. McGeoch,...