AnasNeumann / pyTSP

A simple Travelling Salesman Problem to solve (optimize) with Python and IBM Cplex - For Learning Purposes

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

TSP

A simple Travelling Salesman Problem to solve (optimize) with Python and IBM Cplex for learning purposes

"Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?"

(Wikipedia.org, 2023) - https://en.wikipedia.org/wiki/Travelling_salesman_problem

problem-studied

About

A simple Travelling Salesman Problem to solve (optimize) with Python and IBM Cplex - For Learning Purposes

License:MIT License


Languages

Language:Jupyter Notebook 100.0%