Highlights We incorporate logit price-dependent demand function into the user-based SBRP. We develop an outer approximation method to obtain the global ε -optimal solution. The performance of the developed outer-approximation method is demonstrated. We reveal the effects of parameters toward the relocation strategies. We develop an efficient bi-level VNS algorithm for large instances.

    Abstract A static bike rebalancing problem with optimal user incentives is investigated. The problem is formulated as a mixed-integer nonlinear and nonconvex programming model to minimize the total cost, including the travel costs, unbalanced penalties, and incentive costs. We reformulate the mixed-integer program and develop a new outer-approximation method to obtain its global ε -optimal solutions. We also propose a bi-level variable neighborhood search algorithm to solve large problems. The results tested on small examples reveal problem properties and the performance of the outer-approximation method. The results tested on large examples show that the bi-level algorithm can provide high-quality solutions with short computational times.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    The static bike rebalancing problem with optimal user incentives


    Beteiligte:
    Li, Yanfeng (Autor:in) / Liu, Yang (Autor:in)


    Erscheinungsdatum :

    2020-12-22




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    Bike-sharing rebalancing problem by considering availability and accessibility

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





    Bike-share rebalancing strategies, patterns, and purpose

    Médard de Chardon, Cyrille | Online Contents | 2016