https://github.com/s-matke/ts-oi
Experimental project solving Travelling Salesman Problem via genetic algorithm, hungarian method, etc. University project for class Operations Research.
https://github.com/s-matke/ts-oi
branch-bound-algorithm brute-force genetic-algorithm hungarian-algorithm nearest-neighbors operations-research python travelling-salesman-problem
Last synced: about 2 months ago
JSON representation
Experimental project solving Travelling Salesman Problem via genetic algorithm, hungarian method, etc. University project for class Operations Research.
- Host: GitHub
- URL: https://github.com/s-matke/ts-oi
- Owner: s-matke
- Created: 2023-02-01T14:38:09.000Z (over 2 years ago)
- Default Branch: main
- Last Pushed: 2023-04-03T11:55:52.000Z (about 2 years ago)
- Last Synced: 2025-02-04T15:49:30.169Z (4 months ago)
- Topics: branch-bound-algorithm, brute-force, genetic-algorithm, hungarian-algorithm, nearest-neighbors, operations-research, python, travelling-salesman-problem
- Language: Python
- Homepage:
- Size: 22.5 KB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Traveling Salesman Problem
This repository contains a Python implementation of several algorithms to solve the Traveling Salesman Problem (TSP).
## Problem Description
The Traveling Salesman Problem is a classic problem in computer science and optimization. Given a list of cities and the distances between each pair of cities, the problem is to find the shortest possible route that visits each city exactly once and returns to the starting city.
## Algorithms
This project implements the following algorithms to solve the TSP:
- Brute Force Algorithm
- Nearest Neighbor Algorithm
- Hungarian Algorithm
- Genetic Algorithm
- Branch and Bound Algorithm
Each algorithm is implemented as a separate Python module.
## Usage
To use the algorithms, simply run the `.py` script. Functions within each algorithm's python file can be imported and used with custom matrices that represent a travelling salesman problem.
## Requirements
This project requires Python 3.8+ and the following package:
- NumPy