CD Skripsi

Menyelesaikan Masalah Pengangkutan Sampah Dengan Vehicle Routing Problem With Time Windows

---

One of the problems in the field of optimization is the determination of vehicle routes. Determining the shortest route is very important because waste pickup must be done in a short and timely manner by maximizing the use of trans- portation equipment to reduce transportation costs. Therefore, it is important to design the route and pickup of waste. This research focuses on the design of the Vehicle Routing Problem with Time Windows (VRPTW), which is the search for a garbage pickup route with a minimum distance that still meets the demands of all customers and considers vehicle capacity constraints and custo- mer pickup times. The search for a solution to this problem uses the Saving Matrix method to determine the distance matrix, determine the savings ma- trix, allocate vehicles and routes, and sort customers on a route. The results of this study show that the Saving Matrix Method can solve the Vehicle Routing Problem with Time Windows (VRPTW) problem. The Saving Matrix method results in route savings from 10 routes to 3 routes with a predetermined time window.
Keywords: Vehicle routing problem, saving matrix, determination of route, optimization

---

Ketersediaan

Informasi Detail

Judul Seri

-

No. Panggil

1703195283

Penerbit

Pekanbaru : Universitas Riau – FMIPA – Matematika., 2024

Deskripsi Fisik

-

Bahasa

Indonesia

ISBN/ISSN

-

Klasifikasi

1703195283

Tipe Isi

-

Tipe Media

-

Tipe Pembawa

-

Edisi

-

Subjek

MATEMATIKA

Info Detail Spesifik

-

Pernyataan Tanggungjawab

Mutia

Versi lain/terkait

Lampiran Berkas

Komentar

---

Anda harus masuk sebelum memberikan komentar