Implementation of a Branch-and-Cut Algortihm for a Dial-a-Ride Problem with the CPLEX JAVA API.
-
Updated
Mar 3, 2020 - Java
Implementation of a Branch-and-Cut Algortihm for a Dial-a-Ride Problem with the CPLEX JAVA API.
A user-friendly implementation of the DARP algorithm for multi-agent coverage path planning (MCPP).
Routing Simulator for the Dial-a-Ride Problem (DARP) using Google Operations Research Tools (Google OR-Tools) to generate the routing solutions. Master's degree project.
A dataset consisting of 46K MCPP solutions found using DARP.
Add a description, image, and links to the darp topic page so that developers can more easily learn about it.
To associate your repository with the darp topic, visit your repo's landing page and select "manage topics."