Alternatives and similar repositories for NEO-LRP

Users that are interested in NEO-LRP are comparing it to the libraries listed below

• chkwon / TSPDrone.jl
  ☆26Updated last month
• 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
• 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
• Zhengzhong-You / RouteOpt
  RouteOpt
  ☆39Updated 2 weeks ago
• hyeonahkimm / neuralsep
  A Neural Separation Algorithm for the Rounded Capacity Inequalities (IJOC, 2024)
  ☆14Updated last year
• lseman / baldes
  Bucket Graph Labeling Algorithm for Vehicle Routing
  ☆19Updated 2 months ago
• felicze / 3l-cvrp
  ☆18Updated 4 months ago
• tumBAIS / euro-meets-neurips-2022
  ☆47Updated last year
• vidalt / PDTSP
  Code and data from the paper "Exponential-size neighborhoods for the pickup-and-delivery traveling salesman problem", authored by T. Pach…
  ☆18Updated 2 years ago
• alberto-santini / cvrp-decomposition
  Decomposition Strategies for Vehicle Routing Heuristics
  ☆29Updated last year
• Sasanm88 / TSPDroneHGATAC.jl
  A package that uses Hybrid Genetic Algorithm to solve any TSPD or FSTSP instance
  ☆13Updated last month
• jdumouchelle / IntegerLShaped
  A python implementation of the integer L-shaped method for solving two stage stochastic programs.
  ☆19Updated 11 months ago
• ggz1616 / PDPTW
  This prepository contains the implementation of a Branch and Cut and Price algorithm in order to solve the NP-hard Pickup and Delivery Pr…
  ☆28Updated 6 years ago
• N-Wouda / Euro-NeurIPS-2022
  OptiML's contribution to the EURO meets NeurIPS 2022 vehicle routing competition.
  ☆17Updated 2 years ago
• cssartori / pdptw-instances
  Instances for the Pickup and Delivery Problem with Time Windows (PDPTW) based on open data
  ☆51Updated last month
• temur-kh / pdp-drl-project
  Deep reinforcement approach to solving dynamic pickup and delivery problem
  ☆18Updated 3 years ago
• tumBAIS / RoutingBlocks
  A modular Python package for the development of metaheuristic algorithms for Vehicle Routing Problems with Intermediate Stops
  ☆24Updated last year
• clussificate / SNDHLP
  A branch-and-price-and-cut algorithm for service network design and hub location problem
  ☆17Updated 2 years ago
• tingyingwu2021 / BPC-for-EVRPTW
  C++ branch-price-and-cut framework for electric vehicle routing problem with release time and due date, bounded bidirectional label setti…
  ☆10Updated 3 years ago
• khalil-research / Neur2SP
  Neur2SP: Neural Two-Stage Stochastic Programming
  ☆48Updated 2 years ago
• INFORMSJoC / 2021.0326
  ☆17Updated 2 years ago
• 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
• c4v4 / LKH3
  Customized version of Helsgaun's LKH3 algorithm for vehicle routing problems.
  ☆29Updated last month
• mahdims / Branch-and-price-
  This is my implementation of a branch and price algorithm to solve the humanitarian aid distribution problem. This problem is a VRP with …
  ☆49Updated last year
• jjuppe / Hybrid-Genetic-Search-with-Adaptive-Diversity-Control
  HGSADC is a metaheuristic to solve the multi-depot vehicle routing problem.
  ☆31Updated 6 years ago
• isaac0821 / BendersDecomposition
  Learning Benders Decomposition by Coding
  ☆31Updated 3 years ago
• ncabrera10 / VRPTW
  Branch-price-and-cut code for the VRPTW
  ☆27Updated 2 years ago
• jomavera / branchAndPriceVRP
  Test on how to implement Branch and Price for VRP with Gurobi (work in progress)
  ☆34Updated 4 years ago
• chkwon / PyHygese
  A Python wrapper for the Hybrid Genetic Search algorithm for Capacitated Vehicle Routing Problems (HGS-CVRP)
  ☆91Updated 2 months ago
• mouadmorabit / MLColumnSelection
  Machine-learning-based column selection
  ☆36Updated 3 years ago