Exact Matching of Attractive Shared rides (ExMAS) for system-wide strategic evaluations
Scalable off-line strategic utility-based ride-pooling algorithm
ExMAS allows you to match trips into attractive shared rides.
For a given:
- network (
osmnxgraph), - demand (microscopic set of trips q_i = (o_i, d_i, t_i))
- parameters (behavioural, like willingness-to-share and system like discount for shared rides)
It computes:
- optimal set of shared rides (results of bipartite matching with a given objective)
- shareability graph
- set of all feasible rides
- KPIs of sharing
- trip sharing attributes
ExMAS is a python based open-source package applicable to general networks and demand patterns.
If you find this code useful in your research, please consider citing:
Kucharski R. , Cats. O 2020. Exact matching of attractive shared rides (ExMAS) for system-wide strategic evaluations, Transportation Research Part B 139 (2020) 285-310 https://doi.org/10.1016/j.trb.2020.06.006
- Quickstart tutorial
- Configuration
- Your own networks
- You own demand
- Bigger demand levels
- Parallel experiments and plotting results
- Completeness test
pip install ExMAS
clone this repository for latest version
or use one of releases for stable versions
Rafał Kucharski, TU Delft, 2020 r.m.kucharski (at) tudelft.nl