InterSiteVehicle Artificial Scheduling Strategy Design for Electric Vehicle Sharing

Abstract:

The intersitevehicle imbalance is a major puzzle which has seriously hindered the development of electric vehiclesharing. A set of reasonable vehicle scheduling scheme can solve this puzzle. Firstly, the minimum cost of scheduling demands model based on satisfying all the consumers’ demands was constructed with the genetic algorithm to solve the model. Secondly, after obtaining scheduling demands, a mixed integer programming model was proposed to optimize the dispatchers’ routes, and the branch and bound algorithm was used to solve the model. Finally, taking orders data of five specified sites as input for a case calculation. The calculation results indicate that in the situation of increased demand, if artificial scheduling strategy is adopted, the ability to accept orders can be increased by 60%. In addition, it can save 60% of the cost input comparing with increasing the number of parking spaces and vehicles.

Key words:electric vehiclesharing; vehicle scheduling; scheduling demands model; genetic algorithm; scheduling paths optimization model