Fachry, Rifdy (2015) Penentuan pola jaringan pergerakan logistik yang optimal pada transportasi laut menggunakan minimum spanning tree berbasis algoritma genetika. Undergraduate thesis, Institut Teknologi Sepuluh Nopember.
Preview |
Text
1211100013-Undergraduate_Thesis.pdf Download (2MB) | Preview |
Abstract
Penentuan pola jaringan pergerakan logistik yang optimal
berguna untuk mendukung perencanaan tol laut. Salah satu
parameter yang dapat digunakan untuk menentukan pola jaringan
pergerakan logistik yang optimal adalah dengan menentukan
jalur-jalur yang mempunyai kepadatan dalam pergerakan
kontainer. Penentuan pola jaringan pergerakan logistik dapat
dilakukan dengan menggunakan Minimum Spanning Tree (MST)
berbasis algoritma genetika. Algoritma genetika adalah sebuah
algoritma yang dapat digunakan dalam menyelesaikan
permasalahan MST. Adapun tahapan dari penentuan pola jaringan
pergerakan logistik yang optimal pada Tugas Akhir ini adalah
penentuan node, proses crossover, proses mutasi, proses evaluasi,
dan proses seleksi. Dalam penentuan node terdapat 52 node yang
merepresentasikan pelabuhan. Proses crossover menggunakan
crossover rate sebesar 0,2. Proses mutasi menggunakan mutation
rate sebesar 0,4. Berdasarkan hasil pengujian sistem ini diperoleh
total jalur terpadat dengan jumlah kontainer pada tiga tahun, yaitu
2010, 2011, dan 2012 berturut-turut adalah 1647896 Teu’s,
1825049 Teu’s, dan 2027860 Teu’s dengan inisialisasi populasi
100 dan generasi maksimum 2000.
================================================================================================
Determining the pattern of optimal movement logistics
network is very useful to support the planning of toll marine. One
of the parameters that can be used to determine the pattern of
movement logistic network is to determine the optimal paths that
have a density in the movement of containers. Determining the
pattern of movement of the logistics network can be done by using
the Minimum Spanning Tree (MST) based on genetic algorithm.
Genetic algorithm is an algorithm that can be used to solve the
problems of MST. The steps of determining the pattern of optimal
movement of logistic network in this final project is the
determination node, the process of crossover, mutation process,
evaluation process, and the selection process. In determining the
nodes, there are 52 nodes that represent the number of ports. The
process of crossover is using crossover rate of 0.2. The process of
mutation is using the mutation rate of 0.4. Based on test, results
obtained by the system is the lines with the most number of
containers in three years, namely 2010, 2011, and 2012
respectively TEU's 1,647,896, 1,825,049 TEU's, and 2.02786
million TEU's with a large initial population of 100 and a
maximum of 2000 generation.
| Item Type: | Thesis (Undergraduate) |
|---|---|
| Additional Information: | RSMa 511.8 Fac p |
| Uncontrolled Keywords: | Algoritma Genetika, Logistik, Minimum Spanning Tree, Optimasi. |
| Subjects: | Q Science > QA Mathematics > QA402.5 Genetic algorithms. Interior-point methods. |
| Divisions: | Faculty of Mathematics, Computation, and Data Science > Mathematics > 44201-(S1) Undergraduate Thesis |
| Depositing User: | - Taufiq Rahmanu |
| Date Deposited: | 30 Oct 2019 07:39 |
| Last Modified: | 30 Oct 2019 07:39 |
| URI: | http://repository.its.ac.id/id/eprint/71513 |
Actions (login required)
 |
View Item |