☆55Jul 30, 2025Updated 10 months ago
Alternatives and similar repositories for euro-meets-neurips-2022
Users that are interested in euro-meets-neurips-2022 are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- OptiML's contribution to the EURO meets NeurIPS 2022 vehicle routing competition.☆18Dec 7, 2022Updated 3 years ago
- ☆11Jan 11, 2022Updated 4 years ago
- Combinatorial optimization layers for machine learning pipelines☆131Updated this week
- Feasibility Pump Collection☆16Jul 6, 2023Updated 2 years ago
- A highly-flexible and high-performance meta-heuristic for the vehicle routing problems (VRP)☆25Nov 18, 2020Updated 5 years ago
- Deploy open-source AI quickly and easily - Special Bonus Offer • AdRunpod Hub is built for open source. One-click deployment and autoscaling endpoints without provisioning your own infrastructure.
- This repo implements our paper, "Efficient Neural Neighborhood Search for Pickup and Delivery Problems", which has been accepted as short…☆63Dec 11, 2022Updated 3 years ago
- ☆27Mar 10, 2026Updated 3 months ago
- Quickstart for EURO Meets NeurIPS 2022 Vehicle Routing Competition☆99Feb 24, 2023Updated 3 years ago
- Adaptive Large Neighborhood Search Algorithm for paper "Robust Dual Sourcing Inventory Routing Optimization for Disaster Relief"☆17Jan 25, 2023Updated 3 years ago
- Large neighbourhood solver for the multi-depot split-delivery vehicle routing problem with inventory constraints and heterogeneous fleet.☆19Feb 27, 2020Updated 6 years ago
- A simple Python interface for VRPSolver, a state-of-the-art Branch-Cut-and-Price exact solver for vehicle routing problems☆165Jan 22, 2026Updated 5 months ago
- Two-Echelon Capacitated location-routing problem of Heterogeneous fleets☆10Oct 30, 2021Updated 4 years ago
- ☆12May 8, 2024Updated 2 years ago
- A set of reusable components for fast prototyping CVRP heuristic solution approaches.☆18Jul 31, 2025Updated 10 months ago
- Simple, predictable pricing with DigitalOcean hosting • AdAlways know what you'll pay with monthly caps and flat pricing. Enterprise-grade infrastructure trusted by 600k+ customers.
- ☆11Mar 8, 2024Updated 2 years ago
- Set Partitioning Heuristic (SPH) based on CPLEX MILP solver and created starting from the CFT Heuristic implemented by Accorsi Luca and C…☆14Dec 1, 2023Updated 2 years ago
- This is the source code for solving the Traveling Salesman Problems (TSP) using Monte Carlo tree search (MCTS).☆35Sep 25, 2019Updated 6 years ago
- Reinforcement Learning agents for a selection Hyper-Heuristic☆11Sep 10, 2022Updated 3 years ago
- Large Neighborhood Search based on Neural Construction Heuristics☆45May 3, 2022Updated 4 years ago
- PyTorch implementation of GCN-NPEC in "Efficiently Solving the Practical Vehicle Routing Problem: A Novel Joint Learning Approach"☆47Oct 12, 2022Updated 3 years ago
- Very small and simple parser for CPLEX LP files into logical Python data structures☆11Dec 20, 2012Updated 13 years ago
- Efficient Active Search☆53Mar 25, 2022Updated 4 years ago
- A system implementation of the thesis titled "Solving Dynamic Multi Depot Vehicle Routing Problem using Modified Hybrid Ant Colony Optimi…☆18Jan 21, 2023Updated 3 years ago
- Virtual machines for every use case on DigitalOcean • AdGet dependable uptime with 99.99% SLA, simple security tools, and predictable monthly pricing with DigitalOcean's virtual machines, called Droplets.
- Neural Large Neighborhood Search: Learn to Design Heuristics for Vehicle Routing Problem (VRP), by Deep Learning and Reinforcement Learni…☆94Mar 10, 2021Updated 5 years ago
- An open-source Python package to solve Inverse Optimization problems.☆18Oct 3, 2024Updated last year
- [ICAPS 2024] DR-ALNS: Deep Reinforced Adaptive Large Neighborhood Search☆57Jun 23, 2025Updated last year
- Code for ICLR2022 Paper: Pareto Set Learning for Neural Multi-objective Combinatorial Optimization☆69Apr 21, 2022Updated 4 years ago
- An algorithmic framework for parallel dual decomposition methods in Julia☆19Aug 1, 2024Updated last year
- Python package to read and write vehicle routing problem instances.☆126Apr 6, 2026Updated 2 months ago
- ☆94May 14, 2026Updated last month
- HGSADC is a metaheuristic to solve the multi-depot vehicle routing problem.☆32Aug 12, 2018Updated 7 years ago
- Implementation of the Caprara, Fischetti, and Toth algorithm for the Set Covering problem.☆18Mar 5, 2025Updated last year
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- Online algorithms for solving large-scale dynamic vehicle routing problems with stochastic requests☆90Jul 21, 2022Updated 3 years ago
- A Reinforcement Learning Approach to the Orienteering Problem with Time Windows☆25Dec 5, 2021Updated 4 years ago
- ☆21Sep 11, 2021Updated 4 years ago
- This is a repository for ALNS. Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows.☆82Oct 4, 2023Updated 2 years ago
- ☆61Oct 23, 2022Updated 3 years ago
- Modern implementation of the hybrid genetic search (HGS) algorithm specialized to the capacitated vehicle routing problem (CVRP). This co…☆437Mar 26, 2025Updated last year
- "Attention, Learn to Solve Routing Problems!"[Kool+, 2019], Capacitated Vehicle Routing Problem solver☆208Jan 12, 2021Updated 5 years ago