42 search results - page 1 / 9 » A Compressed-Annealing Heuristic for the Traveling Salesman ... |
INFORMS
2007
13 years 5 months ago
2007
DISOPT
2010
13 years 5 months ago
2010
In this paper, a variant of the Traveling Salesman Problem with Time Windows is considered, which consists in minimizing the sum of travel durations between a depot and several cu...
GECCO
2009
Springer
13 years 9 months ago
2009
Springer
The Vehicle Routing Problem can be seen as a fusion of two well known combinatorial problems, the Travelling Salesman Problem and Bin Packing Problem. It has several variants, the...
EVOW
2011
Springer
2011
Springer
Optimization of the Nested Monte-Carlo Algorithm on the Traveling Salesman Problem with Time Windows
12 years 8 months ago
The traveling salesman problem with time windows is known to be a really difficult benchmark for optimization algorithms. In this paper, we are interested in the minimization of th...
NETWORKS
2000
13 years 4 months ago
2000
