Metraipolis › archive › dc_aa9e28fdd749

Enhanced Filtering Algorithms for the Euclidean Traveling Salesperson Problem and its variants in Constraint Logic Programming — arXiv:2608.10881

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.10881
License (as archived)
CC0-1.0
Archived
2026-10-19T06:08:38.232Z
SHA-256 of the archived text
f643665000d487fed09e03dbd7548b450a2c9db5e2833eec74caeacd5672dda0
Stable URL of this page
https://metraipolis.com/documento/dc_aa9e28fdd749

How to cite

Enhanced Filtering Algorithms for the Euclidean Traveling Salesperson Problem and its variants in Constraint Logic Programming — arXiv:2608.10881 — arXiv (en), https://arxiv.org/abs/2608.10881 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_aa9e28fdd749 (Metraipolis archive dc_aa9e28fdd749, sha256 f643665000d487fed09e03dbd7548b450a2c9db5e2833eec74caeacd5672dda0)
BibTeX
@misc{dcaa9e28fdd749,
  title = {Enhanced Filtering Algorithms for the Euclidean Traveling Salesperson Problem and its variants in Constraint Logic Programming — arXiv:2608.10881},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.10881},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_aa9e28fdd749; sha256 f643665000d487fed09e03dbd7548b450a2c9db5e2833eec74caeacd5672dda0},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.10881. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The Traveling Salesperson Problem (TSP) is one of the best-known problems in computer science and arises in many engineering applications, such as smart vehicles and intelligent transportation systems. In the "Euclidean" case, each node is defined by its coordinates in the plane and distances are computed using the Euclidean metric. In the Constraint Programming (CP) literature, the Euclidean TSP is typically addressed by computing the full distance matrix and treating it as a general case; however this approach ignores the geometric information carried by the points' coordinates. In this work, we propose new filtering algorithms, implemented in Constraint Logic Programming (CLP), that exploit such geometric information to achieve stronger constraint propagation than existing approaches. Moreover, we show how this methodology can be extended to other Euclidean variants of the TSP, including the Euclidean Generalized Traveling Salesperson Problem (EGTSP), which is relevant in practical routing and logistics applications. Experimental results demonstrate the computational advantages of the proposed approach.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-12 in cs.AI).
Categorie arXiv: Artificial Intelligence (cs.AI) ; Logic in Computer Science (cs.LO).
Pagina del lavoro: https://arxiv.org/abs/2608.10881 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-19T05:57:28.299Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-08-12?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).