Bike Sharing Systems (BSSs), serving the cycling trips, have become an important alternative for addressing the last mile problem in city Intelligent Transportation Systems (ITSs). However, it is difficult to achieve a desired quality of service due to the unbalanced distribution of station inventory, which is caused by dynamic usage patterns. Different from conventional redistribution strategies performed by trucks or trailers, we propose a Prediction-Based Task Assignment (PBTA) scheme to outsource the rebalancing tasks to crowds so as to decrease the maintenance and labor cost. The Long Short-Term Memory (LSTM) is first utilized to predict the future fill-levels of the bike stations. Then, the rebalancing problem is reformulated as a maximum weighted bipartite matching problem, which is solved by the Hungarian method in polynomial time. Extensive simulations with real-world bike-sharing datasets are conducted to show the effectiveness of the proposed scheme.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Efficient Task Assignment for Crowd-Powered Rebalancing in Bike Sharing Systems


    Contributors:
    Xu, Yifan (author) / Wang, Guanghui (author) / Tao, Jun (author) / Pan, Jianping (author)


    Publication date :

    2019-10-01


    Size :

    511379 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    The rebalancing of bike-sharing system under flow-type task window

    Tian, Zihao / Zhou, Jing / Szeto, W.Y. et al. | Elsevier | 2020


    Study on Bike Sharing Rebalancing: Evidence from Kunming

    Yin, Anteng / Ning, Bojin / Wang, Yeqin | TIBKAT | 2021


    Bike-sharing rebalancing problem by considering availability and accessibility

    Wang, Xu / Sun, Huijun / Zhang, Si et al. | Taylor & Francis Verlag | 2023


    Dynamic battery swapping and rebalancing strategies for e-bike sharing systems

    Zhou, Yaoming / Lin, Zeyu / Guan, Rui et al. | Elsevier | 2023