A paper list of the papers on ridesharing
-
Updated
Apr 4, 2020
A paper list of the papers on ridesharing
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.
Bonus project @ Deterministic Models course, about Dail a Ride problem.
An efficient insertion framework called GreedyDP for shared mobility services.
High Performance solving suite for the Pickup and Delivery Problem and its related extensions.
Code for the project "The Transformer Network for the Dial-a-Ride Problem"
A demand-responsive transport platform.
This simulator uses a proposed non-myopic cost function approximation policy to allow passengers to have synchronized transfers within a ride-pooling system.
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
Karlsruhe Rapid Ridesharing (KaRRi) Dynamic Taxi Sharing Dispatcher.
Add a description, image, and links to the dial-a-ride topic page so that developers can more easily learn about it.
To associate your repository with the dial-a-ride topic, visit your repo's landing page and select "manage topics."