Pith. sign in

REVIEW

Minimizing Fleet Size and Improving Bike Allocation of Bike Sharing under Future Uncertainty

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2204.08603 v1 pith:ECNUKE35 submitted 2022-04-19 stat.OT

Minimizing Fleet Size and Improving Bike Allocation of Bike Sharing under Future Uncertainty

classification stat.OT
keywords bikefleetsharingsizeserviceuncertaintyunderfuture
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

As a rapidly expanding service, bike sharing is facing severe problems of bike over-supply and demand fluctuation in many Chinese cities. This study develops a large-scale method to determine the minimum fleet size under uncertainty, based on the bike sharing data of millions of trips in Nanjing. It is found that the algorithm of minimizing fleet size under the incomplete-information scenario is effective in handling future uncertainty. For a dockless bike sharing system, supplying 14.5% of the original fleet could meet 96.8% of trip demands. Meanwhile, the results suggest that providing a integrated service platform that integrates multiple companies can significantly reduce the total fleet size by 44.6%. Moreover, in view of the COVID-19 pandemic, this study proposes a social distancing policy that maintains a suitable usage interval. These findings provide useful insights for improving the resource efficiency and operational service of bike sharing and shared mobility.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.