Penyelesaian Vehicle Routing Problem with Simultaneous Pickup and Delivery Service Menggunakan Algoritme Tabu Search

Abstract

Vehicle Routing Problems with Simultaneous Pick-up and Delivery (VRPSPD) are the variation of Vehicle Routing Problems (VRP). VRPSPD is a problem to determine the route of vehicle to pick-up and delivery the product at the same time. The goal of VRPSPD is either to minimize the mileage or the cost of shipping the product. In this paper, the VRPSPD problem will be solved by using a heuristic method, namely Tabu search algorithm. Tabu search algorithm is a mathematical optimization method that guides the search for solutions iteratively by providing taboo status to the existing solution. It uses two memory structures that have different functions. It consists several stages that underlie each step in the algorithm, namely the determination of the initial solution, the search of the neighborhood solution, the use of the memory structures, and the termination of the algorithm. The application of VRPSPD is ilustrated in establishing the minimum distance route of drinking water product delivery.