{"id":20865381,"url":"https://github.com/strubt/ftpoptimiztspchallenge","last_synced_at":"2025-08-08T05:43:52.541Z","repository":{"id":93693877,"uuid":"114130759","full_name":"StrubT/FTPOptimizTSPChallenge","owner":"StrubT","description":"Optimization – TSP Challenge","archived":false,"fork":false,"pushed_at":"2017-12-20T13:49:52.000Z","size":839,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"master","last_synced_at":"2025-03-12T15:14:17.647Z","etag":null,"topics":["challenge","travelling-salesman-problem","tsp","university-project"],"latest_commit_sha":null,"homepage":null,"language":"R","has_issues":false,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/StrubT.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2017-12-13T14:27:58.000Z","updated_at":"2017-12-17T23:11:52.000Z","dependencies_parsed_at":"2023-06-01T09:46:41.196Z","dependency_job_id":null,"html_url":"https://github.com/StrubT/FTPOptimizTSPChallenge","commit_stats":null,"previous_names":[],"tags_count":1,"template":false,"template_full_name":null,"purl":"pkg:github/StrubT/FTPOptimizTSPChallenge","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/StrubT%2FFTPOptimizTSPChallenge","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/StrubT%2FFTPOptimizTSPChallenge/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/StrubT%2FFTPOptimizTSPChallenge/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/StrubT%2FFTPOptimizTSPChallenge/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/StrubT","download_url":"https://codeload.github.com/StrubT/FTPOptimizTSPChallenge/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/StrubT%2FFTPOptimizTSPChallenge/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":269372641,"owners_count":24406273,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","status":"online","status_checked_at":"2025-08-08T02:00:09.200Z","response_time":72,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["challenge","travelling-salesman-problem","tsp","university-project"],"created_at":"2024-11-18T05:48:50.171Z","updated_at":"2025-08-08T05:43:52.518Z","avatar_url":"https://github.com/StrubT.png","language":"R","funding_links":[],"categories":[],"sub_categories":[],"readme":"# FTPOptimizTSPChallenge\n\nThis repository contains the code written as part of the travelling salesman problem (TSP) challenge\nin the fundamental theoretical principle (FTP) module on optimisation in the autumn term 2017/18.\nThis module is part of the Master of Science in Engineering (MSE),\na joint degree programme by all seven public Universities of Applied Sciences of Switzerland.\n\n## Problem Description and Result\n\nThe goal is to find the shortest route visiting all [100 random points](00_data/points.csv) exactly once and returing to the start.\nThe [50 shortest routes found](00_data/routes.csv) are also included in this repository.\n\nThe winning route has a distance of just over `9.5` (`x, y ∈ 0..1`).\n\n|             Original Route            |            Winning Route            |\n|:-------------------------------------:|:-----------------------------------:|\n| ![original route](original-route.png) | ![winning route](winning-route.png) |\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fstrubt%2Fftpoptimiztspchallenge","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fstrubt%2Fftpoptimiztspchallenge","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fstrubt%2Fftpoptimiztspchallenge/lists"}