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%
- instance of ant colony optimization algorithms 90%
- competes with Capacitated Vehicle Routing Problem 70%
- instance of Gotit.pub 70%
- used by ant colony optimization algorithms 70%
- used by TSPLIB—A Traveling Salesman Problem Library 60%
3 day(s) with sentiment data
-
New AI routing methods enhance reasoning and efficiency · 4 sources tracked
Researchers have developed T-Router, a parameter-efficient reinforcement learning method that significantly improves reasoning capabilities by selectively reusing computations from pretrained models. This approach, deta…
-
New SPO framework uses LLMs to discover adaptive search operators
Researchers have developed a new framework called Stackelberg Program Optimization (SPO) to discover effective destroy and repair operators for large neighborhood search (LNS) algorithms. SPO utilizes an LLM-based appro…
-
RouteRepair enhances LLM-generated routing heuristics by fixing instance-level failures
Researchers have developed RouteRepair, a novel method for improving Large Language Model (LLM)-generated heuristics for routing optimization problems. RouteRepair identifies specific instance-level failures in LLM-desi…
-
New Probabilistic Search Algorithm Accelerates AI Problem Solving
Researchers have introduced Probabilistic Focal Search (PFS), a novel algorithm designed to accelerate bounded-suboptimal search by strategically advancing lower bounds. Unlike traditional Focal Search, PFS incorporates…
-
New recurrent encoder boosts efficiency in neural combinatorial optimization
Researchers have developed a new recurrent encoder architecture for Neural Combinatorial Optimization (NCO) that significantly improves efficiency. This novel approach reuses computation from previous steps by incorpora…
-
New SGE framework guides ground vehicles using image-space semantics
Researchers have developed Semantically-Guided Exploration (SGE), a new framework for ground vehicles that integrates pixel-level semantic segmentation into waypoint selection and route optimization. Unlike traditional …
-
New MEMENTO approach boosts AI solvers for routing problems
Researchers have developed MEMENTO, a novel approach that enhances neural solvers for routing problems by incorporating memory. This method dynamically adjusts action distributions based on the outcomes of previous deci…
-
GPU Parallelization Accelerates Large-Scale Traveling Salesman Problem Solvers
Researchers have developed a fine-grain GPU parallelization technique for the Generalized Partition Crossover (GPX) operator, specifically targeting large-scale Traveling Salesman Problems (TSP). This method reformulate…
-
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 …