论文标题
使用常规和近似方法的电容车辆路由问题
Capacitated Vehicle Routing Problem Using Conventional and Approximation Method
论文作者
论文摘要
本文试图通过考虑多个限制因素，包括电容车辆，单个仓库以及使用两种方法，即首先和第二个算法并使用整数线性编程来解决著名的车辆路线问题。提供了一组节点作为系统输入，并以输出为输出生成可行的路由，从而提供了节点簇和群集中的路线。为了聚类节点，我们采用了DBSCAN算法，并且使用近似算法（Christofide的算法）进行路由。生成的解决方案可用于解决现实生活中的情况，例如由各种需求节点组成的交付系统。
This paper attempts to solve the famous Vehicle Routing Problem by considering multiple constraints including capacitated vehicles, single depot, and distance using two approaches namely, cluster first and route the second algorithm and using integer linear programming. A set of nodes are provided as input to the system and a feasible route is generated as output, giving clusters of nodes and the route to be traveled within the cluster. For clustering the nodes, we have adopted the DBSCAN algorithm, and the routing is done using the approximation algorithm, Christofide's algorithm. The solution generated can be employed for solving real-life situations, like delivery systems consisting of various demand nodes.
