Sciweavers

613 search results - page 2 / 123
» Generalized Traveling Salesman Problem Reduction Algorithms
Sort
View
GECCO
2011
Springer
374views Optimization» more  GECCO 2011»
12 years 8 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
PPSN
2010
Springer
13 years 3 months ago
A Hybrid Genetic Algorithm for the Traveling Salesman Problem Using Generalized Partition Crossover
We present a hybrid Genetic Algorithm that incorporates the Generalized Partition Crossover (GPX) operator to produce an algorithm that is competitive with the state of the art for...
Darrell Whitley, Doug Hains, Adele E. Howe
EOR
2006
118views more  EOR 2006»
13 years 4 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
13 years 6 months ago
A Multi-start Heuristic Algorithm for the Generalized Traveling Salesman Problem
Valentina Cacchiani, Albert Einstein Fernandez Mur...
COCOA
2008
Springer
13 years 6 months ago
Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order
We introduce a new combinatorial optimization problem, which is a generalization of the Traveling Salesman Problem (TSP) and which we call Traveling Salesman Problem of Second Orde...
Gerold Jäger, Paul Molitor