.png){kind=icon}
.png){kind=icon}
Return
New encodings of the (Euclidean) travelling salesperson problem in constraint answer set programming on difference logic
.png){kind=icon}
PRE
AI
B
G
DOI：10.1093/logcom/exaf072.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The Travelling Salesperson Problem (TSP) is a very well-known problem in computer science. Many real-world instances belong to the class of Euclidean TSP, in which the nodes to be visited lie on the Euclidean plane, and additional information is available with respect to the generic TSP, i.e. the coordinates of the nodes to be visited are known. In previous publications, we showed that the additional available information can be exploited to speed up the search, both in Constraint Logic Programming (CLP) and in Answer Set Programming (ASP). Constraint ASP (CASP) is a framework that joins CLP and ASP, and it aims at combining the features of both languages. In this article, we address the (Euclidean) TSP in CASP, and more specifically in the clingo$[DL]$ language and solver. We propose new encodings for the TSP in clingo$[DL]$; the new encodings are applicable to the general TSP (also to instances that are not Euclidean) and show a speedup of several orders of magnitude with respect to previous encodings. A further speedup can be obtained in Euclidean instances by exploiting geometric reasoning.
Keywords:
GLOBAL CONSTRAINTS
SALESMAN PROBLEM
ALGORITHM
TSP
Journal
J
IF:
0
Papers:
44
Citations:
0
Organization
Cited Papers