New CLP algorithms enhance Euclidean TSP solving with geometric data

Researchers have developed new filtering algorithms for the Euclidean Traveling Salesperson Problem (TSP) within Constraint Logic Programming (CLP). These algorithms leverage the geometric information of point coordinates, which is typically ignored in standard CLP approaches for TSP. The proposed methods offer stronger constraint propagation and have been extended to variants like the Euclidean Generalized Traveling Salesperson Problem (EGTSP), demonstrating computational advantages in experimental results. AI

IMPACT These algorithms could improve efficiency in logistics and routing applications by better solving complex combinatorial problems.

RANK_REASON The cluster contains an academic paper detailing new algorithms for a specific computational problem. [lever_c_demoted from research: ic=1 ai=0.7]

Read on arXiv cs.AI →

• Alessandro Bertagnon
• constraint logic programming
• Euclidean Generalized Traveling Salesperson Problem
• Euclidean Traveling Salesperson Problem
• travelling salesperson problem

• paper
• other

AI-generated summary · Google Gemini · from 1 sources. How we write summaries →