##Input Input of this algorithm is a 2D array of coordinate of cities. For example: coordinate = np.array([[1,2], [30,21], [56,23], [8,18], [20,50], [3,4], [11,6], [6 ...

The Traveling Salesman Problem, deals with creating the efficient path that a salesman would take ... it is a foundation for studying general methods that are applied to a wide range of optimization ...

Simulated annealing uses the objective function of an optimization problem instead of the energy of a material. Implementation of SA is surprisingly simple. The algorithm is basically hill-climbing ...