Tanuwijaya, Alvin (2020) Desain Dan Analisis Complete Search Algorithm Dengan Optimasi Pruning Berbasis Bitwise Pada Studi Kasus SPOJ HOUSEBUY: House Buying Optimizations. Other thesis, Institut Teknologi Sepuluh Nopember.
Preview |
Text
05111640000021-Alvin-Tanuwijaya-Buku_TA.pdf - Accepted Version Download (1MB) | Preview |
Abstract
Tugas Akhir ini berdasarkan permasalahan pada SPOJ (Sphere Online Judge) yaitu House Buying Optimizations (HOUSEBUY), yaitu pencarian kombinasi rumah terjauh dari seluruh kemungkinan kombinasi rumah terdekat dan jarak terjauh yang dapat dibentuk dari seluruh kombinasi pasangan rumah. Dibutuhkan metode penyelesaian yang cepat dan tepat untuk memenuhi persyaratan dalam menyelesaikan permasalahan HOUSEBUY. Batasan utamanya adalah waktu keseluruhan pencarian maksimal adalah 8 detik untuk mencari semua kombinasi penyelesaian masalahnya. Pada Tugas Akhir ini diimplementasikan solusi dari permasalahan HOUSEBUY dengan menggunakan algoritma complete search dengan optimasi pruning berbasis bitwise. Solusi tersebut mampu mengurangi jumlah pencarian sehingga mampu memenuhi batasan yang ditentukan.
=================================================================================================================================
This thesis based on the SPOJ (Sphere Online Judge): House Buying Optimizations problem (HOUSEBUY), i.e., finding a solution of longest distance of all possible closest distance of a pair of a house and the longest distance a pair of a house can be made. The fast and proper solution has been needed to fulfil the requirement in solving HOUSEBUY. The main constraint is that the maximum total searching is 8 seconds to find all of the combinations to solve the problem. The solution of HOUSEBUY will be implemented in this thesis by using the complete search algorithm with bitwise-based pruning optimization. This solution has been able to reduce the amount of search needed so that it has complied the time limit given.
| Item Type: | Thesis (Other) |
|---|---|
| Additional Information: | RSIf 006.312 Tan d-1 2020 |
| Uncontrolled Keywords: | Complete Search, Pruning, Bitwise |
| Subjects: | Q Science > QA Mathematics > QA76.9.D343 Data mining. Querying (Computer science) T Technology > T Technology (General) > T57.6 Operations research--Mathematics. Goal programming |
| Divisions: | Faculty of Intelligent Electrical and Informatics Technology (ELECTICS) > Informatics Engineering > 55201-(S1) Undergraduate Thesis |
| Depositing User: | Alvin Tanuwijaya |
| Date Deposited: | 21 Dec 2023 02:00 |
| Last Modified: | 21 Dec 2023 02:00 |
| URI: | http://repository.its.ac.id/id/eprint/73243 |
Actions (login required)
 |
View Item |