Alternatives and similar repositories for learn2comparenodes:

Users that are interested in learn2comparenodes are comparing it to the libraries listed below

• tumBAIS / euro-meets-neurips-2022
  ☆46Updated 11 months ago
• RobbertReijnen / DR-ALNS
  Official implementation of "DR-ALNS: Deep Reinforced Adaptive Large Neighborhood Search"
  ☆22Updated 5 months ago
• lyeskhalil / mipGNN
  ☆26Updated 3 years ago
• wouterkool / dpdp
  DPDP
  ☆100Updated 2 years ago
• paulorocosta / learning-2opt-drl
  Learning 2-opt Heuristics for the TSP via Deep Reinforcement Learning
  ☆51Updated 4 years ago
• UmbertoJr / ML-Constructive
  ML-Constructive is a deep learning based constructive heuristic for the Traveling Salesman Problem.
  ☆11Updated last year
• alberto-santini / cvrp-decomposition
  Decomposition Strategies for Vehicle Routing Heuristics
  ☆29Updated last year
• inria-UFF / location-routing
  A state-of-the-art exact Branch-Cut-and-Price algorithm for the Capacitated Location-Routing Problem and related problems
  ☆18Updated 2 years ago
• google-deepmind / neural_lns
  ☆46Updated 3 years ago
• N-Wouda / Euro-NeurIPS-2022
  OptiML's contribution to the EURO meets NeurIPS 2022 vehicle routing competition.
  ☆17Updated 2 years ago
• ahottung / EAS
  Efficient Active Search
  ☆49Updated 3 years ago
• naver / bq-nco
  ☆38Updated last year
• temur-kh / pdp-drl-project
  Deep reinforcement approach to solving dynamic pickup and delivery problem
  ☆18Updated 3 years ago
• c4v4 / LKH3
  Customized version of Helsgaun's LKH3 algorithm for vehicle routing problems.
  ☆28Updated 3 weeks ago
• Zhengzhong-You / RouteOpt
  RouteOpt
  ☆37Updated last week
• PyVRP / VRPLIB
  Python package to read and write vehicle routing problem instances.
  ☆107Updated 6 months ago
• yining043 / NeuOpt
  This repo implements our paper, "Learning to Search Feasible and Infeasible Regions of Routing Problems with Flexible Neural k-Opt", whic…
  ☆48Updated 9 months ago
• yining043 / PDP-N2S
  This repo implements our paper, "Efficient Neural Neighborhood Search for Pickup and Delivery Problems", which has been accepted as short…
  ☆57Updated 2 years ago
• gkobeaga / op-solver
  Algorithms for the Orienteering Problem
  ☆36Updated this week
• amflorio / dvrp-stochastic-requests
  Online algorithms for solving large-scale dynamic vehicle routing problems with stochastic requests
  ☆80Updated 2 years ago
• RoyalSkye / Omni-VRP
  [ICML 2023] "Towards Omni-generalizable Neural Methods for Vehicle Routing Problems"
  ☆50Updated last year
• avrech / learning2cut
  Reinforcement Learning for Cut Selection
  ☆11Updated 2 years ago
• mit-wu-lab / learning-to-delegate
  [NeurIPS 2021 Spotlight] Learning to Delegate for Large-scale Vehicle Routing
  ☆81Updated 3 years ago
• ahottung / NLNS
  Neural Large Neighborhood Search for the Capacitated Vehicle Routing Problem
  ☆90Updated 4 years ago
• cssartori / pdptw-instances
  Instances for the Pickup and Delivery Problem with Time Windows (PDPTW) based on open data
  ☆47Updated last week
• chkwon / PyHygese
  A Python wrapper for the Hybrid Genetic Search algorithm for Capacitated Vehicle Routing Problems (HGS-CVRP)
  ☆90Updated last month
• michaelzcjia / smart_predict_optimize
  MIE424 Group Project: smart_predict_optimize
  ☆14Updated 4 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).
  ☆33Updated 5 years ago
• michieluithetbroek / A-MDVRP
  Asymmetric multi-depot vehicle routing problems: valid inequalities and a branch-and-cut algorithm
  ☆48Updated 3 years ago
• Lyxn / linprog
  Linear Programming in Short
  ☆18Updated 4 years ago