https://github.com/ncordon/tsp

Different approaches for the Travelling Salesman Problem
https://github.com/ncordon/tsp

Last synced: about 1 year ago
JSON representation

Different approaches for the Travelling Salesman Problem

• Host: GitHub
• URL: https://github.com/ncordon/tsp
• Owner: ncordon
• License: mit
• Created: 2016-05-01T02:51:19.000Z (about 10 years ago)
• Default Branch: master
• Last Pushed: 2016-07-16T03:51:59.000Z (almost 10 years ago)
• Last Synced: 2025-02-10T06:13:06.379Z (over 1 year ago)
• Language: Jupyter Notebook
• Size: 6.06 MB
• Stars: 0
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

          
# Travelling Salesman Problem

Comparison between two different approaches for solving the Travelling Salesman Problem implemented from scratch:

* Simulaed Annealing

* Tabu Search

# License

GNU licensed

# Usage

```python

tsp.py

```

or

```python

tsp.ipynb

```

The comparison has been made taking the same number of iterations for each metaheuristic. The documentation is available in `tsp.tex`, and `presentacion.tex` contains a presentation of results, both in Spanish. The selected operator for getting new solutions has been 2-opt of edges.

![Simulated Annealing on Berlin52](https://github.com/NCordon/tsp/blob/master/images/berlin52sa.png)

![Tabu Search on Berlin52](https://github.com/NCordon/tsp/blob/master/images/berlin52ts.png)