Solving tsp problem by using ant colony algorithm implemented by HTML5 Canvas and JavaScript

The HTML5 provides a canvas object that facilitates drawing applications.

JavaScript can run in a browser without the need to install a specific compiler;

Based on the HTML5 and JavaScript language, applications can be written at any time, facilitating algorithmic testing.

For the TSP problem, the ant colony algorithm was written to demonstrate the algorithm, and the tsp_ant_colony_algorithm.html code is as follows:

Refresh the page to randomly generate different city points and calculate the shortest path.
The example effect is as follows:

It should be explained that the algorithm still needs to improve, in some cases, can not be guaranteed to obtain the shortest path.
Solving tsp problem by using ant colony algorithm implemented by HTML5 Canvas and JavaScript