Nearest Neighbor algorithm for the Travelling Salesman Problem

Computes and plots the shortest path for the random 10-city Travelling Salesman Problem.

Description

The 2-column vector contains cities' coordinates. The algorithm generates the optimal path to visit all the cities exactly once, and return to the starting city.

The algorithm has its limitations, and based on the cities' distribution on the map it may or may not give the optimal solution.

It resolves the problem of the equally distant cities, that some other submitted files had.

• MATLAB release: MATLAB 7.7 (R2008b)