Sciweavers

613 search results - page 1 / 123
» Generalized Traveling Salesman Problem Reduction Algorithms
Sort
View
CORR
2008
Springer
139views Education» more  CORR 2008»
13 years 4 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
EVOW
2005
Springer
13 years 10 months ago
Property Analysis of Symmetric Travelling Salesman Problem Instances Acquired Through Evolution
We show how an evolutionary algorithm can successfully be used to evolve a set of difficult to solve symmetric travelling salesman problem instances for two variants of the Lin-Ker...
Jano I. van Hemert
COCOON
2007
Springer
13 years 10 months ago
An Improved Exact Algorithm for Cubic Graph TSP
It is shown that the traveling salesman problem for graphs
Kazuo Iwama, Takuya Nakashima
GECCO
2007
Springer
289views Optimization» more  GECCO 2007»
13 years 10 months ago
A discrete particle swarm optimization algorithm for the generalized traveling salesman problem
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...
Mehmet Fatih Tasgetiren, Ponnuthurai N. Suganthan,...
ICICIC
2006
IEEE
13 years 10 months 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