OPTIMIZING SPLIT-DELIVERY FRESH FRUIT BUNCH ROUTES USING A SAVING MATRIX-SIMULATED ANNEALING HYBRID APPROACH

Khairunnisa Ani Putri; Ismail Husein

doi:10.53806/jmscowa.v7i1.1476

Authors

Khairunnisa Ani Putri Department of Mathematics, Universitas Islam Negeri Sumatera Utara, Medan, Indonesia
Ismail Husein Department of Mathematics, Universitas Islam Negeri Sumatera Utara, Medan, Indonesia

DOI:

https://doi.org/10.53806/jmscowa.v7i1.1476

Keywords:

Optimization; Route; Saving Matrix; SDMDCVRP; Simulated Annealing

Abstract

This study aims to minimize the total distribution distance of remaining Fresh Fruit Bunches (FFB) cargo at PTPN IV Regional II through the Split Delivery Multi-Depot Capacitated Vehicle Routing Problem (SDMDCVRP) approach. The proposed method combines the Saving Matrix (SM) to form the initial route and Simulated Annealing (SA) to optimize the route arrangement by considering split delivery, multidepot, vehicle capacity, demand fulfillment, and consolidation of remaining cargo. The existing route has a total distance of 2,014.98 km with a transportation cost of IDR 1,370,186.40. The SM method reduces the distance to 1,739.53 km, while SM-SA produces the best distance of 1,536.22 km with a cost of IDR 1,044,629.60. These results indicate a distance efficiency of 23.76% compared to the existing route. Benchmarks against SM-Tabu Search show that SM-SA has better solution quality, stability, and computation time. This approach supports SDG 9, SDG 12, and SDG 13.