{"id":29192416,"url":"https://github.com/analiaburgosdev/java_greedy_traveling-salesman","last_synced_at":"2025-07-02T01:31:07.598Z","repository":{"id":298599208,"uuid":"955612373","full_name":"analiaBurgosDev/java_greedy_Traveling-Salesman","owner":"analiaBurgosDev","description":"The **Traveling Salesman Problem (TSP)** consists of finding the shortest route for a traveler to visit all cities in a weighted graph and return to the starting city. Given a **complete graph** where all cities are interconnected, the goal is to implement an **approximate algorithm** to solve the problem.","archived":false,"fork":false,"pushed_at":"2025-03-26T23:14:52.000Z","size":6,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-06-11T23:41:37.805Z","etag":null,"topics":["greedy-algorithms","java"],"latest_commit_sha":null,"homepage":"","language":"Java","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/analiaBurgosDev.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":"2025-03-26T23:12:25.000Z","updated_at":"2025-03-31T21:44:45.000Z","dependencies_parsed_at":"2025-06-11T23:41:41.702Z","dependency_job_id":"0cc04f13-9b33-42dc-9227-6c78eae0acbd","html_url":"https://github.com/analiaBurgosDev/java_greedy_Traveling-Salesman","commit_stats":null,"previous_names":["analiaburgosdev/java_greedy_traveling-salesman"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/analiaBurgosDev/java_greedy_Traveling-Salesman","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/analiaBurgosDev%2Fjava_greedy_Traveling-Salesman","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/analiaBurgosDev%2Fjava_greedy_Traveling-Salesman/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/analiaBurgosDev%2Fjava_greedy_Traveling-Salesman/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/analiaBurgosDev%2Fjava_greedy_Traveling-Salesman/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/analiaBurgosDev","download_url":"https://codeload.github.com/analiaBurgosDev/java_greedy_Traveling-Salesman/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/analiaBurgosDev%2Fjava_greedy_Traveling-Salesman/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":263059496,"owners_count":23407368,"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":["greedy-algorithms","java"],"created_at":"2025-07-02T01:30:43.176Z","updated_at":"2025-07-02T01:31:07.571Z","avatar_url":"https://github.com/analiaBurgosDev.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Problema del Viajante (TSP)\n\n## Descripción del Problema\nEl **problema del viajante (TSP)** consiste en encontrar la ruta más corta que permita a un viajante visitar todas las ciudades en un grafo ponderado y regresar a la ciudad de origen. Dado un **grafo completo** donde todas las ciudades están interconectadas, el objetivo es implementar un **algoritmo aproximado** para resolver el problema.\n\n## Enfoque\nDado que encontrar la solución óptima es computacionalmente costoso (problema NP-hard), se emplean **heurísticas de aproximación** como:\n- **Algoritmo del Vecino Más Cercano**: Selecciona iterativamente la ciudad más cercana aún no visitada.\n- **Algoritmo de Inserción Más Barata**: Construye la ruta insertando en cada paso la ciudad con menor costo adicional.\n- **Algoritmos Basados en Árbol de Expansión Mínima (MST)**: Generan una solución basada en un MST modificado.\n\n## Aplicaciones\nTSP tiene aplicaciones en:\n- **Logística y Planificación de Rutas**: Optimización de recorridos para servicios de entrega.\n- **Fabricación y Robótica**: Optimización de trayectorias para máquinas automatizadas.\n- **Diseño de Redes**: Conexión eficiente de nodos en infraestructuras de telecomunicaciones.\n  \n----------------------------------------------------\n\n#  Traveling Salesman Problem (TSP)\n\n## Problem Description\nThe **Traveling Salesman Problem (TSP)** consists of finding the shortest route for a traveler to visit all cities in a weighted graph and return to the starting city. Given a **complete graph** where all cities are interconnected, the goal is to implement an **approximate algorithm** to solve the problem.\n\n## Approach\nSince finding the optimal solution is computationally expensive (NP-hard problem), we use **approximate heuristics** such as:\n- **Nearest Neighbor Algorithm**: Iteratively selects the closest unvisited city.\n- **Cheapest Insertion Algorithm**: Builds the route by inserting the most cost-efficient city at each step.\n- **Minimum Spanning Tree (MST)-based Algorithms**: Generates a solution using a modified MST approach.\n\n## Applications\nTSP has real-world applications in:\n- **Logistics and Delivery Planning**: Optimizing travel routes for delivery services.\n- **Manufacturing and Robotics**: Optimizing movement paths for automated machines.\n- **Network Design**: Efficiently connecting network nodes in infrastructure planning.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fanaliaburgosdev%2Fjava_greedy_traveling-salesman","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fanaliaburgosdev%2Fjava_greedy_traveling-salesman","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fanaliaburgosdev%2Fjava_greedy_traveling-salesman/lists"}