Electric Vehicle Routing Problem with Multiple Resource Constraints

This paper addresses the Electric Vehicle Routing Problem (EVRP) with multi-resource constraints. We propose a novel mathematical model incorporating multiple resource constraints into the EVRP. While the flexibility of this model is advantageous, it is important to acknowledge that the computational complexity of solving EVRP increases with problem size, as the problem is known to be NP-hard. To tackle this challenge, we propose a two-stage iterative algorithm. The algorithm transforms the original mixed non-linear integer programming problem into two tractable linear programming (LP) subproblems. The first stage focuses on optimizing vehicle routing, and the second stage tackles the resource scheduling problem, ensuring all resource limitations are met. Besides, an iterative optimization process is proposed to improve the performance of the results further. Through numerical experiments, we verify the effectiveness of the proposed algorithm.