This paper investigates the rebalancing and charging scheduling problem of one-way car-sharing systems. Vehicles can be charged either at the stations within the system or at the public charging stations. A framework for selective multi-grade charging scheduling and fleet rebalancing is proposed. To this end, vehicles and customers are classified into different grades for scheduling and matching, according to their state of charge and travel distance, respectively. The number of grades is involved as a decision variable in the combinatorial optimization problem, with the objective of minimizing the maximum response time and the operating cost for both rebalancing and charging. A lower bound optimal solution of the problem is given analytically based on the Lagrangian analysis and the Karush-Kuhn-Tucker (KKT) condition, yielding a joint optimization algorithm that can ensure the quality of service and balanced demand-supply in the system. Simulation results show that the method is effective in reducing system response time, improving vehicle utilization and reducing reliance on vehicle charging.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Selective Multi-Grade Charging Scheduling and Rebalancing for One-Way Car-Sharing Systems


    Beteiligte:
    Guo, Ge (Autor:in) / Sun, Tianyu (Autor:in)


    Erscheinungsdatum :

    01.04.2023


    Format / Umfang :

    3413517 byte




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch






    Rebalancing Bike Sharing Systems under Uncertainty using Quantum Bayesian Networks

    Harikrishnakumar, Ramkumar / Borujeni, Sima E. / Ahmad, Syed Farhan et al. | IEEE | 2021


    Research on the Static Rebalancing Problem in Bicycle Sharing Systems

    Qiao, Rui / Hu, Dawei / Xie, Chao et al. | ASCE | 2016