travelling salesperson problem
PulseAugur coverage of travelling salesperson problem — every cluster mentioning travelling salesperson problem across labs, papers, and developer communities, ranked by signal.
- instance of Capacitated Vehicle Routing Problem 90%
- instance of TSPLIB—A Traveling Salesman Problem Library 90%
- competes with Capacitated Vehicle Routing Problem 70%
- instance of Gotit.pub 70%
- instance of ant colony optimization algorithms 70%
- used by ant colony optimization algorithms 70%
- used by TSPLIB—A Traveling Salesman Problem Library 60%
4 day(s) with sentiment data
-
Pointer Networks with Q-Learning for Combinatorial Optimization
A research paper introduces the Pointer Q-Network (PQN), a novel neural architecture designed to improve sequence generation for combinatorial optimization tasks. The PQN integrates model-free Q-value approximation with…
-
New geometric pre-training boosts neural routing models for TSP
Researchers have developed a new self-supervised pre-training framework for neural combinatorial optimization models, specifically targeting routing problems like the Traveling Salesman Problem (TSP). This geometric app…
-
New research explores enhanced algorithms for the Traveling Salesperson Problem · 2 sources tracked
Two new research papers explore advancements in solving the Traveling Salesperson Problem (TSP). One paper details how evolutionary multitasking, specifically the MT-EAX algorithm, can significantly improve computationa…
-
New PIAC Framework Enhances LLM Generalization for Optimization Problems
Researchers have developed a new framework called Potential-aware Instance and Algorithm Co-evolution (PIAC) to improve the generalization capabilities of Large Language Models (LLMs) in solving complex combinatorial op…
-
Deep Reinforcement Learning Optimizes Truck Routing, Cuts Costs by 10%
This paper explores the application of deep reinforcement learning (DRL) to solve the complex Vehicle Routing Problem (VRP) in the logistics industry. It presents a case study focusing on truck network design for three …
-
DualCert solver integrates constraint-coupled learning for Traveling Salesman Problem
Researchers have developed DualCert, a novel solver for the Traveling Salesman Problem (TSP) that integrates constraint-coupled learning. This method uses degree equations and subtour-elimination constraints to guide le…
-
New ML approach recycles DP results for optimization problems
Researchers have developed a novel machine learning approach that recycles computational results from dynamic programming to solve combinatorial optimization problems. This method, based on reservoir computing, uses rec…
-
Pretraining enhances AI solvers for complex routing problems
Researchers have developed a new self-supervised pretraining framework for graph combinatorial optimization, specifically targeting routing problems like the Traveling Salesman Problem (TSP). This framework employs grap…
-
New neural network solvers tackle Traveling Salesman Problem
Two new research papers explore advanced neural network approaches for solving the Traveling Salesman Problem (TSP). The first paper introduces GNNAS-TSP, a Graph Neural Network (GNN)-based framework that learns TSP ins…
-
New C2TSP method learns TSP structure directly for better tour construction
Researchers have developed a new unsupervised learning pipeline called C2TSP to tackle the traveling salesman problem (TSP). This method directly learns a Hamiltonian structure within a latent object, rather than relyin…
-
New Graph Edge Sparsification Method Accelerates TSP Solutions
Researchers have developed a novel learning-based approach called Graph Edge Sparsification (GES) to address the computational challenges of solving large-scale Traveling Salesman Problems (TSP). Unlike traditional meth…
-
New algorithms convert neural network heatmaps to TSP tours with provable guarantees
Researchers have developed new algorithms to convert heatmaps, generated by neural networks, into tours for the Traveling Salesperson Problem (TSP). These algorithms provide theoretical guarantees that link the quality …
-
New 'Leader Reward' technique enhances AI for combinatorial optimization problems
Researchers have introduced a novel training technique called "Leader Reward" designed to improve the performance of neural networks in solving combinatorial optimization problems. This method focuses on enhancing the g…
-
New Quantum Graph Neural Network Framework Promises Scalability and Expressivity
Researchers have developed a novel message-passing quantum graph neural network (QGNN) framework designed for scalability and expressivity. This new QGNN is permutation equivariant and can be precisely positioned within…
-
Super Mario levels proven to be undecidable by MIT researchers
Research from MIT's theoretical computer science projects, specifically Erik Demaine's "Algorithmic Lower Bounds: Fun with Hardness Proofs" class, has revealed that Super Mario levels can be undecidable. This means it's…
-
New AGDN framework offers improved solutions for Traveling Salesman Problem
Researchers have developed the Anisotropic Graph Diffusion Network (AGDN), a novel Graph Neural Network designed to tackle the Traveling Salesman Problem (TSP). AGDN addresses challenges in exploiting graph structure by…
-
Diffusion model IDEQ sets new TSP benchmark for neural networks
Researchers have developed IDEQ, a novel diffusion model designed to tackle the Traveling Salesman Problem (TSP). By incorporating the structural constraints of TSP solutions and refining curriculum learning, IDEQ achie…
-
New PCI method boosts neural TSP solver performance
Researchers have developed a new method called Projected Consistency Inference (PCI) to improve the performance of diffusion-based neural solvers for the Traveling Salesman Problem (TSP). PCI replaces computationally in…
-
New hybrid algorithm tackles Traveling Salesman Problem
Researchers have developed a new hybrid metaheuristic approach to solve the Traveling Salesman Problem (TSP), a complex optimization challenge. This method integrates the Dragonfly Algorithm, known for its global search…
-
MViewRouter framework internalizes geometric equivariance for routing problems
Researchers have developed MViewRouter, a novel framework designed to tackle complex combinatorial routing problems like the Traveling Salesman Problem. This new approach integrates geometric equivariance as a core indu…