The Maximum Scatter TSP on a Regular Grid

Titelangaben

Hoffmann, Isabella ; Kurz, Sascha ; Rambau, Jörg:
The Maximum Scatter TSP on a Regular Grid.
Bayreuth , 2015 . - 6 S.

Volltext

Link zum Volltext (externe URL):

Abstract

In the maximum scatter traveling salesman problem the
objective is to find a tour that maximizes the shortest distance
between any two consecutive nodes. This model can be applied to
manufacturing processes, particularly laser melting processes. We
extend an algorithm by Arkin et al. that yields optimal solutions
for nodes on a line to a regular (m x n)-grid. The new algorithm
WEAVE(m,n) takes linear time to compute an optimal tour in
some cases and is asymptotically optimal.