Alternatives and similar repositories for VSR-LKH-V2

Users that are interested in VSR-LKH-V2 are comparing it to the libraries listed below

• liangxinedu / NeuroLKH
  ☆82Updated 3 years ago
• proroklab / gnngls
  Code accompanying the paper Graph Neural Network Guided Local Search for the Traveling Salesperson Problem
  ☆29Updated 2 years ago
• yining043 / NeuOpt
  This repo implements our paper, "Learning to Search Feasible and Infeasible Regions of Routing Problems with Flexible Neural k-Opt", whic…
  ☆51Updated last year
• RoyalSkye / Omni-VRP
  [ICML 2023] "Towards Omni-generalizable Neural Methods for Vehicle Routing Problems"
  ☆57Updated 7 months ago
• Pointerformer / Pointerformer
  Deep Reinforced Multi-Pointer Transformer forthe Traveling Salesman Problem
  ☆42Updated 3 years ago
• Learning4Optimization-HUST / H-TSP
  Official implementation of H-TSP (AAAI2023)
  ☆56Updated 9 months ago
• DIMESTeam / DIMES
  ☆45Updated 8 months ago
• Spider-scnu / TSP
  ☆134Updated 3 years ago
• wouterkool / dpdp
  DPDP
  ☆104Updated 3 years ago
• yining043 / VRP-DACT
  This repo implements our paper, "Learning to Iteratively Solve Routing Problems with Dual-Aspect Collaborative Transformer", which has be…
  ☆117Updated last year
• RoyalSkye / Routing-CNF
  [NeurIPS 2024] "Collaboration! Towards Robust Neural Methods for Routing Problems"
  ☆21Updated last year
• ahottung / EAS
  Efficient Active Search
  ☆53Updated 3 years ago
• xybFight / NAR4TSP
  PyTorch code for the NAR4TSP.
  ☆26Updated last year
• mit-wu-lab / learning-to-delegate
  [NeurIPS 2021 Spotlight] Learning to Delegate for Large-scale Vehicle Routing
  ☆86Updated 4 years ago
• naver / bq-nco
  ☆42Updated 2 years ago
• Spider-scnu / Monte-Carlo-tree-search-for-TSP
  This is the source code for solving the Traveling Salesman Problems (TSP) using Monte Carlo tree search (MCTS).
  ☆34Updated 6 years ago
• yining043 / PDP-N2S
  This repo implements our paper, "Efficient Neural Neighborhood Search for Pickup and Delivery Problems", which has been accepted as short…
  ☆61Updated 3 years ago
• JHL-HUST / VSR-LKH
  Combining Reinforcement Learning with Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problem
  ☆48Updated last year
• LOGO-CUHKSZ / ASP
  ☆23Updated last year
• Kasumigaoka-Utaha / INViT
  Official Implementation of the paper: INViT: A Generalizable Routing Problem Solver with Invariant Nested View Transformer
  ☆26Updated last year
• xyfffff / rethink_mcts_for_tsp
  [ICML'24 Oral] Rethinking Post-Hoc Search-Based Neural Approaches for Solving Large-Scale Traveling Salesman Problems
  ☆40Updated 9 months ago
• paulorocosta / ai-for-tsp-competition
  This is the official repository of the AI for TSP competition at IJCAI 2021
  ☆27Updated 3 years ago
• xbresson / TSP_Transformer
  Code for TSP Transformer
  ☆193Updated 4 years ago
• yd-kwon / MatNet
  codes for the paper "Matrix Encoding Networks for Neural Combinatorial Optimization"
  ☆74Updated 4 years ago
• yimengmin / UTSP
  code repo for paper Unsupervised Learning for Solving the Travelling Salesman Problem
  ☆58Updated last year
• ai4co / routefinder
  [TMLR 2025 + ICML 2024 FM-Wild Oral] RouteFinder: Towards Foundation Models for Vehicle Routing Problems
  ☆103Updated last month
• ahottung / CVAE-Opt
  Learning a Latent Search Space for Routing Problems using Variational Autoencoders
  ☆28Updated 4 years ago
• jieyibi / AMDKD
  The implementation code of our paper "Learning Generalizable Models for Vehicle Routing Problems via Knowledge Distillation", accepted at…
  ☆58Updated 2 months ago
• chaitjo / learning-tsp
  Code for the paper 'Learning TSP Requires Rethinking Generalization' (CP 2021)
  ☆238Updated 4 years ago
• dongjinkun / COPZoo
  Neural Combinatorial Optimization
  ☆84Updated last month