Sciweavers

208 search results - page 5 / 42
» Evolutionary algorithms and multi-objectivization for the tr...
Sort
View
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
MP
2010
145views more  MP 2010»
13 years 6 months ago
The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm
The Traveling Salesman Problem with Pickup and Delivery (TSPPD) is defined on a graph containing pickup and delivery vertices between which there exists a one-toone relationship. ...
Irina Dumitrescu, Stefan Ropke, Jean-Franço...
EOR
2006
118views more  EOR 2006»
13 years 7 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
CIAC
2006
Springer
160views Algorithms» more  CIAC 2006»
13 years 11 months ago
An Approximation Algorithm for a Bottleneck Traveling Salesman Problem
Consider a truck running along a road. It picks up a load Li at point i and delivers it at i, carrying at most one load at a time. The speed on the various parts of the road in on...
Ming-Yang Kao, Manan Sanghi