PENERAPAN ALGORITMA ELEPHANT HERDING OPTIMIZATION PADA PERMASALAHAN KNAPSACK 0-1

DARMAWAN, HAFIZ and Rini, Dian Palupi and Arsalan, Osvari (2019) PENERAPAN ALGORITMA ELEPHANT HERDING OPTIMIZATION PADA PERMASALAHAN KNAPSACK 0-1. Undergraduate thesis, Sriwijaya University.

	Text RAMA_55201_09021281419055.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (3MB) | Request a copy
Preview	Text RAMA_55201_09021281419055_0023027804_0028068806_01_front_ref.pdf - Accepted Version Available under License Creative Commons Public Domain Dedication. Download (1MB) | Preview
	Text RAMA_55201_09021281419055_0023027804_0028068806_02.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (322kB) | Request a copy
	Text RAMA_55201_09021281419055_0023027804_0028068806_03.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (769kB) | Request a copy
	Text RAMA_55201_09021281419055_0023027804_0028068806_04.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (1MB) | Request a copy
	Text RAMA_55201_09021281419055_0023027804_0028068806_05.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (721kB) | Request a copy
	Text RAMA_55201_09021281419055_0023027804_0028068806_06_ref.pdf - Bibliography Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (206kB) | Request a copy
	Text RAMA_55201_09021281419055_0023027804_0028068806_07_lamp.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (505kB) | Request a copy
	Text RAMA_55201_09021281419055_TURNITIN.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (21MB) | Request a copy

Abstract

Knapsack problem is the problem of choosing from many stored objects so that an optimal storage is obtained by paying attention to objects that consist of n objects (1, 2, 3, ...) where each object has a weight (Wi) and profit (Pi) by considering also the storage media capacity of M. There are many methods for solving knapsack problems, one of which uses the metaheuristic method. Metaheuristic methods that have been used to solve knapsack 0-1 problems include Binary Firefly Algorithm (BFA), and Genetic algorithms. This study uses the Elephant Herding Optimization (EHO) algorithm to solve knapsack 0-1 problems. The results of this study were compared with BFA with a higher accuracy of 6 problems. The profit value in the EHO algorithm is higher if more and more iterations are done.

Item Type:	Thesis (Undergraduate)
Uncontrolled Keywords:	Knapsack 0-1, Elephant Herding Optimization Algorithm, Metaheuristic
Subjects:	Q Science > QA Mathematics > QA75-76.95 Calculating machines > QA75 Electronic computers. Computer science Q Science > QA Mathematics > QA75-76.95 Calculating machines > QA76 Computer software
Divisions:	09-Faculty of Computer Science > 55201-Informatics (S1)
Depositing User:	Users 1601 not found.
Date Deposited:	02 Sep 2019 04:11
Last Modified:	02 Sep 2019 04:11
URI:	http://repository.unsri.ac.id/id/eprint/5242

Actions (login required)

View Item