Optimal queueing-based rebalancing for one-way electric carsharing systems with stochastic demand

Abstract

Viability of electric vehicle car sharing operations depends on rebalancing algorithms. Earlier methods in the literature suggest a trend toward Markovian stochastic demand with server relocation with queueing constraints. We propose a new model formulation based on a node-charge graph structure that extends the relocation model to include transshipment relocation flows. Computational tests with up to 1000 node (and 4000 node-charges) suggest promising avenues for further study.

arXiv commentarXiv admin note: substantial text overlap with arXiv:2001.07282

Cited by in corpus (5)

• Optimal fast charging station locations for electric ridesharing service with online vehicle-charging station assignment
• A Real-Time Dispatching Strategy for Shared Automated Electric Vehicles with Performance Guarantees
• A node-charge graph-based online carshare rebalancing policy with capacitated electric charging
• Survey of charging scheduling, fleet management, and location planning of charging stations for electrified demand-responsive transport systems: methodologies and recent developments
• Two-stage battery recharge scheduling and vehicle-charger assignment policy for dynamic electric dial-a-ride services