GitHub#python#: Solving the traveling salesman problem with self-organizing maps

Project Title: som-tsp: Solving the Traveling Salesman Problem with Self-Organizing Maps

(Published on January 21, 2018 by Diego Vicente)

project address:

GitHub address: https://github.com/DiegoVicen/som-tsp

Original address (English): https://diego.codes/post/som-tsp/

Chinese translation (compile: Bing): https://mp.weixin.qq.com/s/O7UHeTFfcJ1FjNShVe9wtA

Running project:

Software environment: CentOS7+python3.6
Hardware environment: Inteli3+4G

There are dependent python libraries (matplotlib, numpy, pandas) in the requirements.txt of the project. If they are not installed, use pip to install them.

$ python -m pip install matplotlib
$ python -m pip install pandas
$ python -m pip install numpy

Run the project:

$ cd som-tsp
$ ls assert
fi10639.tsp  it16862.tsp  qa194.tsp  uy734.tsp
$ python src/main.py assets/qa194.tsp
Problem with 194 cities read.
Network of 1552 neurons created. Starting the iterations:
Radius has completely decayed, finishing execution at 24487 iterations
Route found of length 9983.850809148884

result:


Guess you like

Origin http://43.154.161.224:23101/article/api/json?id=326486894&siteId=291194637