42 search results - page 7 / 9 » A Compressed-Annealing Heuristic for the Traveling Salesman ... |
IPPS
2005
IEEE
14 years 1 months ago
2005
IEEE
The Chained Lin-Kernighan algorithm (CLK) is one of the best heuristics to solve Traveling Salesman Problems (TSP). In this paper a distributed algorithm is proposed, were nodes i...
CPAIOR
2006
Springer
13 years 11 months ago
2006
Springer
We define the timetable constrained distance minimization problem (TCDMP) which is a sports scheduling problem applicable for tournaments where the total travel distance must be mi...
COMPSAC
2004
IEEE
13 years 11 months ago
2004
IEEE
While meta-heuristics are effective for solving large-scale combinatorial optimization problems, they result from time-consuming trial-and-error algorithm design tailored to speci...
DCOSS
2011
Springer
12 years 7 months ago
2011
Springer
Abstract—We first present a problem called precedence constrained two traveling salesman (PC2TSP). We propose a nearoptimal heuristic to PC2TSP to generate tours by clustering p...
TASE
2010
IEEE
13 years 2 months ago
2010
IEEE
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...