Efficient Mobility-on-Demand System with Ride-Sharing
classification
🧮 math.OC
keywords
algorithmmobility-on-demandnetworkassignmentbenchmarkbenefitsclustercompared
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.