Penerapan Metode Saving Matrix, Nearest Neighbor dan Local Search dalam Menentukan Rute Distribusi Es Balok 25 Kg di PT. X

Abstrak

PT X is a company engaged in the production of ice in the form of blocks and tubes (crystal). The problem that arises in the company is that it does not have a calculated and planned delivery route. The problem in this company is included in one category of Vehicle Routing Problem (VRP) problems, namely the Multi Trips Vehicle Routing Problem (MTVRP). This study aims to form a new route in the distribution of 25kg ice blocks at PT X with the shortest distance. The problem solving in this study will use the Saving Matrix, Nearest Neighbor, Local Search (1-0) Insertion Intra Route, and Local Search (1-1) Swap Intra Route methods. The Local Search (1-0) Insertion Intra Route method produces the greatest distance savings, which is 44,59% of the company's actual route.
Keywords: Vehicle Routing, Multi Trips Saving Matrix, Nearest Neighbor, Local Search

ABSTRAK
PT. X merupakan Perusahaan yang bergerak di bidang produksi es dalam bentuk balok dan tube (crystal). Permasalahan yang timbul pada perusahaan yaitu belum memiliki rute pengiriman terhitung dan terencana. Permasalahan pada Perusahaan ini termasuk kedalam salah satu kategori permasalahan Vehicle Routing Problem (VRP), yaitu Multi Trips Vehicle Routing Problem (MTVRP). Penelitian ini bertujuan untuk membentuk rute baru dalam pendistribusian es balok 25kg pada PT. X dengan jarak terpendek. Penyelesaian permasalahan pada penelitian ini akan menggunakan metode Saving Matrix, Nearest Neighbor, Local Search (1-0) Insertion Intra Route, dan Local Search (1-1) Swap Intra Route. Metode Local Search (1-0) Insertion Intra Route menghasilkan penghematan jarak terbesar, yaitu 44,59% dari rute aktual perusahaan. Kata kunci: Vehicle Routing, Multi Trips, Saving Matrix, Nearest Neighbor, Local search