Majalah Ilmiah Matematika dan Statistika Volume 18 Nomor 1, 2018, 13 – 22 https://jurnal.unej.ac.id/index.php/MIMS/index ISSN 1411-6669 13 Algoritma Elephant Herding Optimization: Permasalahan Multiple Constraints Knapsack 0-1 (Elephant Herding Optimization Algorithm: Multiple Constraints Knapsack 0-1 Problems) Yulia Dewi Regita, Kiswara Agung Santoso, Ahmad Kamsyakawuni Jurusan Matematika, Fakultas MIPA, Universitas Jember Jl. Kalimantan 37 Jember 68121, Indonesia E-mail: yulia.dr.ydr@gmail.com, {kiswara, kamsyakawuni}.fmipa@unej.ac.id Abstract. Optimization problems are often found in everyday life, such as when determining goods to be a limited storage media. This causes the need for the selection of goods in order to obtain profits with the requirements met. This problem in mathematics is usually called a knapsack. Knapsack problem itself has several variations, in this study knapsack type used is multiple constraints knapsack 0-1 which is solved using the Elephant Herding Optimization (EHO) algorithm. The aim of this study is to obtain an optimal solution and study the effectiveness of the algorithm comparing it to the Simplex method in Microsoft Excel. This study uses two data, consisting of primary and secondary data. Based on the results of parameter testing, the proven parameters are nClan, nCi,α,β and MaxGen have a significant effect. The final simulation results have also shown a comparison of the EHO algorithm with the Simplex method having a very small percentage deviation. This shows that the EHO algorithm is effective for completing optimization multiple constraints knapsack 0-1. Keywords: EHO Algorithm, Multiple Constraints Knapsack 0-1 Problem. MSC 2010: 9008 1. Pendahuluan Masalah optimasi merupakan hal yang sering dijumpai dalam pekerjaan sehari-hari, seperti penentuan pemilihan barang pada permasalahan knapsack. Permasalahan knapsack merupakan permasalahan yang berhubungan dengan penyimpanan objek ke dalam media penyimpanan yang bersifat terbatas. Knapsack merupakan suatu kantong atau tempat yang digunakan untuk memuat sesuatu objek. Kantong atau tempat tersebut hanya dapat menyimpan beberapa objek saja dengan ketentuan total ukuran objek tersebut lebih kecil atau sama dengan ukuran kapasitasnya. Knapsack terdiri dari beberapa persoalan antara lain Knapsack 0-1 (Binary Knapsack), Knapsack terbatas (Bounded Knapsack) dan Knapsack tak berbatas (Unbounded