Bonanda Siregar
Universitas Sriwijaya

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

Optimization Of Vehicle Routing Problem With Time Windows VRPTW Using Hybrid Ant Colony Optimization ACO On Food Product Distribution Routes Bonanda Siregar; Yunita
CCIT Journal Vol 19 No 2 (2026): CCIT JOURNAL
Publisher : UNIVERSITAS RAHARJA

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33050/ccit.v19i2.4207

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.