Optimal dispatcher number for one-way carsharing services considering break requirement

Abstract

This study investigates the dispatcher number (DN) of one-way carsharing services (CSSs), considering the critical yet overlooked aspect of dispatchers’ break requirement with vehicle relocation and dispatcher assignments. The DN problem aims to minimize the daily cost of one-way CSS operators by determining the fleet size, the number of dispatchers, vehicle relocation, and dispatcher movement under the restriction on the maximum accumulative working time of dispatchers. The novelty of the study lies in the incorporation of the break requirement consideration of dispatchers into the personnel assignment during the operation period. A nonlinear integer programming (NLIP) model is first developed for the DN problem. By exploring the structure of the proposed model, an effective heuristic solution method consisting of optimization and simulation modules is proposed to obtain the optimal solution to the problem. Numerical experiments based on EVCARD, a popular one-way CSS operator in China, are conducted to demonstrate the effectiveness of the proposed models and solution method and the rationality of incorporating the break requirement into the decision-making process. Furthermore, we investigated the impacts of critical parameters, such as payment for dispatchers and relocation cost, on the performance of the one-way CSS, providing valuable insights for carsharing service operators.