2022/07/29 by Apurv Choudhari, Choudhari, Apurv, Ameya Ekbote +3
Engineering · #Advanced Manufacturing and Logistics Optimization #Computers and Society (cs.CY) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Optimization and Packing Problems #Vehicle Routing Optimization Methods
paper · pdf · doi:10.48550/arxiv.2208.00046
openalex publication_date 2022/07/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.