Solving the Capacitated Vehicle Routing Problem (CVRP) with Guided Local Search and Simulated Annealing for Optimizing the Distribution of Fishing Vessels

Abstract

This paper discusses the completion of the distribution route of fishing vessels in twenty-six Fish Landing Bases (FLB) to the National Fisheries Port (NFP), this research includes the Capacitated Vehicle Routing Problem (CVRP) model with several constraints, namely, distance, number of ships, ship capacity, fish catches, travel time and ship operating costs, thus requiring optimization of the route of fishing vessels to each FLB. The method used to solve the problem is Guided Local Search (GLS) and Simulated Annealing (SA) using Google OR-Tools which are proven to be efficient in solving heuristic problems. The results showed that the application of the GLS and SA methods showed different results, for the simulation of two and three fishing vessels the same distance optimization results were obtained, namely 290 miles and 355 miles, but for four fishing vessels the GLS method resulted in 464 miles while the SA method yields 439 miles, meaning that the more fishing vessels, the SA method has a better performance than the GLS method, for a case study of the distribution of fishing vessels in Maluku, the SA method is capable of 6% efficiency in distance while being able to save time and ship operational costs. The results of this study contribute to saving the company's operational costs and improving the quality of fish exports abroad.