用递归K均值和Dijkstra算法求解CVRP
Using Recursive KMeans and Dijkstra Algorithm to Solve CVRP
摘要：
容量限制车辆路径问题（CapacitantVehicleRoutingProblem，CVRP）是目前最常见的优化问题之一，其路由算法广泛应用于运输、食品配送、网络路由等领域。有容量限制的车辆路径问题属于NP-Hard问题，一般的优化算法无法解决，本文讨论了一种新的解决该问题的方法，采用了最著名的聚类算法“K-Means”和最短路径算法之一“Dijkstra”的递归方法，并通过一些数学运算。在本文中，我们将展示如何实现这些方法一起，以获得最佳路线的最近的解决方案，由于研究和开发仍在进行中，这篇研究论文可能会扩展到另一个，这将涉及这方面的实施结果。
英文摘要：
Capacitated vehicle routing problem (CVRP) is being one of the most common optimization problems in our days, considering the wide usage of routing algorithms in multiple fields such as transportation domain, food delivery, network routing, ... Capacitated vehicle routing problem is classified as an NP-Hard problem, hence normal optimization algorithm can't solve it. In our paper, we discuss a new way to solve the mentioned problem, using a recursive approach of the most known clustering algorithm "K-Means", one of the known shortest path algorithm "Dijkstra", and some mathematical operations. In this paper, we will show how to implement those methods together in order to get the nearest solution of the optimal route, since research and development are still on go, this research paper may be extended with another one, that will involve the implementational results of this thoric side.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
