Quickstart for EURO Meets NeurIPS 2022 Vehicle Routing Competition
☆99Feb 24, 2023Updated 3 years ago
Alternatives and similar repositories for euro-neurips-vrp-2022-quickstart
Users that are interested in euro-neurips-vrp-2022-quickstart are comparing it to the libraries listed below
Sorting:
- OptiML's contribution to the EURO meets NeurIPS 2022 vehicle routing competition.☆17Dec 7, 2022Updated 3 years ago
- Modern implementation of the hybrid genetic search (HGS) algorithm specialized to the capacitated vehicle routing problem (CVRP). This co…☆419Mar 26, 2025Updated 11 months ago
- Decomposition Strategies for Vehicle Routing Heuristics☆32Nov 25, 2023Updated 2 years ago
- DPDP☆105Jan 2, 2023Updated 3 years ago
- A modular Python package for the development of metaheuristic algorithms for Vehicle Routing Problems with Intermediate Stops☆29Dec 27, 2023Updated 2 years ago
- Neural Destruction Search for Vehicle Routing Problems☆18Oct 6, 2025Updated 5 months ago
- Source code associated with the paper "Deep Learning for Data-Driven Districting-and-Routing", authored by A. Ferraz, Q. Cappart, and T. …☆27Jul 2, 2025Updated 8 months ago
- Python package to read and write vehicle routing problem instances.☆122Dec 9, 2025Updated 3 months ago
- ☆53Jul 30, 2025Updated 7 months ago
- HybridCVRP: A Hybrid Metaheuristic Solver for the Capacitated Vehicle Routing Problem☆28Oct 15, 2022Updated 3 years ago
- A simple Python interface for VRPSolver, a state-of-the-art Branch-Cut-and-Price exact solver for vehicle routing problems☆164Jan 22, 2026Updated last month
- ☆43Nov 17, 2023Updated 2 years ago
- Adaptive large neighbourhood search (and more!) in Python.☆607Feb 25, 2025Updated last year
- Large Neighborhood Search Solver for the Vehicle Routing Problem with Time Windows☆25Oct 13, 2014Updated 11 years ago
- ALNS header-only library (loosely) based on the original implementation by Stefan Ropke.☆78May 29, 2024Updated last year
- RouteOpt☆73Jan 17, 2026Updated last month
- VRPH is an open source library of heuristics for the capacitated Vehicle Routing Problem (VRP).☆25Apr 23, 2019Updated 6 years ago
- A Julia interface for VRPSolver☆18Nov 17, 2025Updated 3 months ago
- ☆27Updated this week
- A more scalable version of FILO.☆31Jan 11, 2026Updated last month
- Code and data from the paper "Exponential-size neighborhoods for the pickup-and-delivery traveling salesman problem", authored by T. Pach…☆19Jan 18, 2023Updated 3 years ago
- Open-source, state-of-the-art vehicle routing problem solver in an easy-to-use Python package.☆586Updated this week
- Solve optimization problems and build custom algorithms☆38Updated this week
- Representing CP problems as graphs☆20Dec 18, 2024Updated last year
- A Fast Iterated-Local-Search Localized Optimization algorithm for the CVRP.☆51Jul 15, 2023Updated 2 years ago
- multi-task learning for routing problem☆23Dec 2, 2025Updated 3 months ago
- COMPASS: Combinatorial Optimization with Policy Adaptation using Latent Space Search☆42Jun 21, 2024Updated last year
- This repo implements our paper, "Learning to Iteratively Solve Routing Problems with Dual-Aspect Collaborative Transformer", which has be…☆118Jun 3, 2024Updated last year
- A Python wrapper for the Hybrid Genetic Search algorithm for Capacitated Vehicle Routing Problems (HGS-CVRP)☆98Mar 30, 2025Updated 11 months ago
- A python library with implementations of 15 classical heuristics for the capacitated vehicle routing problem.☆282Dec 2, 2023Updated 2 years ago
- Official Implementation of the paper: INViT: A Generalizable Routing Problem Solver with Invariant Nested View Transformer☆26Jul 4, 2024Updated last year
- Hybrid Genetic Search for Arc Routing Problems. From "Node, edge, arc routing and turn penalties : Multiple problems - One neighborhood e…☆38Jun 13, 2021Updated 4 years ago
- ☆19Jun 12, 2024Updated last year
- This is the official repository of the AI for TSP competition at IJCAI 2021☆27Nov 22, 2022Updated 3 years ago
- [NeurIPS 2025] PARCO: Parallel AutoRegressive Combinatorial Optimization☆42Dec 3, 2025Updated 3 months ago
- ☆69Aug 30, 2024Updated last year
- 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
- Official implementation of paper "Learning Topological Representations with Bidirectional Graph Attention Network for Solving Job Shop Sc…☆31Jun 13, 2025Updated 8 months ago
- ☆83Aug 5, 2022Updated 3 years ago