#traveling-salesman-problem News & Analysis

2 articles tagged with #traveling-salesman-problem. AI-curated summaries with sentiment analysis and key takeaways from 50+ sources.

2 articles

AINeutralarXiv – CS AI · Jun 236/10

🧠

GeoRouteNet: Geometry-Enhanced Non-Autoregressive Neural Solver for the Traveling Salesman Problem

Researchers introduce GeoRouteNet, a geometry-enhanced neural network solver for the Traveling Salesman Problem that achieves competitive optimality gaps (0.32% on TSP50, 1.26% on TSP100) through architectural innovations and a novel multi-candidate self-comparison reinforcement learning training approach. The method demonstrates superior cross-distribution generalization compared to existing non-autoregressive approaches while maintaining faster inference speeds than traditional solvers.

AINeutralarXiv – CS AI · Jun 26/10

🧠

MViewRouter: Internalizing Geometric Equivariance via Multi-view Alternating Attention for Combinatorial Routing

Researchers propose MViewRouter, a deep reinforcement learning framework that solves combinatorial routing problems like TSP and CVRP by embedding geometric symmetries directly into the model architecture rather than relying on data augmentation. The approach uses multi-view alternating attention and collective policy gradient aggregation to achieve more consistent decision-making and improved generalization across problem variants.