Distribution Route Optimization of a Capacitated Vehicle Routing Problem by Sweep Algorithm

Abstract

This paper presents the application of a sweep algorithm to optimize distribution route of a Capacitated Vehicle Routing Problem (CVRP). The objective of this research is to find a set of optimal routes that minimizes the number of vehicles required and total distance travelled for all vehicles to serve customers. The algorithm consists of two phases, a clustering phase and a route generation phase. Experimental results from its application to a real-world case of PT Eastern Pearl Flour Mills, Indonesia are presented. The obtained vehicle routes which are compared against the existing daily distribution routes showing that significant savings can be gained on the daily cost of transportation related expenses. The number of vehicle routes and vehicle used for delivery are reduced and therefore, the distance travelled and the utilization of the vehicles are also improved. The algorithm applied in this research would be suitable for solving practical vehicle routing optimization problems in other logistics companies.