Skripsi

OPTIMASI VEHICLE ROUTING PROBLEM WITH TIME WINDOWS (VRPTW) DENGAN MENGGUNAKAN HYBRID ANT COLONY OPTIMIZATION (ACO) PADA RUTE DISTRIBUSI PRODUK MAKANAN

---

Penilaian

---

The problem of vehicle scheduling and route optimization in food product distribution is a complex logistical challenge, especially when considering customer time window constraints and vehicle capacity. This study aims to implement a combination of Ant Colony Optimization (ACO) and Nearest Neighbor (NN) to solve the Vehicle Routing Problem with Time Windows (VRPTW) in the distribution system of HoneyBee Bakery & Cake. The Nearest Neighbor (NN) method is used to generate the initial solution, while Ant Colony Optimization (ACO) is applied to further optimize the route. The experimental results show that the Hybrid Ant Colony Optimization approach produces an initial solution with a travel distance of 72.55 km, which is then optimized to a final distance of 58.59 km with four returns to the depot. Therefore, the Hybrid ACO is proven to be more effective in optimizing distribution routes that consider both time constraints and vehicle capacity, achieving an efficiency improvement of 19.22% in reducing the total travel distance from the initial solution.

---

Availability

Inventory Code	Barcode	Call Number	Location	Status
2507003713	T176801	T1768012025	Central Library (Reference)	Available but not for loan - Not for Loan

Detail Information

Series Title

-

Call Number

T1768012025

Publisher

Indralaya : Prodi Teknik Informatika, Fakultas Ilmu Komputer Universitas Sriwijaya., 2025

Collation

xiii, 99 hlm.; ilus.; tab.; 29 cm.

Language

Indonesia

ISBN/ISSN

-

Classification

004.07

Content Type

Text

Media Type

-

Carrier Type

-

Edition

-

Subject(s)

Teknik Informatika

Specific Detail Info

-

Statement of Responsibility

MI

Other version/related

File Attachment

Comments

---

You must be logged in to post a comment