Solving Travelling Salesman Problem (TSP) Using Genetic Algorithm

The travelling salesman problem (TSP) asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city and returns to the origin city? [1] I tried to implement genetic algorithm in Python to solving this problem.

Result in 100 generation for 14 cities

Getting Started

Dependencies

This project requires the following dependencies:

Usage

Run TSP.py.

References

[1] Wikipedia

About

Solving Travelling Salesman Problem (TSP) Using Genetic Algorithm

Languages

Language:Python 97.4%Language:C 1.5%Language:C++ 0.3%Language:Cython 0.3%Language:JavaScript 0.1%Language:Jupyter Notebook 0.1%Language:Fortran 0.0%Language:PowerShell 0.0%Language:CSS 0.0%Language:HTML 0.0%Language:Shell 0.0%Language:Jinja 0.0%