https://github.com/strubt/ftpoptimiztspchallenge
Optimization – TSP Challenge
https://github.com/strubt/ftpoptimiztspchallenge
challenge travelling-salesman-problem tsp university-project
Last synced: 2 months ago
JSON representation
Optimization – TSP Challenge
- Host: GitHub
- URL: https://github.com/strubt/ftpoptimiztspchallenge
- Owner: StrubT
- License: mit
- Created: 2017-12-13T14:27:58.000Z (over 7 years ago)
- Default Branch: master
- Last Pushed: 2017-12-20T13:49:52.000Z (over 7 years ago)
- Last Synced: 2025-01-19T08:25:27.487Z (4 months ago)
- Topics: challenge, travelling-salesman-problem, tsp, university-project
- Language: R
- Size: 819 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# FTPOptimizTSPChallenge
This repository contains the code written as part of the travelling salesman problem (TSP) challenge
in the fundamental theoretical principle (FTP) module on optimisation in the autumn term 2017/18.
This module is part of the Master of Science in Engineering (MSE),
a joint degree programme by all seven public Universities of Applied Sciences of Switzerland.
## Problem Description and Result
The goal is to find the shortest route visiting all [100 random points](00_data/points.csv) exactly once and returing to the start.
The [50 shortest routes found](00_data/routes.csv) are also included in this repository.
The winning route has a distance of just over `9.5` (`x, y ∈ 0..1`).
| Original Route | Winning Route |
|:-------------------------------------:|:-----------------------------------:|
|  |  |