Sciweavers

Share
96 search results - page 1 / 20
» A Multi-start Heuristic Algorithm for the Generalized Travel...
Sort
View
GECCO
2000
Springer
120views Optimization» more  GECCO 2000»
9 years 6 months ago
An Improved Adaptive Multi-Start Approach to Finding Near-Optimal Solutions to the Euclidean TSP
We present an "adaptive multi-start" genetic algorithm for the Euclidean traveling salesman problem that uses a population of tours locally optimized by the Lin-Kernigha...
Dan Bonachea, Eugene Ingerman, Joshua Levy, Scott ...
GECCO
2011
Springer
374views Optimization» more  GECCO 2011»
8 years 5 months ago
A hybrid heuristic approach for solving the generalized traveling salesman problem
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...
Petrica C. Pop, Serban Iordache
EOR
2006
118views more  EOR 2006»
9 years 2 months ago
A random-key genetic algorithm for the generalized traveling salesman problem
The Generalized Traveling Salesman Problem is a variation of the well known Traveling Salesman Problem in which the set of nodes is divided into clusters; the objective is to find...
Lawrence V. Snyder, Mark S. Daskin
COLOGNETWENTE
2008
9 years 3 months ago
A Multi-start Heuristic Algorithm for the Generalized Traveling Salesman Problem
Valentina Cacchiani, Albert Einstein Fernandez Mur...
GECCO
2007
Springer
289views Optimization» more  GECCO 2007»
9 years 8 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,...
books