pith. sign in

arxiv: 1901.07906 · v1 · pith:OVIGUBIZnew · submitted 2019-01-22 · 💻 cs.DS · physics.soc-ph

How Many Passengers Can We Serve with Ride-sharing?

classification 💻 cs.DS physics.soc-ph
keywords ride-sharingtimealgorithmproposedreducetravelapproximationcongestion
0
0 comments X
read the original abstract

Ride-sharing can reduce traffic congestion and thus reduce gas emissions and save travel time. However, transportation system with ride-sharing is currently inefficient due to low occupancy rate, high travel demand and some other factors. Existing literature did not consider ride-sharing with multi-request grouped in one trip. In our paper, we firstly proposed a graph-based algorithm that can obtain an approximation solution in polynomial time and then proposed an exact algorithm to solve this problem with maximizing the number of passenegers served in $O(1.2312^{|\mathcal{E}|})$ time.

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.