The Mobile Charging Vehicle Routing Problem with Time Windows and Recharging Services

Abstract EN

For the environmental friendliness of the technology on battery electric vehicles, there is growing attention on it.

However, the market share of battery electric vehicles remains low due to the range anxiety.

As a remedy, the mobile charging services could offer charging service at any time or locations requested.

For profitability of the services, the operator should route the charging vehicles in a more efficient manner.

For this consideration, we formulate the mobile charging vehicle routing problem as a mixed integer linear program based on the classical vehicle routing problem with time windows.

To demonstrate the model, test instances are designed and computational results are presented.

In order to examine the change of the number of mobile charging vehicles and travel distance, sensitivity analyses, such as battery capacity and recharging rate, are performed.

The results show that larger battery capacity, quicker charging rate, or higher service efficiency could decrease the number of mobile charging vehicles and total traveled distances, respectively.