The maximum scatter TSP on a regular grid

From MaRDI portal



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 mimesn-grid. The new algorithm extscWeave(m,n) takes linear time to compute an optimal tour in some cases. It is asymptotically optimal and a fracsqrt105-approximation for the 3imes4-grid, which is the worst case.











This page was built for publication: The maximum scatter TSP on a regular grid

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4596195)