Alternatives and similar repositories for UGR-Metaheuristics:

Users that are interested in UGR-Metaheuristics are comparing it to the libraries listed below

• Valdecy / Metaheuristic-Local_Search-GRASP
  GRASP (Greedy Randomized Adaptive Search Procedure) Function for TSP problems.
  ☆19Updated 2 years ago
• fboliveira / MDVRP-Instances
  Multiple Depot VRP Instances
  ☆28Updated 9 years ago
• chkwon / TSPDrone.jl
  ☆26Updated last week
• vidalt / Districting-Routing
  Source code associated with the paper "Deep Learning for Data-Driven Districting-and-Routing", authored by A. Ferraz, Q. Cappart, and T. …
  ☆24Updated 9 months ago
• J-Que / RL-GA
  Genetic algorithm tuned through reinforcement learning
  ☆13Updated 3 years ago
• UmbertoJr / ML-Constructive
  ML-Constructive is a deep learning based constructive heuristic for the Traveling Salesman Problem.
  ☆11Updated last year
• c4v4 / LKH3
  Customized version of Helsgaun's LKH3 algorithm for vehicle routing problems.
  ☆29Updated 3 weeks ago
• N-Wouda / Euro-NeurIPS-2022
  OptiML's contribution to the EURO meets NeurIPS 2022 vehicle routing competition.
  ☆17Updated 2 years ago
• alberto-santini / cvrp-decomposition
  Decomposition Strategies for Vehicle Routing Heuristics
  ☆29Updated last year
• Yu1423 / CMTVRPTW
  ☆11Updated last year
• mouadmorabit / MLColumnSelection
  Machine-learning-based column selection
  ☆36Updated 3 years ago
• spkelle2 / vehicle_routing_column_generation
  A demo on how use column generation in a primal heuristic for the Vehicle Routing Problem with Time Windows (VRPTW)
  ☆17Updated 2 years ago
• dparo / master-thesis
  A Branch-and-Cut based Pricer for the Capacitated Vehicle Routing Problem
  ☆15Updated last year
• mit-wu-lab / learning-to-delegate
  [NeurIPS 2021 Spotlight] Learning to Delegate for Large-scale Vehicle Routing
  ☆82Updated 3 years ago
• lseman / baldes
  Bucket Graph Labeling Algorithm for Vehicle Routing
  ☆18Updated 2 months ago
• tumBAIS / RoutingBlocks
  A modular Python package for the development of metaheuristic algorithms for Vehicle Routing Problems with Intermediate Stops
  ☆24Updated last year
• chkwon / PyHygese
  A Python wrapper for the Hybrid Genetic Search algorithm for Capacitated Vehicle Routing Problems (HGS-CVRP)
  ☆91Updated last month
• fabiofurini / LocationCovering
  Exact Branch-and-Benders-cut algorithm for the Maximal Covering Location Problem and for the Partial Set Covering Location Problem
  ☆15Updated 2 years ago
• theosotr / tabu_search-vrpcd
  A Tabu Search algorithm for the Vehicle Routing Problem with Cross-Docking.
  ☆48Updated 8 years ago
• Sasanm88 / TSPDroneHGATAC.jl
  A package that uses Hybrid Genetic Algorithm to solve any TSPD or FSTSP instance
  ☆13Updated last week
• tumBAIS / euro-meets-neurips-2022
  ☆46Updated 11 months ago
• alberto-santini / concorde-easy-build
  Fork of the Concorde TSP solver with an easier build procedure
  ☆14Updated last year
• vidalt / HGS-TDCARP
  Source code associated with the paper: "Vidal, T., Martinelli, R., Pham, T. A., & Hà, M. H. (2021). Arc routing with time-dependent trave…
  ☆19Updated 5 years ago
• Gurobi / pres-mipheur
  Presentation: Custom MIP Heuristics
  ☆34Updated 3 years ago
• vidalt / Split-Library
  Library of Split algorithms, including the O(n) (linear time) algorithm for the CVRP, from "Vidal, Thibaut (2016). Technical note: Split …
  ☆18Updated 6 years ago
• amflorio / vrpsd-optimal-restocking
  Elementary branch-price-and-cut algorithm for the vehicle routing problem with stochastic demands under optimal restocking
  ☆16Updated 2 years ago
• PyVRP / VRPLIB
  Python package to read and write vehicle routing problem instances.
  ☆107Updated 6 months ago
• felicze / 3l-cvrp
  ☆18Updated 4 months ago
• yuri-tavares / benders-decomposition
  Implementation of original Benders procedures in Python
  ☆9Updated 6 years ago
• Valdecy / pyCombinatorial
  This library provides a comprehensive suite of algorithms to solve the Travelling Salesman Problem (TSP), ranging from Exact Algorithms, …
  ☆122Updated last month