Traveling Salesman Problem
67 papers with code • 1 benchmarks • 1 datasets
Benchmarks
These leaderboards are used to track progress in Traveling Salesman Problem
| Trend | Dataset | Best Model | Paper | Code | Compare |
|---|---|---|---|---|---|
|
Libraries
Use these libraries to find Traveling Salesman Problem models and implementations
TSP/HCP Benchmark set
Latest papers
Self-Improvement for Neural Combinatorial Optimization: Sample without Replacement, but Improvement
Current methods for end-to-end constructive neural combinatorial optimization usually train a policy using behavior cloning from expert solutions or policy gradient methods from reinforcement learning.
Ant Colony Optimization for Cooperative Inspection Path Planning Using Multiple Unmanned Aerial Vehicles
This paper presents a new swarm intelligence-based approach to deal with the cooperative path planning problem of unmanned aerial vehicles (UAVs), which is essential for the automatic inspection of infrastructure.
Triplet Interaction Improves Graph Transformers: Accurate Molecular Graph Learning with Triplet Graph Transformers
shamim-hussain/egt_pytorch
•
•
We also obtain SOTA results on QM9, MOLPCBA, and LIT-PCBA molecular property prediction benchmarks via transfer learning.
Moco: A Learnable Meta Optimizer for Combinatorial Optimization
timd3/moco
•
•
Our approach, Moco, learns a graph neural network that updates the solution construction procedure based on features extracted from the current search state.
An Example of Evolutionary Computation + Large Language Model Beating Human: Design of Efficient Guided Local Search
ai4co/llm-as-hh
•
•
Recently, we have proposed a novel Algorithm Evolution using Large Language Model (AEL) framework for automatic algorithm design.
Machine Learning-Enhanced Aircraft Landing Scheduling under Uncertainties
ymlasu/para-atm-collection
•
•
This paper addresses aircraft delays, emphasizing their impact on safety and financial losses.
Graph Sparsifications using Neural Network Assisted Monte Carlo Tree Search
abureyanahmed/gnn-msts-sparsification
•
•
Graph neural networks have been successful for machine learning, as well as for combinatorial and graph problems such as the Subgraph Isomorphism Problem and the Traveling Salesman Problem.
Graph Attention-based Deep Reinforcement Learning for solving the Chinese Postman Problem with Load-dependent costs
We release our C++ implementations for metaheuristics such as EA, ILS and VNS along with the code for data generation and our generated data at https://github. com/HySonLab/Chinese_Postman_Problem
Reinforcement Learning-based Non-Autoregressive Solver for Traveling Salesman Problems
xybfight/nar4tsp
•
•
The Traveling Salesman Problem (TSP) is a well-known combinatorial optimization problem with broad real-world applications.
FIS-ONE: Floor Identification System with One Label for Crowdsourced RF Signals
To build a prediction model to identify the floor number of a new RF signal upon its measurement, conventional approaches using the crowdsourced RF signals assume that at least few labeled signal samples are available on each floor.
