Constructive and Clustering Methods to Solve Capacitated Vehicle Routing Problem

M. A. H. Akhand, Tanzima Sultatana, M. I. R. Shuvo, Al-Mahmud Al-Mahmud
2017 Oriental journal of computer science and technology  
Vehicle Routing Problem (VRP) is a real life constraint satisfaction problem to find minimal travel distances of vehicles to serve customers. Capacitated VRP (CVRP) is the simplest form of VRP considering vehicle capacity constraint. Constructive and clustering are the two popular approaches to solve CVRP. A constructive approach creates routes and attempts to minimize the cost at the same time. Clarke and Wright's Savings algorithm is a popular constructive method based on savings heuristic.
more » ... avings heuristic. On the other hand, a clustering based method first assigns nodes into vehicle wise cluster and then generates route for each vehicle. Sweep algorithm and its variants and Fisher and Jaikumar algorithm are popular among clustering methods. Route generation is a traveling salesman problem (TSP) and any TSP optimization method is useful for this purpose.
doi:10.13005/ojcst/10.03.02 fatcat:nmmvcfbryndgfkcp2ousgf5zcm