Optimasi Multiple Travelling Salesman Problem Pada Pendistribusian Air Minum Menggunakan Algoritme Genetika (Studi Kasus: Ud. Tosa Malang)

Karimah, Sayyidah (2017) Optimasi Multiple Travelling Salesman Problem Pada Pendistribusian Air Minum Menggunakan Algoritme Genetika (Studi Kasus: Ud. Tosa Malang). Sarjana thesis, Universitas Brawijaya.

Abstract

Distribusi yang baik merupakan salah satu strategi perusahaan untuk meningkatkan produktivitas perusahaan. Strategi distribusi sangat diperlukan, karena bisnis air minum kemasan mengalami peningkatan setiap tahun. Distributor air minum kemasan memiliki berbagai macam jenis dan merk barang dengan variasi bentuk kemasan yang berbeda. Tujuan pengiriman yang banyak menimbulkan masalah tentang proses distribusi, karena alamat dan jarak yang berbeda membutuhkan waktu lebih untuk sampai pada tempat tujuan. Penelitian ini memiliki tujuan untuk membuat sistem yang dapat membantu proses distribusi barang dengan sales lebih dari satu, permasalahan tersebut disebut dengan Multiple Travelling Salesman Problem (M-TSP). Salah satu metode untuk menyelesaikan masalah M-TSP yaitu menggunakan algoritme genetika, sehingga dapat menentukan rute dengan jarak terpendek yang akan dikunjungi setiap sales. Proses algoritme genetika menggunakan representasi permutasi dengan panjang kromosom sesuai banyak pesanan pelanggan dan jumlah pesanan pada setiap sales, setiap gen berupa angka yang merepresentasikan nomor pelanggan dan jumlah pesanan yang harus dikunjungi setiap sales. Hasil pengujian menunjukkan urutan rute yang dihasilkan dari penerapan algoritme genetika lebih baik daripada penerapan yang dilakukan pada distributor dengan selisih total jarak 89.3 km dan selisih nilai fitness 10.656578. Parameter optimal yang diperoleh yaitu dengan menghasilkan ukuran populasi 180, banyak generasi 400 serta kombinasi crossover rate 0.6 dan mutation rate 0.4.

English Abstract

A good distribution is one of the company's strategy to increase the productivity of the company. Distribution strategy is indispensable in bottled drinking water, because bottled water business has increased every year. Distributor of bottled water has a variety of types and brands of goods with different packaging forms. The number of shipping destinations poses many problems in the distribution process, because it takes more time to arrive at different address and distances. This research has a goal to create a system that can help the process of distribution of goods with number of sales more than one, the problem is called Multiple Traveling Salesman Problem (M-TSP). One method to solve M-TSP problem is to use genetic algorithm, so it can determine the route with the shortest distance that will be visited by every sales. The genetic algorithm process uses permutation representations with chromosome length according to many customer orders and the number of orders on each sales, each gene is a number representing the customer number and the number of orders that each salesperson should visit. The test results show that the route sequence generated from the application of the genetic algorithm is better than that applied to the distributor with a total distance of 89.3 km and the fitness difference is 10.656578. The optimal parameters were obtained by generating population size 180, 400 generation and crossover rate 0.6 and mutation rate 0.4.

Item Type: Thesis (Sarjana)
Identification Number: SKR/FTIK/2017/238/051704812
Uncontrolled Keywords: pendistribusian, air minum, multiple travelling salesman problem (M-TSP), algoritme genetika
Subjects: 000 Computer science, information and general works > 006 Special computer methods > 006.3 Artificial intelligence > 006.31 Machine learning
Divisions: Fakultas Ilmu Komputer > Teknik Informatika
Depositing User: Sugiantoro
Date Deposited: 17 Jul 2017 02:18
Last Modified: 16 Oct 2020 02:21
URI: http://repository.ub.ac.id/id/eprint/266
[thumbnail of 051704812 BAGIAN DEPAN.pdf] Text
051704812 BAGIAN DEPAN.pdf
Restricted to Repository staff only

Download (105kB)
[thumbnail of 051704812 BAB I.pdf] Text
051704812 BAB I.pdf
Restricted to Repository staff only

Download (64kB)
[thumbnail of 051704812 BAB II.pdf] Text
051704812 BAB II.pdf
Restricted to Repository staff only

Download (114kB)
[thumbnail of 051704812 BAB III.pdf] Text
051704812 BAB III.pdf
Restricted to Repository staff only

Download (85kB)
[thumbnail of 051704812 BAB IV.pdf] Text
051704812 BAB IV.pdf
Restricted to Repository staff only

Download (212kB)
[thumbnail of 051704812 BAB V.pdf] Text
051704812 BAB V.pdf
Restricted to Repository staff only

Download (399kB)
[thumbnail of 051704812 BAB VI.pdf] Text
051704812 BAB VI.pdf
Restricted to Repository staff only

Download (169kB)
[thumbnail of 051704812 BAB VII.pdf] Text
051704812 BAB VII.pdf
Restricted to Repository staff only

Download (42kB)
[thumbnail of 051704812 DAFTAR PUSTAKA.pdf] Text
051704812 DAFTAR PUSTAKA.pdf
Restricted to Repository staff only

Download (40kB)

Actions (login required)

View Item View Item