Saved in:
| Main Author: | |
|---|---|
| Format: | Recurso digital |
| Language: | |
| Published: |
Zenodo
2025
|
| Online Access: | https://doi.org/10.5281/zenodo.17397636 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- <pre>This paper presents **TSP-GeoAttention**, a hybrid computational approach to solving the Traveling Salesman Problem (TSP) that combines spatial geometry, principles from classical physics, and attention mechanisms from artificial intelligence. **This work does NOT claim to solve the P vs NP millennium problem, nor does it provide a mathematical proof for any theoretical advancement.** Instead, it presents a practical software solution that achieves 85-95% accuracy compared to optimal solutions, suitable for real-world applications where near-optimal solutions are acceptable. **Keywords:** Traveling Salesman Problem, Geo-Zoning, Principle of Least Action, Attention Mechanism, Hybrid Algorithm, Practical Optimization</pre>