Search Results for author:
Found 4 papers, 1 papers with code
Optimal Chaining of Vehicle Plans with Time Windows
The method does not consider the time flexibility of the plans.
Large-scale Ridesharing DARP Instances Based on Real Travel Demand
With the rise of large MoD systems and the availability of open travel demand datasets for many US cities, there is now an opportunity to evaluate these algorithms on standardized, realistic, and representative instances.
Large-scale Online Ridesharing: The Effect of Assignment Optimality on System Performance
We found that the system that uses optimal ridesharing assignments subject to the maximum travel delay of 4 minutes reduces the vehicle distance driven by 57 % compared to an MoD system without ridesharing.
Map Matching Algorithm for Large-scale Datasets
The goal of map matching is to infer the trajectory that the device followed in a road network from a potentially sparse series of noisy location measurements.
