Optimizing electric vehicle routing problems with mixed backhauls and recharging strategies in multi-dimensional representation network

摘要

Electric vehicles are environmental transportation modes that are widely applied in green logistics systems. To guarantee the energy efficiency, the impacts of customer service modes and recharging strategies need to be integrated into the optimization of electric logistics resource. This paper proposes an electric vehicle routing problem with mixed backhauls, time windows, and recharging strategies (EVRPMBTW-RS), minimizing the total travel cost with sophisticated constraints on the time-dependent pickup and delivery requests, limited recharging station capacity, and battery remaining capacity of electric vehicles. Mixed service sequences of linehaul and backhaul customers is allocated for the routing planning, with the synchronous optimization of recharging strategies including the selection of recharging stations and determination of recharging time. A time-discretized multi-commodity network flow model is constructed based on an extended space?time-state modeling framework, which is formulated as a quadratic 0?1 programming model by using the augmented Lagrangian relaxation technique. After the dualization and linearized transformation, we decompose the model into a sequence of leastcost path subproblems based on the alternating direction multiplier method (ADMM). The subproblems are alternately minimized and solved using the time-dependent forward dynamic programming algorithm. The solution quality can be guaranteed through calculating the optimality gap between the best lower bound and upper bound for each iteration. The proposed solution approach is examined on examples of a simple 7-node network and real-world Yizhuang road network. This paper provides a theoretical foundation for the route optimization method of electric logistics vehicles, and contributes to improve the operational efficiency of electric logistics systems.