There are 2 repositories under dial-a-ride topic.
High Performance solving suite for the Pickup and Delivery Problem and its related extensions.
A paper list of the papers on ridesharing
An efficient insertion framework called GreedyDP for shared mobility services.
Last-Mile Delivery Made Practical: An Efficient Route Planning Framework with Theoretical Guarantees
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.
Transformer network capable of cloning a supervision policy on Dial-a-Ride problem instances.
This simulator uses a proposed non-myopic cost function approximation policy to allow passengers to have synchronized transfers within a ride-pooling system.
Bonus project @ Deterministic Models course, about Dail a Ride problem.
NOMAD-RPS is a dynamic ride-pooling simulator that uses a non-myopic cost function approximation policy to make sequential decisions and find the best matches between riders and vehicles in the system