Electric Vehicle Routing Problems with Stochastic Demands and Dynamic Remedial Measures

Abstract EN

With the rapid development of e-commerce, logistic enterprises must better predict customer demand to improve distribution efficiency, so as to deliver goods in advance, which makes logistics stochastic and dynamic.

In order to deal with this challenge and respond to the concept of “green logistics,” an electric vehicle routing problem with stochastic demands (EVRPSD) and proactive remedial measures is investigated, and an EVRPSD model with probability constraints is established.

At the same time, a hybrid heuristic algorithm, combining a saving method and an improved Tabu search algorithm, is proposed to solve the model.

Moreover, two insertion strategies with the greedy algorithm for charging stations and dynamic nodes are introduced.

Finally, a large number of experimental data show that the heuristic algorithm proposed in this paper is feasible and effective.