Penyelesaian Asymmetric Clustered Travelling Salesman Problem dengan Algoritma Evolutionary Discrete Firefly Algorithm pada Kasus Kontrol SPBU Surabaya

Putra, Sulis Avandhy (2023) Penyelesaian Asymmetric Clustered Travelling Salesman Problem dengan Algoritma Evolutionary Discrete Firefly Algorithm pada Kasus Kontrol SPBU Surabaya. Other thesis, Institut Teknologi Sepuluh Nopember.

Text 05211940000084-Undergraduate_Thesis.pdf - Accepted Version Restricted to Repository staff only until 1 October 2025. Download (1MB) | Request a copy

Abstract

Distribusi merupakan salah satu aktivitas dalam manajemen rantai pasok yang harus dikelola secara tepat dan efektif. Hal ini dikarenakan biaya dalam melakukan distribusi merupakan penyumbang terbesar dalam harga akhir suatu produk. Masalah ini dapat diselesaikan dengan mengoptimalkan jalur distribusi yang telah ada sehingga dapat mengurangi biaya yang dikeluarkan selama distribusi. Masalah optimasi rute ini dikenal dengan travelling saleman problem (TSP). TSP telah berkembang menjadi berbagai variasi untuk menyesuaikan dengan kondisi dunia nyata salah satunya adalah asymmetric clustered travelling salesman problem (ACTSP). ACTSP sendiri merupakan variasi TSP dengan kota-kota yang ada berada pada beberapa klaster dan setiap kota pada klaster harus dikunjungi secara berurutan. Biaya pulang dan pergi anatr kota pada ACTSP akan berbeda. Pada penelitian ini, ACTSP akan diselesaikan dengan firefly algorithm (FA). FA sendiri adalah metode metaheuristek yang terinpirasi dari perilaku kunang-kunang. Kemudian FA akan diterapkan pada studi kasus penentuan rute petugas control SPBU di Surabaya.
======================================================================================================================================
Distribution is one of the activities in supply chain management that must be managed properly and effectively. This is because the cost of conducting distribution is the biggest contributor to the final price of a product. This problem can be solved by optimizing existing distribution channels so as to reduce costs incurred during distribution. This route optimization problem is known as the traveling saleman problem (TSP). TSP has developed into various variations to adapt to real world conditions, one of which is the asymmetric clustered traveling salesman problem (ACTSP). ACTSP itself is a variation of TSP with cities in several clusters and each city in the cluster must be visited sequentially. The cost of going back and forth between cities at ACTSP will be different. In this study, ACTSP will be solved with the firefly algorithm (FA). FA itself is a metaheuristic method inspired by the behavior of fireflies. Then FA will be applied to a case study in determining the route of gas station control officers in Surabaya.

Item Type:	Thesis (Other)
Uncontrolled Keywords:	Distribusi, TSP, ACTSP, FA, Evolutionary Discrete FA, edge-based Distribution, TSP, ACTSP, FA, Evolutionary Discrete FA, edge-based
Subjects:	Q Science > Q Science (General) > Q337.3 Swarm intelligence Q Science > QA Mathematics > QA402.6 Transportation problems (Programming) Q Science > QA Mathematics > QA9.58 Algorithms
Divisions:	Faculty of Intelligent Electrical and Informatics Technology (ELECTICS) > Information System > 57201-(S1) Undergraduate Thesis
Depositing User:	Sulis Avandhy Putra
Date Deposited:	20 Jul 2023 03:03
Last Modified:	20 Jul 2023 03:03
URI:	http://repository.its.ac.id/id/eprint/98662

Actions (login required)

View Item