Script which solves the Travelling Salesman Problem (TSP) for rectangular grid

Script which solves the Travelling Salesman Problem (TSP) for rectangular grid

The script MinimizeSuccessiveTilts.m solves the Travelling Salesman Problem (TSP) for rectangular grid. After solution the script will display interactively the result of solution. In this script Nx and Ny are integer numbers for dimensions of the grid. i0 and j0 are the starting points for salesman on the rectangular grid (x and y coordinates). After execution the script will print the elapsed time for solution itself, the edge will the maximum length of the step between two successive cites on the grid, the algorithm which gives the best result and the total elapsed time. The solution is based on heuristic search. The script can be adjusted in such a way that it minimizes the total length of the path. For that just uncomment one commented line in the script.