Anggraini, Septia (2025) Analisis Penentuan Rute Pengiriman Sparepart Dengan Metode Ant Colony Optimization (ACO) Di PT Threelog Kencana Mandiri Batam. Undergraduate thesis, UPN "VETERAN" JAWA TIMUR.
![[img]](https://repository.upnjatim.ac.id/style/images/fileicons/text.png) |
Text (Cover)
21032010064-cover.pdf Download (2MB) |
|
Text (Bab 1)
21032010064-bab1.pdf Download (241kB) |
|
Text (Bab 2)
21032010064-bab2.pdf Restricted to Repository staff only until 24 July 2027. Download (499kB) |
|
Text (Bab 3)
21032010064-bab3.pdf Restricted to Repository staff only until 24 July 2027. Download (256kB) |
|
Text (Bab 4)
21032010064-bab4.pdf Restricted to Repository staff only until 24 July 2027. Download (880kB) |
|
Text (Bab 5)
21032010064-bab5.pdf Restricted to Repository staff only until 24 July 2027. Download (219kB) |
|
Text (Daftar Pustaka)
21032010064-daftarpustaka.pdf Restricted to Repository staff only until 24 July 2027. Download (242kB) |
|
Text (Lampiran)
21032010064-lampiran.pdf Restricted to Repository staff only Download (366kB) |
Abstract
Route distribution efficiency is a crucial aspect of logistics operations, particularly for companies engaged in spare part delivery. PT Threelog Kencana Mandiri, operating in Batam, faces delivery delays due to a suboptimal route determination system, resulting in long travel distances, high operational costs, and distribution delays. This study aims to optimize delivery routes by applying the Ant Colony Optimization (ACO) algorithm, a metaheuristic method inspired by the behavior of ants in finding the shortest path. The problem is modeled as a Vehicle Routing Problem (VRP) by considering delivery destinations, distance matrices, and vehicle capacities. The ACO algorithm constructs routes based on pheromone intensity and heuristic visibility, followed by local and global updates to obtain more optimal solutions. The research results show a significant reduction in total travel distance compared to the company’s current routes. This optimization has an impact on fuel efficiency, reduced delivery times, and increased customer satisfaction. This study also demonstrates that the ACO algorithm can solve real world routing problems with dynamic variables.
| Item Type: | Thesis (Undergraduate) | ||||||||
|---|---|---|---|---|---|---|---|---|---|
| Contributors: |
|
||||||||
| Subjects: | T Technology > T Technology (General) T Technology > T Technology (General) > T55.4-60.8 Industrial engineering. Management engineering |
||||||||
| Divisions: | Faculty of Engineering > Departement of Industrial Engineering | ||||||||
| Depositing User: | Septia Anggraini Anggraini | ||||||||
| Date Deposited: | 25 Jul 2025 07:33 | ||||||||
| Last Modified: | 25 Jul 2025 07:33 | ||||||||
| URI: | https://repository.upnjatim.ac.id/id/eprint/40818 |
Actions (login required)
 |
View Item |