Article Per Year (5 Year)
p-Index From 2019 - 2024
2.928
P-Index
This Author published in this journals
All Journal Pythagoras: Jurnal Matematika dan Pendidikan Matematika Seminar Nasional Aplikasi Teknologi Informasi (SNATI) CAUCHY: Jurnal Matematika Murni dan Aplikasi Perfecting a Video Game with Game Metrics Lingua Jurnal Bahasa dan Sastra Jurnal Ilmu Komputer dan Agri-Informatika Jurnal Karya Pendidikan Matematika Journal of ICT Research and Applications Jurnal Matematika dan Statistika serta Aplikasinya (Jurnal MSA) JOIN (Jurnal Online Informatika) Jurnal Matematika: MANTIK JMPM: Jurnal Matematika dan Pendidikan Matematika BAREKENG: Jurnal Ilmu Matematika dan Terapan JTAM (Jurnal Teori dan Aplikasi Matematika) Jambura Journal of Mathematics M A T H L I N E : Jurnal Matematika dan Pendidikan Matematika Jurnal Ilmiah Matematika dan Pendidikan Matematika (JMP) Indonesian Journal of Electrical Engineering and Computer Science Milang Journal of Mathematics and Its Applications Jurnal Matematika Integratif
Bib Paruhum Silalahi
Department Of Mathematics, Faculty Of Mathematics And Natural Sciences, IPB University, Bogor
Agriculture, Biological Sciences & Forestry Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Earth & Planetary Sciences Economics, Econometrics & Finance Education Electrical & Electronics Engineering Energy Engineering Environmental Science Languange, Linguistic, Communication & Media Mathematics Mechanical Engineering Medicine & Pharmacology Physics Transportation

Published : 30 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search
Journal : Pythagoras: Jurnal Matematika dan Pendidikan Matematika

 1 
Algoritme Migrating Birds Optimization dan Algoritme Particle Swarm Optimization: Penyelesaian Masalah Knapsack 0-1 Bib Paruhum Silalahi; Mohamad Novanto; Prapto Tri Supriyo
Pythagoras: Jurnal Matematika dan Pendidikan Matematika Vol 17, No 1: June 2022
Publisher : Department of Mathematics Education, Faculty of Mathematics and Natural Sciences, UNY

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.21831/pythagoras.v17i1.35660

Abstract

Permasalahan knapsack merupakan salah satu masalah optimisasi. Masalah knapsack merupakan suatu permasalahan bagaimana memilih objek dari beberapa objek yang akan dimasukkan ke media penyimpanan dengan masing-masing objek memiliki bobot dan total bobot dari objek yang dipilih tidak boleh melebihi kapasitas media penyimpanannya, sehingga diperoleh nilai yang  maksimal. Ketika objek yang dimasukkan ke dalam media penyimpanan bersifat harus dimasukkan semua atau tidak sama sekali, permasalahan ini dikenal dengan nama knapsack 0-1.  Salah satu metode penyelesaian masalah knapsack 0-1 adalah dengan menggunakan metode meta-heuristic.  Terdapat beberapa metode meta-heuristic seperti algoritma migrating birds optimization dan particle swarm optimization.  Paper ini membahas bagaimana algoritma migrating birds optimization dan particle swarm optimization digunakan dalam menyelesaikan permasalahan knapsack 0-1.  Kemudian dilakukan perbandingan kinerja kedua algoritma tersebut berdasarkan  nilai fungsi tujuan untuk beberapa studi kasus. Berdasarkan hasil penelitian ini algoritme migrating birds optimization mempunyai nilai hasil fungsi objektif yang lebih baik dibandingkan dengan algoritma particle swarm optimization.Migrating Birds Optimization Algorithm and Particle Swarm Optimization Algorithm: Knapsack problem solving 0-1AbstractThe knapsack problem is one of the optimization problems. The knapsack problem is a problem of how to select objects from several objects to be inserted into the storage with each object having a weight and the total weight of the selected object must not exceed the capacity of the storage so that the maximum value is obtained. When objects that are inserted into the storage have the character of having to be included all or nothing, this problem is known as the 0-1 knapsack. One of the methods of solving the 0-1 knapsack problem is by using the meta-heuristic method. There are several meta-heuristic methods such as the migrating birds optimization algorithm and particle swarm optimization. This paper discusses how migrating birds optimization and particle swarm optimization algorithms are used to solve the 0-1 knapsack problem. Then the performance of the two algorithms is compared based on the objective function values for several case studies. Based on the results of this study, the migrating birds optimization algorithm has better objective function values than the particle swarm optimization algorithm.
Co-Authors Agung Prajuhana Putra Agus Buono Agus Buono Agus Buono Agus Buono Amril Aman Danny Dimas Sulistio Elisabeth Sri Hendrastuti Fadhilah Syafria Fadhilah Syafria Fahren Bukhari Faisal Muhammad Fajar Setyawan Farahdila Sahara Farida Hanum Farida Hanum Franki Yusuf Bisilisin Haliza Suci Rachmadini Hidayatul Mayyani Hidayatul Mayyani Hidayatul Mayyani I Gede Arta Wibawa I Wayan Mangku I Wayan Mangku Inggih Permana Julio Adisantoso Karlisa Priandana Khoerul Fatihin Marisa Nurbaiti Mayyani, Hidayatul Mohamad Novanto Mu'min, Ulil Albab Muhammad Wiranadi Utama Mutia Atika Nabilah Diar Brigitha Ngakan Nyoman Kutha Krisnawijaya Nur Ahzan, Zulkaidah Nur Aliatiningtyas Nurul Fathiah Prapto Tri Supriyo Prapto Tri Supriyo Prapto Tri Supriyo Prapto Tri Supriyo Prapto Tri Supriyo Rafika Husnia Munfa'ati Silviana Eka Pertiwi Sri Nurdiati Sugi Guritman Sumanto, Sumanto Syeiva Nurul Desylvia T Murdani Saputra Ulil Albab Mu'min Yasin Yusuf