Skripsi

VEHICLE ROUTING PROBLEM MENGGUNAKAN METODE NEAREST NEIGHBOR HEURISTIC DAN CLARKE & WRIGHT SAVINGS ALGORITHM UNTUK MENGOPTIMALKAN RUTE PENGANGKUTAN SAMPAH DI DESA PULAU SEMAMBU

---

This research examines the optimization of waste collection routes in Pulau Semambu Village using the Vehicle Routing Problem framework with the Nearest Neighbor Heuristic method and the Clarke & Wright Savings Algorithm. The study uses secondary data consisting of Temporary Disposal Site (TDS) and Final Disposal Site (FDS) locations, waste volume, and inter-point distances for three designated Working Areas (WA). The Nearest Neighbor Heuristic determines routes based on the closest unvisited point, while the Clarke & Wright Savings Algorithm constructs solutions by maximizing distance savings through route combinations. The results show that both methods successfully generate feasible and efficient routes; however, the Clarke & Wright Savings Algorithm provides shorter total distances in Working Areas (WA) 1 and Working Areas (WA) 3, with equal performance in Working Areas (WA) 2. These findings indicate that the spatial structure and inter-TDS distance distribution significantly influence the effectiveness of each heuristic. Overall, the Clarke & Wright Savings Algorithm demonstrates better performance and is recommended for optimizing waste collection routes in Pulau Semambu Village.

---

Availability

Detail Information

Series Title

-

Call Number

T1944872026

Publisher

Indralaya : Prodi Ilmu Matematika, Fakultas Matematika Dan Ilmu Pengetahuan Alam Universitas Sriwijaya., 2026

Collation

xv, 165 hlm.; ilus.; tab.; 29 cm.

Language

Indonesia

ISBN/ISSN

-

Classification

628.440 7

Content Type

Text

Media Type

-

Carrier Type

-

Edition

-

Subject(s)

Pengelolaan Sampah
Prodi Ilmu Matematika

Specific Detail Info

-

Statement of Responsibility

TUTI

Other version/related

File Attachment

Comments

---

You must be logged in to post a comment