Highlights Apply the Random Forest model to predict the customer demand in bike-sharing system. Propose a hub-first-route-second bike repositioning strategy based on the predicted demand. Develop a solution method incorporating the heuristic algorithm (ABC) and the exact method.

    Abstract This paper addresses a static bike repositioning problem by embedding a short-term demand forecasting process, the Random Forest (RF) model, to account for the demand dynamics in the daytime. To tackle the heterogeneous repositioning fleets, a novel repositioning operation strategy constructed on the hub-and-spoke network framework is proposed. The repositioning optimization model is formulated using mixed-integer programming. An artificial bee colony algorithm, integrated with a commercial solver, is applied to address computational complexity. Experimental results show that the RF can achieve a high forecasting accuracy, and the proposed repositioning strategy can efficiently decrease the users’ dissatisfaction.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    A static bike repositioning model in a hub-and-spoke network framework


    Beteiligte:
    Huang, Di (Autor:in) / Chen, Xinyuan (Autor:in) / Liu, Zhiyuan (Autor:in) / Lyu, Cheng (Autor:in) / Wang, Shuaian (Autor:in) / Chen, Xuewu (Autor:in)


    Erscheinungsdatum :

    2020-07-05




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch





    Chemical reaction optimization for solving a static bike repositioning problem

    Szeto, W.Y. / Liu, Ying / Ho, Sin C. | Elsevier | 2016


    A Bilevel Programming Model and Algorithm for the Static Bike Repositioning Problem

    Qiong Tang / Zhuo Fu / Meng Qiu | DOAJ | 2019

    Freier Zugriff


    A multiple type bike repositioning problem

    Li, Yanfeng / Szeto, W.Y. / Long, Jiancheng et al. | Elsevier | 2016