Bella Septiandari Putri, Sapti Wahyuningsih, Mohamad Yasin, Asmianto Asmianto, Desi Rahmadani, Denis Eka Cahyani
Open Vehicle Routing Problem with Time Windows (OVRPTW) is a VRP problem where the vehicle is not required to return to the depot after the last customer pays attention to time and vehicle capacity constraints. In this article, the Adaptive Large Neighborhood Search - Tabu Search (ALNS-TS) algorithm is used to solve the OVRPTW problem and implemented in the Borland Delphi 7.0 programming language. The program design method used in this research is the Waterfall method. This algorithm has four completion stages, namely, initial solution formation, removal stage, reinsertion stage, and solution improvement stage. The data inputted in the program are points, distance, time windows, capacity, speed, and parameters. Next, the ALNS-TS algorithm calculation process is carried out, and the output is produced in the form of distribution routes, total distance traveled, and graph visualization. Parameter test results with the dataset show that determining the correct parameter values p and Maxlt(TS) will produce the optimal route. The ALNS - TS algorithm provides a solution close to the Known Solution (BKS) dataset results. The results of the ALNS-TS algorithm program design in OVRPTW can be implemented in distribution optimization. © 2024 American Institute of Physics Inc.. All rights reserved.
Department of Mathematics, Faculty of Mathematics and Natural Science, Universitas Negeri Malang, Jl. Semarang 5, Malang, Indonesia
