Skripsi

OPTIMASI VEHICLE ROUTING PROBLEM WITH TIME WINDOWS (VRPTW) MENGGUNAKAN METODE VARIABLE NEIGHBORHOOD SEARCH (VNS)

---

Penilaian

---

The distribution of goods in the logistics sector faces challenges in optimizing distance, time, and delivery route efficiency. The Vehicle Routing Problem (VRP), including its variant VRPTW, which considers time constraints, is an effective approach to address these challenges. This study applies the Variable Neighborhood Search (VNS) algorithm as a heuristic method to solve the VRPTW. VNS leverages diverse solution exploration and local search to enhance solution quality. Using the Gehring-Homberger dataset, the method achieved a 15.16% improvement in distance efficiency, with a slight time decrease of 0.37%. The results demonstrate that the VNS algorithm can produce near-optimal solutions, with efficiency influenced by initial solutions and iterations. This study contributes to logistics optimization and opens opportunities for further development, such as integrating other methods or applying the approach to larger, more complex datasets

---

Availability

Inventory Code	Barcode	Call Number	Location	Status
2507000071	T164110	T1641102024	Central Library (Reference)	Available but not for loan - Not for Loan

Detail Information

Series Title

-

Call Number

T1641102024

Publisher

Indralaya : Prodi Teknik Informatika, Fakultas Ilmu Komputer., 2024

Collation

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

Language

Indonesia

ISBN/ISSN

-

Classification

005.430 7

Content Type

Text

Media Type

-

Carrier Type

-

Edition

-

Subject(s)

Sistem Operasi
Prodi Teknik Informatika, Fakultas Ilmu Komputer

Specific Detail Info

-

Statement of Responsibility

MI

Other version/related

File Attachment

Comments

---

You must be logged in to post a comment