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

SIREGAR, BONANDA and Yunita, Yunita (2025) OPTIMASI VEHICLE ROUTING PROBLEM WITH TIME WINDOWS (VRPTW) DENGAN MENGGUNAKAN HYBRID ANT COLONY OPTIMIZATION (ACO) PADA RUTE DISTRIBUSI PRODUK MAKANAN. Undergraduate thesis, Sriwijaya University.

Preview	Image RAMA_55201_09021382126135_Cover.jpeg - Cover Image Available under License Creative Commons Public Domain Dedication. Download (2MB) | Preview
	Text RAMA_55201_09021382126135.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (2MB) | Request a copy
	Text RAMA_55201_09021382126135_TURNITIN.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (6MB) | Request a copy
	Text RAMA_55201_09021382126135_0006068305_01_front_ref.pdf - Accepted Version Available under License Creative Commons Public Domain Dedication. Download (837kB)
	Text RAMA_55201_09021382126135_0006068305_02.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (510kB) | Request a copy
	Text RAMA_55201_09021382126135_0006068305_03.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (259kB) | Request a copy
	Text RAMA_55201_09021382126135_0006068305_04.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (889kB) | Request a copy
	Text RAMA_55201_09021382126135_0006068305_05.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (597kB) | Request a copy
	Text RAMA_55201_09021382126135_0006068305_06_ref.pdf - Bibliography Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (195kB) | Request a copy
	Text RAMA_55201_09021382126135_0006068305_07_lamp.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (117kB) | Request a copy

Abstract

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.

Item Type:	Thesis (Undergraduate)
Uncontrolled Keywords:	Vehicle Routing Problem with Time Windows, Ant Colony Optimization, Nearest Neighbor, Optimasi.
Subjects:	T Technology > T Technology (General) > T1-995 Technology (General)
Divisions:	09-Faculty of Computer Science > 55201-Informatics (S1)
Depositing User:	Bonanda Siregar
Date Deposited:	07 Jul 2025 01:55
Last Modified:	07 Jul 2025 01:55
URI:	http://repository.unsri.ac.id/id/eprint/176801

Actions (login required)

View Item