Sciweavers

201 search results - page 5 / 41
» Algorithms for the On-Line Quota Traveling Salesman Problem
Sort
View
CIAC
2010
Springer
282views Algorithms» more  CIAC 2010»
13 years 11 months ago
Improved Approximations for TSP with Simple Precedence Constraints
In this paper, we consider variants of the traveling salesman problem with precedence constraints. We characterize hard input instances for Christofides' algorithm and Hoogeve...
Hans-Joachim Boeckenhauer, Ralf Klasing, Tobias Mo...
IPPS
1998
IEEE
13 years 12 months ago
A Comparative Study of Five Parallel Genetic Algorithms Using the Traveling Salesman Problem
Parallel genetic algorithms (PGAs) have been developed to reduce the large execution times that are associated with serial genetic algorithms (SGAs). They have also been used to s...
Lee Wang, Anthony A. Maciejewski, Howard Jay Siege...
GECCO
2011
Springer
374views Optimization» more  GECCO 2011»
12 years 11 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
IPCO
2001
184views Optimization» more  IPCO 2001»
13 years 9 months ago
Approximation Algorithms for the Minimum Bends Traveling Salesman Problem
Problem (Extended Abstract) Cliff Stein David P. Wagner Dartmouth College Computer Science Technical Report TR2000-367 May 9, 2000 The problem of traversing a set of points in the...
Clifford Stein, David P. Wagner
PPSN
2010
Springer
13 years 6 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