{"id":22141310,"url":"https://github.com/bjam24/traveling-salesman-problem","last_synced_at":"2025-03-24T11:21:13.070Z","repository":{"id":156402838,"uuid":"428046956","full_name":"bjam24/traveling-salesman-problem","owner":"bjam24","description":"The project is about solving symmetrical traveling salesman problem. The repository contains 4 optimization algorithms: Tabu Search, Hill Climbing with Multi-Start, Nearest Neighbor and Simulated Annealing.","archived":false,"fork":false,"pushed_at":"2024-10-03T20:30:51.000Z","size":105497,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-01-29T16:31:48.625Z","etag":null,"topics":["algorithm","automation","hill-climbing","nearest-neighbor","python","simulated-annealing","tabu-search","travelling-salesman-problem","xlsx"],"latest_commit_sha":null,"homepage":"","language":"Python","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/bjam24.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":"2021-11-14T21:36:00.000Z","updated_at":"2024-10-03T20:30:55.000Z","dependencies_parsed_at":null,"dependency_job_id":"c93e6368-83bb-4b96-afaa-b692ddf79c7a","html_url":"https://github.com/bjam24/traveling-salesman-problem","commit_stats":null,"previous_names":["bjam24/agh-computational-intelligence","bjam24/traveling-salesman-problem"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bjam24%2Ftraveling-salesman-problem","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bjam24%2Ftraveling-salesman-problem/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bjam24%2Ftraveling-salesman-problem/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bjam24%2Ftraveling-salesman-problem/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/bjam24","download_url":"https://codeload.github.com/bjam24/traveling-salesman-problem/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":245258215,"owners_count":20585977,"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":["algorithm","automation","hill-climbing","nearest-neighbor","python","simulated-annealing","tabu-search","travelling-salesman-problem","xlsx"],"created_at":"2024-12-01T21:12:29.873Z","updated_at":"2025-03-24T11:21:13.047Z","avatar_url":"https://github.com/bjam24.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Traveling-Salesman-Problem\n## Description\nThis project was developed for the Computational Intelligence course at AGH University of Science and Technology during the 2021/2022 academic year. It features four custom-designed algorithms created from scratch in **Python** that are applied to **Symmetrical Traveling Salesman Problem (TSP)**. The project's structure and code have been refactored for clarity and efficiency. The algorithms showcased here are frequently integrated with **Machine Learning** algorithms.\n\n## Algorithms\nThe presented results are intended for demonstration purposes only. Finding the optimal solution requires sufficient time and careful tuning of the parameters.\n\n**Hill Climbing**\n\n\u003cp float=\"left\"\u003e\n\u003cimg src=\"src/images/tsp_hill_climbing_result.jpg\" width=\"400\"/\u003e\n\u003c/p\u003e\n\n**Nearest Neighbour**\n\n\u003cp float=\"left\"\u003e\n\u003cimg src=\"src/images/tsp_neares_neighbour_result.jpg\" width=\"400\"/\u003e\n\u003c/p\u003e\n\n**Tabu Search**\n\n\u003cp float=\"left\"\u003e\n\u003cimg src=\"src/images/tsp_tabu_search_result.jpg\" width=\"400\"/\u003e\n\u003c/p\u003e\n\n**Simulated Annealing**\n\n\u003cp float=\"left\"\u003e\n\u003cimg src=\"src/images/tsp_simulated_annealing_result.jpg\" width=\"400\"/\u003e\n\u003c/p\u003e\n\n## Technology stack\n- Python\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbjam24%2Ftraveling-salesman-problem","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fbjam24%2Ftraveling-salesman-problem","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbjam24%2Ftraveling-salesman-problem/lists"}