Implementation of a Branch-and-Cut Algortihm for a Dial-a-Ride Problem with the CPLEX JAVA API.
-
Updated
Mar 3, 2020 - Java
#
darp
Here are 10 public repositories matching this topic...
A user-friendly implementation of the DARP algorithm for multi-agent coverage path planning (MCPP).
-
Updated
Jan 29, 2023 - Python
Karlsruhe Rapid Ride-Pooling (KaRRi) Dynamic Ride-Pooling Dispatcher.
public-transportation maas algorithm-engineering taxi public-transport darp dial-a-ride public-transit taxi-sharing routing-algorithms future-mobility ride-pooling
-
Updated
Aug 31, 2026 - C++
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.
-
Updated
Feb 27, 2021 - C#
A dataset consisting of 46K MCPP solutions found using DARP.
-
Updated
Jan 24, 2023 - Python
A high-performance C++ algorithmic solver for Heterogeneous Fleet Routing and Dial-a-Ride Problems (DARP) utilizing ALNS, VNS, and Branch-and-Cut.
docker algorithm cpp optimization multithreading vehicle-routing-problem operations-research branch-and-cut alns darp crow-framework
-
Updated
May 16, 2026 - C++
Multi-Depot Dial-a-Ride (MD-DARP) solver. The project contains exact and approximation methods for solving the problem.
-
Updated
Jun 30, 2026 - C++
Deployment manifests and runbooks for Woodfine's production instance of the PointSav platform.
-
Updated
Sep 8, 2026 - HTML
Technical documentation for the PointSav platform — architecture, security model, and how-to guides (EN/ES).
-
Updated
Sep 8, 2026
Add this topic to your repo
To associate your repository with the darp topic, visit your repo's landing page and select "manage topics."