Data Search Process Optimization using Brute Force and Genetic Algorithm Hybrid Method
High accuracy and speed in data search, which are aims at finding the best solution to a problem, are essential. This study examines the brute force method, genetic algorithm, and two proposed algorithms which are the development of the brute force algorithm and genetic algorithm, namely Multiple Cr...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
State Islamic University Sunan Kalijaga
2023-01-01
|
| Series: | IJID (International Journal on Informatics for Development) |
| Subjects: | |
| Online Access: | https://ejournal.uin-suka.ac.id/saintek/ijid/article/view/3743 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | High accuracy and speed in data search, which are aims at finding the best solution to a problem, are essential. This study examines the brute force method, genetic algorithm, and two proposed algorithms which are the development of the brute force algorithm and genetic algorithm, namely Multiple Crossover Genetic, and Genetics with increments values. Brute force is a method with a direct approach to solving a problem based on the formulation of the problem and the definition of the concepts involved. A genetic algorithm is a search algorithm that uses genetic evolution that occurs in living things as its basis. This research selected the case of determining the pin series by looking for a match between the target and the search result. To test the suitability of the method, 100-time tests were conducted for each algorithm. The results of this study indicated that brute force has the highest average generation rate of 737146.3469 and an average time of 1960.4296, and the latter algorithm gets the best score with an average generation rate of 36.78 and an average time of 0.0642. |
|---|---|
| ISSN: | 2252-7834 2549-7448 |