Alternatives and similar repositories for flexible-routing

Users that are interested in flexible-routing are comparing it to the libraries listed below

• michaelzcjia / smart_predict_optimize
  MIE424 Group Project: smart_predict_optimize
  ☆14Updated 4 years ago
• temur-kh / pdp-drl-project
  Deep reinforcement approach to solving dynamic pickup and delivery problem
  ☆20Updated 4 years ago
• JayMan91 / aaai_predit_then_optimize
  Code release for AAAI 2020 paper "Smart Predict-and-Optimize for Hard Combinatorial Optimization Problems"
  ☆39Updated last year
• rohitkannan / DD-SAA
  Codes for the paper "Data-Driven Sample Average Approximation with Covariate Information"
  ☆13Updated 3 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…
  ☆60Updated 2 years ago
• Rintarooo / MDVRP_MHA
  Multi-Depot Vehicle Routing Problem solver using Deep RL, GA and Google OR-Tools
  ☆79Updated 4 years ago
• markkvdb / MDSDHVRP-Solver
  Large neighbourhood solver for the multi-depot split-delivery vehicle routing problem with inventory constraints and heterogeneous fleet.
  ☆19Updated 5 years ago
• khalil-research / Neur2SP
  Neur2SP: Neural Two-Stage Stochastic Programming
  ☆51Updated 2 years ago
• cornell-orie / ORSuite
  ☆14Updated 2 years ago
• xNok / OR_location_routing_problem_study
  Facility Location and routing problems: Survey, Models and Algorithm
  ☆33Updated 4 years ago
• yuzhenfeng2002 / Multi-Commodity-Network-Flow
  Multi-commodity network flow via Dantzig-Wolfe decomposition (Python).
  ☆22Updated 2 years ago
• michieluithetbroek / A-MDVRP
  Asymmetric multi-depot vehicle routing problems: valid inequalities and a branch-and-cut algorithm
  ☆49Updated 3 years ago
• CausalML / StochOptForest
  Replication Code for Paper "Stochastic Optimization Forests".
  ☆21Updated 4 years ago
• JayMan91 / NeurIPSIntopt
  Implementation of "Interior Point Solving for LP-based prediction+optimisation" paper in Neurips 2020.
  ☆20Updated last year
• google-deepmind / neural_lns
  ☆49Updated 3 years ago
• nsidn98 / NICE
  Combining Reinforcement Learning with Integer Programming for Robust Scheduling
  ☆28Updated last year
• WXY1427 / Learn-LNS-policy
  ☆34Updated 3 years ago
• ds4dm / branch-search-trees
  Parameterizing Branch-and-Bound Search Trees to Learn Branching Policies (AAAI 2021)
  ☆68Updated 4 years ago
• heldstephan / jpt-amz
  ☆65Updated last year
• 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
• mpinta / evovrp
  🧬 Solving MDVRP using evolutionary algorithms.
  ☆17Updated 3 years ago
• goerigk / RO-DNN
  Data and code for the paper Data-Driven Robust Optimization using Unsupervised Deep Learning written by Marc Goerigk and Jannis Kurtz
  ☆27Updated 4 years ago
• fboliveira / MDVRP-Instances
  Multiple Depot VRP Instances
  ☆29Updated 10 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
• Valdecy / pyCombinatorial
  This library provides a comprehensive suite of algorithms to solve the Travelling Salesman Problem (TSP), ranging from Exact Algorithms, …
  ☆130Updated 4 months ago
• rtm2130 / SPOTree
  ☆33Updated 5 years ago
• khalil-research / Neur2RO
  ☆29Updated 11 months ago
• ds4dm / learn2comparenodes
  Learning to Compare Nodes in Branch and Bound with Graph Neural Networks (NeurIPS 2022)
  ☆23Updated 3 years ago
• meituan / Meituan-INFORMS-TSL-Research-Challenge
  ☆133Updated last year
• wouterkool / dpdp
  DPDP
  ☆102Updated 2 years ago