maniezzo / MatheuristicsGAP
Accompanying code for the text: Maniezzo, Vittorio, Boschetti, Marco Antonio, Stützle, Thomas "Matheuristics, algorithms and implementations" EURO Advanced Tutorials on Operational Research, Springer, 2021 https://www.springer.com/us/book/9783030702762
☆16Updated 11 months ago
Alternatives and similar repositories for MatheuristicsGAP:
Users that are interested in MatheuristicsGAP are comparing it to the libraries listed below
- Bucket Graph Labeling Algorithm for Vehicle Routing☆16Updated 3 weeks ago
- Python codes for the traveling salesman problem and vehicle routing problem☆65Updated 2 years ago
- Library of Split algorithms, including the O(n) (linear time) algorithm for the CVRP, from "Vidal, Thibaut (2016). Technical note: Split …☆16Updated 6 years ago
- 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
- Customized version of Helsgaun's LKH3 algorithm for vehicle routing problems.☆26Updated 2 years ago
- A C++ Framework for Optimization☆33Updated this week
- A state-of-the-art exact Branch-Cut-and-Price algorithm for the Capacitated Location-Routing Problem and related problems☆18Updated 2 years ago
- A matheuristic approach for the Capacitated Vehicle Routing Problem☆50Updated 2 years ago
- A column generation algorithm (CG) for the capacitated vehicle routing problem (CVRP)☆10Updated 2 years ago
- Source code associated with the paper: "Vidal, T., Martinelli, R., Pham, T. A., & Hà, M. H. (2021). Arc routing with time-dependent trave…☆19Updated 4 years ago
- A Python wrapper for the Hybrid Genetic Search algorithm for Capacitated Vehicle Routing Problems (HGS-CVRP)☆90Updated 2 years ago
- Elementary branch-price-and-cut algorithm for the vehicle routing problem with stochastic demands under optimal restocking☆16Updated 2 years ago
- A Branch-and-Cut based Pricer for the Capacitated Vehicle Routing Problem☆15Updated last year
- OptiML's contribution to the EURO meets NeurIPS 2022 vehicle routing competition.☆17Updated 2 years ago
- A Fast Iterated-Local-Search Localized Optimization algorithm for the CVRP.☆48Updated last year
- A tutorial on using C++/Cplex for OR problems. The tutorial is intended to be useful for every OR practitioner with an intermediary knowl…☆40Updated 3 years ago
- The CVRPSEP package is a collection of routines, written in the C++ programming language, for separation of various classes of cuts in br…☆21Updated 8 months ago
- Decomposition Strategies for Vehicle Routing Heuristics☆28Updated last year
- Presentation: Custom MIP Heuristics☆33Updated 3 years ago
- Multiple Depot VRP Instances☆27Updated 9 years ago
- RouteOpt☆37Updated last week
- 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
- A branch-and-price-and-cut algorithm for service network design and hub location problem☆18Updated 2 years ago
- This prepository contains the implementation of a Branch and Cut and Price algorithm in order to solve the NP-hard Pickup and Delivery Pr…☆26Updated 6 years ago
- ☆46Updated 9 months ago
- Adaptive Heuristic Method Based on SA and LNS for Solving Vehicle Routing Problem☆13Updated 7 years ago
- Asymmetric multi-depot vehicle routing problems: valid inequalities and a branch-and-cut algorithm☆48Updated 3 years ago
- Using advanced MIP decomposition techniques like Column Generation, Benders' Decomposition, Lagrangian Relaxation to solve CVRP and UFL w…☆48Updated 5 years ago
- It's the implementation for "A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems"☆18Updated 10 months ago
- Large scale decomposition algorithm (Lagrangian relaxation, Benders decomposition & Column generation) for CDN communication network.☆11Updated 6 years ago