{"id":21726262,"url":"https://github.com/albertnadal/tsp-solver","last_synced_at":"2025-10-07T11:31:51.183Z","repository":{"id":119865441,"uuid":"85221225","full_name":"albertnadal/tsp-solver","owner":"albertnadal","description":"A Travelling Salesman Problem solver written in C implementing Genetic Algorithms.","archived":false,"fork":false,"pushed_at":"2020-12-07T19:22:16.000Z","size":49,"stargazers_count":5,"open_issues_count":0,"forks_count":3,"subscribers_count":2,"default_branch":"master","last_synced_at":"2024-11-26T03:27:39.197Z","etag":null,"topics":["genetic-algorithm","travelling-salesman-problem","tsp-solver"],"latest_commit_sha":null,"homepage":"","language":"C","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/albertnadal.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-03-16T17:01:34.000Z","updated_at":"2024-01-14T16:51:47.000Z","dependencies_parsed_at":"2023-06-03T10:45:11.837Z","dependency_job_id":null,"html_url":"https://github.com/albertnadal/tsp-solver","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/albertnadal%2Ftsp-solver","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/albertnadal%2Ftsp-solver/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/albertnadal%2Ftsp-solver/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/albertnadal%2Ftsp-solver/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/albertnadal","download_url":"https://codeload.github.com/albertnadal/tsp-solver/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":235624720,"owners_count":19020051,"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":["genetic-algorithm","travelling-salesman-problem","tsp-solver"],"created_at":"2024-11-26T03:23:43.300Z","updated_at":"2025-10-07T11:31:45.866Z","avatar_url":"https://github.com/albertnadal.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Travelling Salesman Problem Solver (Genetic Algorithm)\n\nAquest és un programa per optimitzar TSPs. Ha estat desenvolupat mitjançant\nla implementació d'un algorisme genètic. El programa s'ha de compilar mitjançant\nun compilador de C++ (g++) en sistemes Unix.\n\n### Build\n\n```\ng++ tsp.cpp -o tsp\n```\n\n### Usage\n\nPer resoldre un mapa TSP cal introduïr\nles coordenades del mapa una a una. Per evitar introduïr totes les coordenades\nmanualment es poden introduir les coordenades en un fitxer i volcar les dades\nen el moment d'execució de la següent manera.\n\n```\n./tsp \u003c mapa.tsp\n```\n\nJuntament amb el codi font s'adjunten diferents mapes de prova amb extensió txt\nque poden sér emprats a mode de prova. Els fitxers tenen el següent format. La\nprimera línia conté el nombre de coordenades (nodes) del mapa. Les linies restants\ndel fitxer contenen els valors dels components X i Y de les coordenades. S'empra\nuna línia per component.\n\n\nEl programa retorna una solució òptima a mida que en va trobant de millors. Cada\nsolució és una cadena de dígits, on cada dígit identifica un node del mapa (en\nl'ordre seqüencial introduït), juntament amb el fitness, és a dir, la distància\ntotal de la solució.\n\n### Results\n\nPer a donar resultats sobre el meu TSP Solver em basaré en un TSP existent a la web del TSPLIB d'internet. Es tracta d'un TSP que representa 52 llocs de Berlín (Groetschel) situats en les coordenades que es representen en la següent imatge.\n\n![](http://www.lafruitera.com/tsp6.gif)\n\nMitjançant el TSP Solver proposat s'ha aconseguit una solució amb un fitness de 7680 (distància del recorregut).\n\n![](http://www.lafruitera.com/tsp7.gif)\n\n### License\nMIT\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Falbertnadal%2Ftsp-solver","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Falbertnadal%2Ftsp-solver","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Falbertnadal%2Ftsp-solver/lists"}