A Data-Driven Optimization Method for Reallocating the Free-Floating Bikes

  • Ming LiuEmail author
  • Xifen Xu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11434)


Free-floating bike sharing (FFBS) is a new bike sharing mode when compared to the traditional station-based bike sharing (SBBS). It brings convenience for users since bikes can be picked up and returned anywhere but not the fixed stations. However, it also brings difficulty for managers because reallocation of free-floating bikes is totally different from any traditional ones. Using data-driven method, we define two types of nodes in this paper (i.e., easily and hardly accessed nodes), to represent different convenience levels of getting bikes from the FFBS. We collect bikes at hardly accessed nodes and reallocate them to the easily accessed nodes. Our objective is to move the needed bikes in the shortest distance and meanwhile to maximize the operation revenue. The problem is formulated as a multi-objective mixed integer programming model and an effective algorithm is designed to solve it. The test results can provide several constructive suggestions for reallocating the free-floating bikes.


Free-floating bike sharing Static reallocation Multi-objective optimization 



This work was supported by National Natural Science Foundation of China (No. 71771120) and MOE (Ministry of Education) Project of Humanities and Social Sciences (No. 17YJA630058).


  1. 1.
    Caggiani, L., Camporeale, R., Ottomanelli, M.: Wai Yuen Szeto.: A modeling framework for the dynamic management of free-floating bike-sharing systems. Transp. Res. Part C 87, 159–182 (2018)CrossRefGoogle Scholar
  2. 2.
    Yi, A., Zongping, L., Mi, G.: A solution to measure travel’s transfer tolerance for walking mode and dockless bike-sharing mode. J. Supercomput. 1, 1–18 (2018)Google Scholar
  3. 3.
    Bike-sharing: Users share perks, gripes. Accessed 26 Sept. 2018
  4. 4.
    Chemal, D., Meunier, F., Calvo, R.W.: Bike sharing systems: Solving the static rebalancing problem. Discrete Optim. 10, 120–146 (2013)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Dell’ Amico, M., Hadjicostantinou, E., Iori, M., Novellani, S.: The bike sharing rebalancing problem: mathematical formulations and benchmark instances. Omega 87, 7–19 (2014)CrossRefGoogle Scholar
  6. 6.
    Kloimüllner, C., Papazek, P., Hu, B., Raidl, Günther R.: A cluster-first route-second approach for balancing bicycle sharing systems. In: Moreno-Díaz, R., Pichler, F., Quesada-Arencibia, A. (eds.) EUROCAST 2015. LNCS, vol. 9520, pp. 439–446. Springer, Cham (2015). Scholar
  7. 7.
    Zhang, D., Yu, C., Desai, J., Lau, H.Y.K., Srivathsan, S.: A time-space network flow approach to dynamic repositioning in bicycle sharing systems. Transp. Res. Part B 103, 188–207 (2017)CrossRefGoogle Scholar
  8. 8.
    Pal, A., Zhang, Y.: Free-floating bike sharing: solving real-life large-scale static rebalancing problems. Transp. Res. Part C 80, 92–116 (2017)CrossRefGoogle Scholar
  9. 9.
    Liu, Y., Szeto, W.Y., Ho, S.G.: A static free-floating bike repositioning problem with multiple heterogeneous vehicles, multiple depots, and multiple visits. Transp. Res. Part C 92, 208–242 (2018)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.School of Economics and ManagementNanjingPeople’s Republic of China

Personalised recommendations