{"id":27880755,"url":"https://github.com/ccfelius/travelingsalesman","last_synced_at":"2025-08-31T20:06:51.547Z","repository":{"id":67864533,"uuid":"318232486","full_name":"ccfelius/TravelingSalesMan","owner":"ccfelius","description":"Solve the TSP problem under simplified assumptions","archived":false,"fork":false,"pushed_at":"2023-11-05T09:26:40.000Z","size":2245,"stargazers_count":1,"open_issues_count":0,"forks_count":1,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-05-05T04:43:38.087Z","etag":null,"topics":["simulated-annealing","stochastic-simulation","traveling-salesman"],"latest_commit_sha":null,"homepage":"","language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/ccfelius.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,"zenodo":null}},"created_at":"2020-12-03T15:13:17.000Z","updated_at":"2023-11-05T09:26:44.000Z","dependencies_parsed_at":null,"dependency_job_id":"431b5012-8e04-43bf-9206-28fc0a90138a","html_url":"https://github.com/ccfelius/TravelingSalesMan","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/ccfelius/TravelingSalesMan","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ccfelius%2FTravelingSalesMan","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ccfelius%2FTravelingSalesMan/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ccfelius%2FTravelingSalesMan/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ccfelius%2FTravelingSalesMan/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ccfelius","download_url":"https://codeload.github.com/ccfelius/TravelingSalesMan/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ccfelius%2FTravelingSalesMan/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":273032934,"owners_count":25034067,"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-31T02:00:09.071Z","response_time":79,"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":["simulated-annealing","stochastic-simulation","traveling-salesman"],"created_at":"2025-05-05T04:37:12.850Z","updated_at":"2025-08-31T20:06:51.506Z","avatar_url":"https://github.com/ccfelius.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"## Traveling Salesman Problem\n\n### License:\n\n[![License: MIT](https://img.shields.io/badge/License-MIT-yellow.svg)](https://opensource.org/licenses/MIT)\n\n#### Required Packages:\n- numpy\u003cbr\u003e\n- scipy.stats\u003cbr\u003e\n- math\u003cbr\u003e\n- pandas\u003cbr\u003e\n- copy \u003cbr\u003e\n- matplotlib\n\n#### Instructions:\nClone everything on your local machine. Make sure all required packages are installed and everything is in the right place. If that is the case, you can directly run best_of_3.py if you want to simulate.\u003cbr\u003e\n\n#### Directories\n- \u003cb\u003eTSP-configurations and TSP\u003c/b\u003e\u003cbr\u003e\nThese directories contain information about TSP problems of different sizes, and contains data from the TSP problem we aim to solve (a280.tsp).\n- \u003cb\u003edata\u003c/b\u003e\u003cbr\u003e\nThis is the folder that contains all simulated data used in our report\u003cbr\u003e\n- \u003cb\u003eplots\u003c/b\u003e\u003cbr\u003e\nIn this folder all plots for the assignments are stated\u003cbr\u003e\n\n#### Python files\n- \u003cb\u003e best_of_3.py\u003c/b\u003e\u003cbr\u003e\nThis file is used for the simulations, it makes use of hybrid sampling and is therefore called 'best of 3'. If you want to run simulations you should run this file. The initial settings of this file are not corresponding to the settings used to get the simulations from the report, but are set in order to find a local or global minimum as it has a lower temperature and not a random path at the beginning, but it contains a 'best guess'.\u003cbr\u003e\n- \u003cb\u003e cooling_methods.py\u003c/b\u003e\u003cbr\u003e\nIn this file different cooling methods are implemented. This is file is required for running best_of_3.py \u003cbr\u003e\n- \u003cb\u003e sampling_methods.py\u003c/b\u003e\u003cbr\u003e\nIn this file different sampling methods (swap, insert and invert) as well as the methods to calculate the total distances are implemented. This is file is required for running best_of_3.py \u003cbr\u003e\n- \u003cb\u003e statistics.py\u003c/b\u003e\u003cbr\u003e\nThis file reads simulated data from the data folder. It subsequently prints the mean, standard deviation and confidence interval of simulations. In order to derive statistics from different batches of simulations, one should change the filename(s) in the script.\u003cbr\u003e\n- \u003cb\u003eread.py\u003c/b\u003e\u003cbr\u003e\nThis file reads the data from the given optimal path and calculates its corresponding.\n- \u003cb\u003eplot_cooling.py\u003c/b\u003e\u003cbr\u003e\nIn this file the plot for cooling schemes and decreasing temperature is generated. \u003cbr\u003e\n- \u003cb\u003e SA.py and SA_knn.py\u003c/b\u003e\u003cbr\u003e\nThese files can be experimented with if one wants to sample from its K-nearest-neighbor. However, for the assignments, we did not ended up using these files and therefore they can be neglected. \u003cbr\u003e\n- \u003cb\u003e TSP.py and TSP_a280.py\u003c/b\u003e\u003cbr\u003e\nBoth these files are used to plot the graph that shows how the optimal paths are visualized\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fccfelius%2Ftravelingsalesman","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fccfelius%2Ftravelingsalesman","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fccfelius%2Ftravelingsalesman/lists"}