USULAN RANCANGAN RUTE DISTRIBUSI GAS LPG 3 KG MENGGUNAKAN METODE HEURISTIK DAN METODE BRANCH AND BOUND DI PT X

Sari

Makalah ini membahas pemecahan permasalah Vehicle Routing Problem dan permasalahan Traveling Salesman Problem yang berkaitan dengan pembentukan rute optimal. Metode yang digunakan dalam memecahkan permasalahan tersebut adalah metode Clarke & Wright dan Nearest Neighbor untuk tahap pencarian solusi awal. Untuk mendapatkan solusi yang optimal dari solusi awal, maka digunakan metode Branch and Bound sebagai metode perbaikan. Perhitungan metode Clarke & Wright dilihat berdasarkan nilai penghematan jarak yang terbesar, sedangkan metode Nearest Neighbor berdasarkan tetangga terdekatnya. Metode Branch & Bound dapat diselesaikan menggunakan software WinQSB.

 

Kata kunci: Vehicle Routing Problem, Traveling Salesman Problem, Clarke & Wright, Nearest Neighbor, Branch and Bound

 

ABSTRACT

This paper discusses the Vehicle Routing Problem solving problems and problems of the Traveling Salesman Problem related to the formation of the optimal route. The method used in solving these problems is the method of Clarke & Wright and Nearest Neighbor for the early stages of the search for solutions. To obtain the optimal solution of the initial solution, then the Branch and Bound method is used as a method of repair. Calculation method of Clarke & Wright visits based on the value of saving the greatest distance, while the Nearest Neighbor method based on nearest neighbors. Branch & Bound method can be completed using the software WinQSB.

Keywords: Vehicle Routing Problem, Traveling Salesman Problem, Clarke & Wright, Nearest Neighbor, Branch and Bound