{"id":20672820,"url":"https://github.com/hasanimran96/tsp-using-evolutionary-algorithm","last_synced_at":"2026-04-24T13:01:50.177Z","repository":{"id":202491856,"uuid":"130463982","full_name":"hasanimran96/TSP-using-Evolutionary-Algorithm","owner":"hasanimran96","description":"Implement Genetic Algorithm in Python to solve Traveling Salesman Problem","archived":false,"fork":false,"pushed_at":"2021-02-11T22:12:40.000Z","size":8,"stargazers_count":1,"open_issues_count":0,"forks_count":1,"subscribers_count":0,"default_branch":"master","last_synced_at":"2025-03-10T18:09:14.611Z","etag":null,"topics":["cost","evolutionary-algorithm","genetic-algorithm","machine-learning-algorithms","python3","tsp"],"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/hasanimran96.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}},"created_at":"2018-04-21T10:37:50.000Z","updated_at":"2021-02-11T22:12:43.000Z","dependencies_parsed_at":null,"dependency_job_id":"aca5e950-5c52-4728-8ce5-c09bc03494ea","html_url":"https://github.com/hasanimran96/TSP-using-Evolutionary-Algorithm","commit_stats":null,"previous_names":["hasanimran96/tsp-using-evolutionary-algorithm"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/hasanimran96/TSP-using-Evolutionary-Algorithm","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hasanimran96%2FTSP-using-Evolutionary-Algorithm","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hasanimran96%2FTSP-using-Evolutionary-Algorithm/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hasanimran96%2FTSP-using-Evolutionary-Algorithm/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hasanimran96%2FTSP-using-Evolutionary-Algorithm/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/hasanimran96","download_url":"https://codeload.github.com/hasanimran96/TSP-using-Evolutionary-Algorithm/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hasanimran96%2FTSP-using-Evolutionary-Algorithm/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":32224413,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-04-24T10:26:35.452Z","status":"ssl_error","status_checked_at":"2026-04-24T10:25:27.643Z","response_time":64,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.5:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"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":["cost","evolutionary-algorithm","genetic-algorithm","machine-learning-algorithms","python3","tsp"],"created_at":"2024-11-16T20:38:55.077Z","updated_at":"2026-04-24T13:01:50.156Z","avatar_url":"https://github.com/hasanimran96.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# TSP-using-Evolutionary-Algorithm\nProblem Statement \n\nImplement Genetic Algorithm in Python to solve Traveling Salesman Problem \n\nTSP Description \n8 cities in all \nCost from A to B would be same for B to A \n\nGA Description \n• Population Size – 10 \n• Fitness Function – Cost of the tour \n• Parent Selection Scheme – Binary Tournament \n• Crossover operator – 2 points cross over – randomly selected points \n• Mutation operator – Swap Mutation – randomly selected points \n• Pool of offspring – 10 \n• Survival Mechanism – Truncation \n• Termination Condition – 100 Generations\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhasanimran96%2Ftsp-using-evolutionary-algorithm","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fhasanimran96%2Ftsp-using-evolutionary-algorithm","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhasanimran96%2Ftsp-using-evolutionary-algorithm/lists"}