this m file can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once)

Notes:

1. Input error checking included

2. Inputs can be specified in any order, so long as the parameter pairs are specified as a parameter , value