PENENTUAN RUTE OPTIMAL PADA KURIR EKSPEDISI UNTUK MENENTUKAN BIAYA TRANSPORTASI OPTIMAL MENGGUNAKAN FIREFLY ALGORITHM-ANT COLONY OPTIMIZATION (Studi Kasus: PT Dea Abadi Konsolidator Lion Parcel Solo Raya)

Priowasono, Almashayna Weningtyas (2023) PENENTUAN RUTE OPTIMAL PADA KURIR EKSPEDISI UNTUK MENENTUKAN BIAYA TRANSPORTASI OPTIMAL MENGGUNAKAN FIREFLY ALGORITHM-ANT COLONY OPTIMIZATION (Studi Kasus: PT Dea Abadi Konsolidator Lion Parcel Solo Raya). Other thesis, UPN "Veteran" Yogyajarta.

[thumbnail of ABSTRAK_122190139_ALMASHAYNA WENINGTYAS PRIOWASONO.pdf] Text
ABSTRAK_122190139_ALMASHAYNA WENINGTYAS PRIOWASONO.pdf
Download (87kB)
[thumbnail of COVER SKRIPSI_122190139_ALMASHAYNA WENINGTYAS PRIOWASONO.pdf] Text
COVER SKRIPSI_122190139_ALMASHAYNA WENINGTYAS PRIOWASONO.pdf
Download (316kB)
[thumbnail of DAFTAR PUSTAKA_122190139_ALMASHAYNA WENINGTYAS PRIOWASONO.pdf] Text
DAFTAR PUSTAKA_122190139_ALMASHAYNA WENINGTYAS PRIOWASONO.pdf
Download (84kB)
[thumbnail of FULL SKRIPSI_122190139_ALMASHAYNA WENINGTYAS PRIOWASONO.pdf] Text
FULL SKRIPSI_122190139_ALMASHAYNA WENINGTYAS PRIOWASONO.pdf
Restricted to Repository staff only
Download (5MB)
[thumbnail of DAFTAR ISI_122190139_ALMASHAYNA WENINGTYAS PRIOWASONO.pdf] Text
DAFTAR ISI_122190139_ALMASHAYNA WENINGTYAS PRIOWASONO.pdf
Download (185kB)
[thumbnail of LEMBAR PENGESAHAN_122190139_ALMASHAYNA WENINGTYAS PRIOWASONO.pdf] Text
LEMBAR PENGESAHAN_122190139_ALMASHAYNA WENINGTYAS PRIOWASONO.pdf
Download (211kB)

Abstract

xv
ABSTRAK
Multiple Traveling Salesman Problem (mTSP) merupakan permasalahan
dimana terdapat sejumlah N kota dan sebuah kota awal untuk dilewati oleh
beberapa salesman. Tiap salesman memulai perjalanan dari kota awal ke semua
kota tepat satu kali. Tujuan permasalahan optimasi ini yakni meminimumkan total
jarak tempuh tiap salesman. Nilai optimum didapatkan dengan pencarian semua
kemungkinan rute. Semakin banyak kota yang dituju maka akan membutuhkan
waktu yang lama dalam penyelesaian. Penelitian ini menggunakan metode hybrid
firefly algorithm-ant colony optimization dalam penyelesaian permasalahan mTSP
dengan studi kasus pengiriman kurir paket.
Penelitian diawali dengan pengolahan menggunakan algoritma FA untuk
mencari solusi lokal. Solusi lokal FA diinisialisasi dalam pencarian solusi global
menggunakan metode ACO. Dari kedua metode yaitu FA-ACO dan ACO dibuat
perbandingan dimana untuk metode ACO Rata-rata solusi untuk metode ACO
yakni sebesar 96,383 km sedangkan hasil rata-rata solusi untuk metode FA-ACO
yakni sebesar 90,86 km. Waktu komputasi rata-rata pencarian solusi metode ACO
adalah 4,80 detik, sedangkan waktu komputasi rata-rata pencarian solusi metode
FA-ACO adalah 4,22 detik. Hasil jarak terbaik adalah pengaruh total biaya
operasional dimana penurunan total biaya operasional harian dalam 1 siklus kedua
kurir sebesar 49,69% dari Rp1.204.600,00 menjadi Rp607.453,00.
Kata kunci: Multiple Traveling Salesman Problem (mTSP), Hybrid Firefly
Algorithm-Ant Colony Optimization.
xvi
ABSTRACT
The Multiple Traveling Salesman Problem (mTSP) is a problem where there
are N cities and a starting city for several salesmen to pass through. Each salesman
travels from the initial city to all cities exactly once. The objective of this
optimization problem is to minimize the total mileage of each salesman. The
optimum value is obtained by searching all possible routes. The more cities you
target, the longer it will take to complete. This study uses the hybrid firefly
algorithm-ant colony optimization method in solving mTSP problems with case
studies of package courier delivery.
The research begins with processing using the FA algorithm to find local
solutions. FA local solutions are initialized in the search for global solutions using
the ACO method. From the two methods, namely FA-ACO and ACO, a comparison
was made where for the ACO method the average solution for the ACO method was
96.383 km while the average solution result for the FA-ACO method was 90.86
km.The average computational time for finding a solution for the ACO method is
4.80 seconds, while the average computational time for finding a solution for the
FA-ACO method is 4.22 seconds. From the result of best total distances impacts the
operational cost where the decrease in total daily operating costs in 1 cycle of two
couriers was 49.69% from IDR 1.204.600,00 to IDR 607.453,00.
Keywords: Multiple Traveling Salesman Problem (mTSP), Hybrid Firefly
Algorithm-Ant Colony Optimization.

Item Type: Thesis (Other)
Uncontrolled Keywords: Multiple Traveling Salesman Problem (mTSP), Hybrid Firefly Algorithm-Ant Colony Optimization.
Subjects: H Social Sciences > HD Industries. Land use. Labor
Divisions: Faculty of Engineering, Science and Mathematics > School of Engineering Sciences
Depositing User: Eko Yuli
Date Deposited: 22 Jun 2023 04:21
Last Modified: 22 Jun 2023 04:22
URI: http://eprints.upnyk.ac.id/id/eprint/36089

Actions (login required)

View Item View Item