-
Notifications
You must be signed in to change notification settings - Fork 10
Home
Welcome to the Asymmetric Multi-Depot Vehicle Routing Problem (A-MDVRP) wiki!
The key components of the repository are the valid inequalities, the branch-and-bound, and the upper bound procedure. In short, our framework uses a branch-and-cut algorithm to provide lower bounds of the problem (implemented with CPLEX which focuses on improving the lower bound and not on finding new solutions) and uses an upper bound produced (implemented with Gurobi) to find feasible solutions.
Uit het Broek, MAJ, AH Schrotenboer, B Jargalsaikhan, KJ Roodbergen, and LC Coelho (2020). Asymmetric multi-depot vehicle routing problems: valid inequalities and a branch-and-cut algorithm. Operations Research.
Our implementation is distributed under the MIT License, which more or less states that you can do with the code whatever you want and that there is no warranty of any kind.