Skip to main content

Advertisement

SpringerLink
Log in

Dynamic bicycle scheduling problem based on short-term demand prediction

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

As a low-cost environmentally-friendly travel mode, public bicycles have been widely applied in many large cities and have greatly facilitated people’s daily lives. However, it is hard to find bicycles to rent or places to return at some stations in peak hours due to the unbalanced distribution of public bicycles. And the traditional scheduling methods have hysteresis, in general, the demands might have changed when the dispatch vehicle arrives the station. To better solve such problems, we propose a dynamic scheduling (DBS) model based on short-term demand prediction. In this paper, we first adopt K-means to cluster the stations and adopt random forest (RF) to predict the check-out number of bikes in each clustering. In addition, the multi-similarity inference model is applied to calculate the check-out probability of each station for check-out prediction, and a probabilistic model is proposed for check-in prediction in the cluster. Based on the prediction results, an enhanced genetic algorithm (E-GA) is applied to optimize the bicycle scheduling route. Finally, we evaluated the performance of the models through a one-year dataset from Chicago’s public bike-sharing system (BSS) with more than 500 stations and over 3.8 million travel records. Compared with other prediction methods and scheduling approaches, the proposed approach has better performance.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15

Similar content being viewed by others

References

  1. Abdallah AMFM, Essam DL, Sarker RA (2017) On solving periodic re-optimization dynamic vehicle routing problems. Appl Soft Comput 55:1–12. https://doi.org/10.1016/j.asoc.2017.01.047

    Article  Google Scholar 

  2. Álvaro L, Paz JD, González GV, Iglesia D, Bajo J (2018) Multi-agent system for demand prediction and trip visualization in bike sharing systems. Appl Sci 8(1):67. https://doi.org/10.3390/app8010067

    Article  Google Scholar 

  3. Breiman L (2001) Random forest. Mach Learn 45:5–32

    Article  MATH  Google Scholar 

  4. Chen LB, Zhang DQ, Wang L, Yang DQ, Ma XJ, et al (2016) Dynamic cluster-based over-demand prediction in bike sharing systems. ACM, pp 841–852. https://doi.org/10.1145/2971648.2971652

  5. Chen PC, Hsieh HY, Sigalingging XK, Chen YR, Leu JS (2017) Prediction of station level demand in a bike sharing system using recurrent neural networks. In: IEEE Vehicular Technology Conference, pp 1–5

  6. Costa PRDOD, Mauceri S, Carroll P, Pallonetto F (2018) A genetic algorithm for a green vehicle routing problem. Electron Notes Discrete Math 64:65–74. https://doi.org/10.1016/j.endm.2018.01.008

    Article  MathSciNet  MATH  Google Scholar 

  7. Dong HZ, Zhao JY, Guo HF, Guo MF (2009) Research on the dynamic model and rolling horizon scheduling algorithm for public-use bicycle vehicle scheduling problem. Highw Eng 34(6):68–71

    Google Scholar 

  8. Feng YL, Wang SS (2017) A forecast for bicycle rental demand based on random forests and multiple linear regression. IEEE. https://doi.org/10.1109/ICIS.2017.7959977

  9. Hanshar FT, Ombuki-Berman BM (2007) Dynamic vehicle routing using genetic algorithms. Kluwer Academic Publishers 27:89–99. https://doi.org/10.1007/s10489-006-0033-z

    MATH  Google Scholar 

  10. He L, Li XD, Chen DW, Lu J, Wu YY (2013) Research on the demand forecast model of public bike dynamic scheduling system. Journal of Wuhan University of Technology 37(2):278–282. https://doi.org/10.3963/j.issn.2095-3844.2013.02.014

    Google Scholar 

  11. He Y, Han Y (2017) Research on public bicycle dispatching path based on ant colony algorithm. Agricultural Equipment & Vehicle Engineering 55(1):27–30. https://doi.org/10.3969/j.issn.1673-3142.2017.01.006

    Google Scholar 

  12. Li Y, Szeto WY, Long J, Shui CS (2016) A multiple type bike repositioning problem. TRANSPORT RES B-METH 90:263–278. https://doi.org/10.1016/j.trb.2016.05.010

    Article  Google Scholar 

  13. Li YX, Zheng Y, Zhang HC, Chen L (2015) Traffic prediction in a bike-sharing system. ACM 33:1–10. https://doi.org/10.1145/2820783.282083

    Google Scholar 

  14. Lin L, He ZB, Peeta S, Wen XJ (2017) Predicting Station-level Hourly Demands in a Large-scale Bike-sharing Network: A Graph Convolutional Neural Network Approach

  15. Mao YM, Shi SY, Yang H, Zhang YY (2012) Research on method of double-layers BP neural network in bicycle flow prediction. Springer, pp 86–88. https://doi.org/10.1007/978-3-642-01513-7_99

  16. Mohammed MA, Gani MKA, Hamed RI, Mostafa SA, Ahmad MS, Ibrahim DA (2017) Solving vehicle routing problem by using improved genetic algorithm for optimal solution. Journal of Computational Science 21:255–262. https://doi.org/10.1016/j.jocs.2017.04.003

    Article  Google Scholar 

  17. Montemanni R, Gambardella LM, Rizzoli AE, Donati AV (2005) Ant colony system for a dynamic vehicle routing problem. J Comb Optim 10(4):327–343. https://doi.org/10.1007/s10878-005-4922-6

    Article  MathSciNet  MATH  Google Scholar 

  18. O’Mahony E, Shmoys DB (2015) Data analysis and optimization for (citi)bike sharing. AAAI Press, Palo Alto, pp 687–694. https://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/view/9698

    Google Scholar 

  19. Schuijbroek J, Hampshire RC, Hoeve WJV (2017) Inventory rebalancing and vehicle routing in bike sharing systems. EUR J OPER RES 257 (3):992–1004. https://doi.org/10.1016/j.ejor.2016.08.029

    Article  MathSciNet  MATH  Google Scholar 

  20. Sörensen K, Vergeylen N (2015) The bike request scheduling problem. Springer International Publishing, Berlin, pp 294–301

    Google Scholar 

  21. Tian YJ, Xie QH (2016) Dynamic scheduling of public bicycles based on artificial bee colony algorithm. In: Qi E, Shen J, Dou R (eds) Proceedings of the 23rd international conference on industrial engineering and engineering management 2016. Atlantis Press, Paris, pp 245–249. https://doi.org/10.2991/978-94-6239-255-7_44

  22. Tran TD, Ovtracht N, D’Arcier BF (2015) Modeling bike sharing system using built environment factors. Procedia Cirp 30:293–298. https://doi.org/10.1016/j.procir.2015.02.156

    Article  Google Scholar 

  23. Wang KZ, Lan SL, Zhao YX (2017) A genetic-algorithm-based approach to the two-echelon capacitated vehicle routing problem with stochastic demands in logistics service. J Oper Res Soc, pp 1–13. https://doi.org/10.1057/s41274-016-0170-7

  24. Xie XP, Qiu JD, Tang MA, Tamp M (2017) Demand prediction of public bicycle rental station based on Elman neural network. Comput Eng Appl 53(16):221–224. https://doi.org/10.3778/j.issn.1002-8331.1603-0097

    Google Scholar 

  25. Xu HT, Duan F, Pu P (2018) Solving dynamic vehicle routing problem using enhanced genetic algorithm with penalty factors. IJPE 14(4):611–620. https://doi.org/10.23940/ijpe.18.04.p3.611620

    Google Scholar 

  26. Xu HT, Ying J, Wu H, Lin F (2013) Public bicycle traffic flow prediction based on a hybrid model. Appl Math Inf Sci 7(2):667–674. https://doi.org/10.12785/amis/070234

    Article  Google Scholar 

  27. Yang JW, Zhou ZP, Cai YF (2016) Public bicycle dynamic scheduling model based on improved ant colony algorithm. Transactions of Beijing Institute of Technology 36(2):121–124

    Google Scholar 

  28. Yang ZD, Hu J, Shu YC, Cheng P, Chen JM, Moscibroda T (2016) Mobility modeling and prediction in Bike-Sharing system. ACM, pp 165–178. https://doi.org/10.1145/2906388.2906408

  29. Zhang JW, Pan X, Li MY, Yu PS (2016) Bicycle-Sharing System analysis and trip prediction. In: IEEE international conference on mobile data management, pp 174–179. https://doi.org/10.1109/MDM.2016.35

  30. Zeng XY, Yang YX, Chen S, Peng YL (2017) Traffic flow trend forecast of public bicycle network based on ARIMA model. CECE 2017, pp 334–338

Download references

Acknowledgements

This work was financially supported by Chinese National Science Foundation (61572165) and Projects of Zhejiang Province (LGF18F030006).

Author information

Authors and Affiliations

  1. School of Computer Science and Technology, Hangzhou Dianzi University, Hangzhou, China

    Haitao Xu, Feng Duan & Pan Pu

Authors
  1. Haitao Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Feng Duan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Pan Pu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Haitao Xu.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Xu, H., Duan, F. & Pu, P. Dynamic bicycle scheduling problem based on short-term demand prediction. Appl Intell 49, 1968–1981 (2019). https://doi.org/10.1007/s10489-018-1360-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-018-1360-6

Keywords

Search

Navigation