Shared Bikes Scheduling under Users' Travel Uncertainty

5Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

With the rise of green concept, shared bikes are booming. The accompanying unbalanced scheduling problem is a scientific problem that needs to be solved urgently. Aiming at the problem of shared bikes scheduling with travel uncertainty, a multi-objective integer programming model is established based on the consideration of static demand of fix time period, station capacity limit, penalty cost and other practical factors. In addition, this paper gives the basic formula to calculate the parameters in the model. An algorithm based on 'ant colony algorithm' is then given to solve the model. Taking the massive data provided by the 'Mobike' company in 2017 as an example, this paper uses the program analysis data to prove the feasibility and effectiveness of the model and get the initial optimization plan. Finally, the data simulation is carried out to verify the feasibility and accuracy of the optimization scheme and the optimization scheme is adjusted accordingly to obtain the final optimization scheme. The research results show that the final optimization scheme proposed in this paper has certain reference value for the scheduling problem of Shanghai 'Mobike.'

Cite

CITATION STYLE

APA

Zhang, Z. Y., & Zhang, X. (2020). Shared Bikes Scheduling under Users’ Travel Uncertainty. IEEE Access, 8, 3123–3143. https://doi.org/10.1109/ACCESS.2019.2961628

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free