# Efficient Mobility-on-Demand System with Ride-Sharing

arXiv: https://arxiv.org/abs/1804.02260 · HTML: https://mlsanity.com/paper/1804.02260/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 6 Apr 2018.

## Built on by (most cited first, 1 of 1)

- [A Convex Hull Cheapest Insertion Heuristic for the Non-Euclidean TSP](https://mlsanity.com/paper/2302.06582/) (2023)

## Abstract (arXiv)

An algorithm to cluster mobility-on-demand trips considering road network structure is developed in this paper. The benefits of our network partition algorithm are demonstrated in numerical simulations, showing that we can use fewer vehicles and can serve more customers with slightly longer wait time by including predicted future travel demand in trip assignment, compared with the benchmark reactive control policy.