scholarly journals Optimasi Rute Distribusi Menggunakan Metode Tabu Search Perusahaan Daerah Air Minum (PDAM) Tirta Bangun Kulon Progo

2021 ◽  
Vol 1 ◽  
pp. 56-60
Author(s):  
Siti Dinar Rezki Ramadhani ◽  
Hafizhta Aryunda Tanggono ◽  
Rif’an Yusuf
Keyword(s):  
Drinking Water ◽  
Tabu Search ◽  
Vehicle Routing Problem ◽  
Routing Problem ◽  
Transportation Management ◽  
Distribution Management ◽  
Standard Distribution ◽  
Distribution Process ◽  
Product Delivery ◽  
Better Than

Logistics management is known as distribution and transportation management, while others call it physical distribution management. Distribution activities are very important for companies to deliver a product to consumers across various regions. The Regional Drinking Water Company (PDAM) Tirta Binangun Kulon Progo is one of the companies that produce Bottled Drinking Water (AMDK) under the product name AirKu. The high demand for AMDK AirKu products in 240 ml cup packaging was causing limited vehicles and the absence of a clear standard distribution route, which caused the distribution process to be carried out randomly. Therefore, to overcome the company's problems, it is possible to determine the Vehicle Routing Problem (VRP) route with the CVRP approach, where the route determination is based on fleet capacity. The method used was tabu search using the MATLAB application to minimize the bottled product delivery route traveled. The results obtained were the total distance traveled by 284.9 km. The proposed route had a distance savings of 118.26 km, which is better than the company route.

scholarly journals The Linehaul-Feeder Vehicle Routing Problem with Virtual Depots and Time Windows

2011 ◽  
Vol 2011 ◽  
pp. 1-15 ◽  
Author(s):  
Huey-Kuo Chen ◽  
Huey-Wen Chou ◽  
Chia-Yuan Hsu
Keyword(s):  
Tabu Search ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Time Constraints ◽  
Test Results ◽  
Two Stage ◽  
Routing Problem ◽  
Objective Value ◽  
Better Than

This paper addresses the linehaul-feeder vehicle routing problem with virtual depots and time windows (LFVRPTW). Small and large vehicles deliver services to customers within time constraints; small vehiclesen routemay reload commodities from either the physical depot or from the larger vehicle at a virtual depot before continuing onward. A two-stage solution heuristic involving Tabu search is proposed to solve this problem. The test results show that the LFVRPTW performs better than the vehicle routing problem with time windows in terms of both objective value and the number of small vehicles dispatched.

Sign in / Sign up

Export Citation Format

Share Document