Geometric based heuristic TSP
Fuente:
Zenodo
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Recurso digital |
| Lingua: | inglese |
| Pubblicazione: |
Zenodo
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866901763612737536 |
|---|---|
| author | ben abdessalem, maher |
| author_facet | ben abdessalem, maher |
| contents | <p>This work introduces Geo-first TSP, a new geometric-prior heuristic for the Euclidean<br>Traveling Salesman Problem (TSP). The method integrates convex-hull extraction, direction-<br>biased candidate edge generation, spatial neighborhood filtering, and randomized geometry-<br>guided constructive tours, followed by 2-opt local search.<br>The algorithm is motivated by the hypothesis that injecting global geometric structure into<br>randomized initial tours improves the quality of 2-opt local minima. Experiments on several<br>TSPLIB instances demonstrate that Geo-first TSP significantly outperforms classical construc-<br>tive heuristics and approaches the quality of multi-start 2-opt, sometimes within 0.03% of the<br>best obtained solution.<br>The preprint documents the method, reports empirical results, and outlines conceptual links<br>to computational geometry, probabilistic heuristics, and candidate-set design in local search.<br>Code and scripts are openly provided for reproducibility.</p> |
| format | Recurso digital |
| id | zenodo_https___doi_org_10_5281_zenodo_17640906 |
| institution | Zenodo |
| language | eng |
| publishDate | 2025 |
| publisher | Zenodo |
| record_format | zenodo |
| spellingShingle | Geometric based heuristic TSP ben abdessalem, maher Traveling Salesman Problem Computational Geometry Heuristics 2-opt Candi- date Sets Randomized Algorithms graph theory Applied mathematics Graph theory <p>This work introduces Geo-first TSP, a new geometric-prior heuristic for the Euclidean<br>Traveling Salesman Problem (TSP). The method integrates convex-hull extraction, direction-<br>biased candidate edge generation, spatial neighborhood filtering, and randomized geometry-<br>guided constructive tours, followed by 2-opt local search.<br>The algorithm is motivated by the hypothesis that injecting global geometric structure into<br>randomized initial tours improves the quality of 2-opt local minima. Experiments on several<br>TSPLIB instances demonstrate that Geo-first TSP significantly outperforms classical construc-<br>tive heuristics and approaches the quality of multi-start 2-opt, sometimes within 0.03% of the<br>best obtained solution.<br>The preprint documents the method, reports empirical results, and outlines conceptual links<br>to computational geometry, probabilistic heuristics, and candidate-set design in local search.<br>Code and scripts are openly provided for reproducibility.</p> |
| title | Geometric based heuristic TSP |
| topic | Traveling Salesman Problem Computational Geometry Heuristics 2-opt Candi- date Sets Randomized Algorithms graph theory Applied mathematics Graph theory |
| url | https://doi.org/10.5281/zenodo.17640906 |