33 search results - page 2 / 7 » The Asymmetric Traveling Salesman Problem: Algorithms, Insta... |
IJCAI
2003
13 years 6 months ago
2003
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...
CEC
2010
IEEE
13 years 6 months ago
2010
IEEE
This paper proposes a two-phase hybrid approach for the travelling salesman problem (TSP). The first phase is based on a sequence based genetic algorithm (SBGA) with an embedded lo...
EOR
2000
13 years 5 months ago
2000
This report describes an implementation of the Lin-Kernighan heuristic, one of the most successful methods for generating optimal or nearoptimal solutions for the symmetric travel...
IJAIT
2010
13 years 3 months ago
2010
Many real world industrial applications involve finding a Hamiltonian path with minimum cost. Some instances that belong to this category are transportation routing problem, scan c...
GECCO
2007
Springer
13 years 11 months ago
2007
Springer
Dividing the set of nodes into clusters in the well-known traveling salesman problem results in the generalized traveling salesman problem which seeking a tour with minimum cost p...