Electric vehicle routing problem:Adjustable robust mathematical model and its algorithm
An electric vehicle routing problem with uncertain travel times and time windows which allows partial recharges is investigated.An adjustable robust optimization model is constructed to formulate the prob-lem using the polyhedron uncertainty set as the measurement for the uncertainty of travel time.An algorithm based on both row generation and set partitioning is designed to solve the problem.The algorithm checks the feasibilities of routes using the labeling method.The infeasible routes are added to the model as new con-straints.Results from numerical experiments indicate that the optimal solutions for 94％of the instances can be obtained,which confirms the efficiency of the algorithm.The polyhedron uncertainty set measurement has a positive effect on both the total driving distance and the total number of vehicles involved.Compared to the common robust optimization method,the results of the adjustable robust optimization show significant improvements,improveing the flexibility of vehicle scheduling.
electric vehicle routing problemadjustable robust optimizationuncertain travel timerow gener-ationset partitioning
NETL
NSTL
万方数据
