The presence of enough bicycles and free docking points to satisfy user demands in stations is a known operational issue in bicycle-sharing schemes. Empty and full stations in such systems are equally undesirable and disruptive for the operation of the network, since the former turn away potential users while the latter could not be used to terminate bicycle journeys. Repositioning practices have been used in the past to address this situation with partial success. This paper introduces a new planning approach for such activities, addressing both routing and assignment aspects of bicycle repositioning using a fleet of carrier vehicles. A case study on bicycle usage patterns from a large bicycle-sharing scheme is carried out; examples are also provided that demonstrate the behaviour of the algorithm. Implementation concerns and means to improve computational performance are also discussed.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A strategic repositioning algorithm for bicycle-sharing schemes


    Contributors:

    Published in:

    Publication date :

    2014-09-14


    Size :

    16 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English





    A time-space network flow approach to dynamic repositioning in bicycle sharing systems

    Zhang, Dong / Yu, Chuhang / Desai, Jitamitra et al. | Elsevier | 2016



    Idle Vehicle Repositioning for Dynamic Ride-Sharing

    Pouls, Martin / Meyer, Anne / Ahuja, Nitin | British Library Conference Proceedings | 2020