{"id":15986068,"url":"https://github.com/ncordon/tsp","last_synced_at":"2025-04-04T21:26:13.952Z","repository":{"id":73916566,"uuid":"57471073","full_name":"ncordon/tsp","owner":"ncordon","description":"Different approaches for the Travelling Salesman Problem","archived":false,"fork":false,"pushed_at":"2016-07-16T03:51:59.000Z","size":6359,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-02-10T06:13:06.379Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Jupyter Notebook","has_issues":true,"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/ncordon.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","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":"2016-05-01T02:51:19.000Z","updated_at":"2016-07-16T03:52:28.000Z","dependencies_parsed_at":null,"dependency_job_id":"e9cca914-7fa8-43ce-8613-e134473382a9","html_url":"https://github.com/ncordon/tsp","commit_stats":null,"previous_names":[],"tags_count":1,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ncordon%2Ftsp","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ncordon%2Ftsp/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ncordon%2Ftsp/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ncordon%2Ftsp/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ncordon","download_url":"https://codeload.github.com/ncordon/tsp/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247251005,"owners_count":20908443,"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","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":[],"created_at":"2024-10-08T02:42:28.130Z","updated_at":"2025-04-04T21:26:13.936Z","avatar_url":"https://github.com/ncordon.png","language":"Jupyter Notebook","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Travelling Salesman Problem\n\nComparison between two different approaches for solving the Travelling Salesman Problem implemented from scratch:\n\n* Simulaed Annealing\n* Tabu Search\n\n# License\nGNU licensed\n\n# Usage\n\n```python\ntsp.py\n```\nor\n```python\ntsp.ipynb\n```\n\n\nThe comparison has been made taking the same number of iterations for each metaheuristic. The documentation is available in `tsp.tex`, and `presentacion.tex` contains a presentation of results, both in Spanish. The selected operator for getting new solutions has been 2-opt of edges.\n\n![Simulated Annealing on Berlin52](https://github.com/NCordon/tsp/blob/master/images/berlin52sa.png)\n![Tabu Search on Berlin52](https://github.com/NCordon/tsp/blob/master/images/berlin52ts.png)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fncordon%2Ftsp","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fncordon%2Ftsp","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fncordon%2Ftsp/lists"}