TSPLIB—A Traveling Salesman Problem Library
PulseAugur coverage of TSPLIB—A Traveling Salesman Problem Library — every cluster mentioning TSPLIB—A Traveling Salesman Problem Library across labs, papers, and developer communities, ranked by signal.
-
LLM framework jointly evolves routing optimization heuristics
Researchers have developed a novel framework called LLM-Driven Heuristic Components Joint Generation (LLM-HCJG) to address the limitations of expert knowledge in heuristic design for combinatorial optimization. This pop…
-
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 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…
-
MMAO framework shows strong performance in large-scale empirical evaluation
A new paper evaluates the Metabolic Multi-Agent Optimizer (MMAO) framework, focusing on its resource-allocation principles under strict budget controls. The study employed a large-scale empirical protocol across eight C…
-
Metabolic Multi-Agent Optimizer (MMAO) framework validated on benchmarks
A new paper evaluates the Metabolic Multi-Agent Optimizer (MMAO) framework using a stricter empirical protocol. The study tested MMAO's resource-allocation principle on continuous and discrete benchmarks, including CEC2…
-
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…