Clustering Heuristics for Robust Energy Capacitated Vehicle Routing Problem (ECVRP)
arxiv(2024)
摘要
The paper presents an approach to solving the Robust Energy Capacitated
Vehicle Routing Problem (RECVRP), focusing on electric vehicles and their
limited battery capacity. A finite number of customers, each with their own
demand, have to be serviced by an electric vehicle fleet while ensuring that
none of the vehicles run out of energy. The time and energy it takes to travel
between any two points is modeled as a random variable with known distribution.
We propose a Mixed Integer Program (MIP) for computing an exact solution and
introduce clustering heuristics to enhance the solution speed. This enables
efficient re-planning of routes in dynamic scenarios. The methodology
transforms the RECVRP into smaller problems, yielding good quality solutions
quickly compared to existing methods. We demonstrate the effectiveness of this
approach using a well-known benchmark problem set as well as a set of randomly
generated problems.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要