Firefly Algorithm for Multi-type Vehicle Routing Problem

Abstract

Abstract The problem of distribution is a problem that cannot be separated from the industrial world. These problems are because these problems have a considerable influence on the cost and level of service to consumers. Therefore we need a way so that the distribution process can run smoothly and on time. One way that can be done in the distribution process is to optimize vehicle routes so that the time spent serving two consumers is more efficient and the goods can get to consumers on time. The problem of optimizing vehicle routes is known as vehicle routing problem (VRP). VRP which aims to form an optimal route to serve consumers with capacity constraints and Type of Vehicle is called Multi-type vehicle routing problem (MTVRP). In solving the MTVRP problem, two methods will be combined namely the exact method and the heuristic method. The firefly algorithm has been widely used in solving VRP problems. The results are obtained total distance of 2488 km.