Answers are grounded in this paper and cite their sources.
This study considers a stochastic inventory relocation problem for a one-way, station-based car-sharing system that utilises electric vehicles (EV), where customers' rental demands and rented vehicles' travel distances are uncertain and temporal-spatial imbalance. Workers are hired to relocate vehicles between stations. To maximise the total expected profits that can be collected by the system, a worker must determine whether to relocate an EV, which vehicle to choose, and which station to move the EV to upon their arrival at a rental station. The problem is formulated as a Markov decision process (MDP). A reinforcement learning algorithm is proposed to develop dynamic policies for the problem. The reinforcement learning algorithm uses an approximate value iteration (AVI) algorithm to overcome the computational challenges arising from the extensive state and action space. Action-space restriction and state-space aggregation schemes are developed to enhance the performance of the AVI algorithm. The effectiveness of the proposed modelling and solution methodologies is demonstrated through a comparison of the dynamic policies against benchmark solutions. Additionally, sensitivity analyses are conducted to investigate whether parameter configurations will impact the performance of the dynamic policies.
No takes yet. Share an insight, caveat, or question.
Liu et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: