Sciweavers

201 search results - page 16 / 41
» Algorithms for the On-Line Quota Traveling Salesman Problem
Sort
View
ESA
1998
Springer
145views Algorithms» more  ESA 1998»
13 years 12 months ago
Moving-Target TSP and Related Problems
Previous literature on the Traveling Salesman Problem (TSP) assumed that the sites to be visited are stationary. Motivated by practical applications, we introduce a time-dependent ...
Christopher S. Helvig, Gabriel Robins, Alexander Z...
EOR
2000
115views more  EOR 2000»
13 years 7 months ago
An effective implementation of the Lin-Kernighan traveling salesman heuristic
This report describes an implementation of the Lin-Kernighan heuristic, one of the most successful methods for generating optimal or nearoptimal solutions for the symmetric travel...
Keld Helsgaun
HPCC
2005
Springer
14 years 1 months ago
Parallel Branch and Bound Algorithms on Internet Connected Workstations
By the use of the GRIBB software for distributed computing across the Internet, we are investigating the obstacles and the potential for efficient parallelization of Branch and Bou...
Randi Moe, Tor Sørevik
DISOPT
2010
138views more  DISOPT 2010»
13 years 7 months ago
The Delivery Man Problem with time windows
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...
Géraldine Heilporn, Jean-François Co...
GECCO
2005
Springer
143views Optimization» more  GECCO 2005»
14 years 1 months ago
Solving geometric TSP with ants
This paper presents an ant-based approach for solving the Traveling Salesman Problem (TSP). Novel concepts of this algorithm that distinguish it from the other heuristics are the ...
Thang Nguyen Bui, Mufit Colpan