26 search results - page 1 / 6 » A Hybrid Genetic Algorithm for the Traveling Salesman Proble... |
PPSN
2010
Springer
13 years 3 months ago
2010
Springer
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...
GECCO
2011
Springer
12 years 8 months ago
2011
Springer
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...
CEC
2010
IEEE
13 years 5 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
2006
13 years 4 months ago
2006
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...
GECCO
2008
Springer
13 years 5 months ago
2008
Springer
The correct choice of an evolutionary algorithm, a genetic representation for the problem being solved (as well as their associated variation operators) and the appropriate values...