Analisis Komparatif Strategi Algoritma Pencarian Dalam Penyelesaian Masalah Kecerdasan Buatan
Keywords:
Algorithm, Artificial Intelligence, Heuristic Search, State Space SearchAbstract
Search algorithms are a fundamental component in computer science, specifically in the domain of Artificial Intelligence (AI) for solving state space search problems. This study aims to conduct a comparative analysis between Uninformed Search strategies (BFS, DFS) and Informed Search strategies (A*, Hill Climbing, Simulated Annealing). The research method used is a Systematic Literature Review (SLR) by synthesizing data from primary and secondary sources. The results indicate a significant trade-off; Uninformed Search such as BFS guarantees optimality but has high space complexity while DFS is memory efficient but not complete. Conversely, Informed Search significantly increases efficiency, requiring only about 4.45% of computation compared to blind search. The A* algorithm is identified as the most effective strategy for pathfinding by balancing actual cost and heuristic estimation, whereas Simulated Annealing overcomes the local optima problem found in Hill Climbing. The selection of the right algorithm depends on the specific constraints of the problem faced.
References
W. Kustiawan, U. Sebelas, and A. Sumedang, “Pengamatan tentang optimalisasi algoritma pencarian dalam pemrosesan data besar”.
D. Markuci and C. Prianto, “Analisis Perbandingan Penggunaan Algoritma Sequential Analisis Perbandingan Penggunaan Algoritma Sequential Search Dan Binary Search Pada Aplikasi Surat Perjalanan Dinas,” vol. 6, no. 1, pp. 110–119, 2022.
Daswanta kumar routhu, “State Space Search in AI,” geeksforgeeks.org. Accessed: Nov. 10, 2025. [Online]. Available: https://www.geeksforgeeks.org/artificial-intelligence/state-space-search-in-ai/
W. Hidayat, F. Susanti, D. R. Wijaya, and W. Hidayat, “A Comparative Study of Informed and Uninformed Search Algorithm to Solve Eight-Puzzle Problem,” 2021, doi: 10.3844/jcssp.2021.1147.1156.
Rahmayani, R., Firmansyah, E., & Hikmah, H. U. (2025). Inovasi Layanan Antar Jemput Paket Surat PTPos Indonesia Berdasarkan Penjualan dan Minat Beli JOVISHE: Journal of Visionary Sharia Economy,4(1), 33-47.
Firmansyah, E., Rahman, A. B. A., & Subiyakto, A. A. (2023). Pengukuran Kesiapan Kota Cerdas Berdasarkan SNI ISO 37122: 2019.Infoman's: Jurnal Ilmu-ilmu Informatika dan Manajemen,17(2).
Zulfikar,W.B., Irfan, M., Ghufron, M., Jumadi, J., & Firmansyah, E. (2020). Marketplace affiliatespotential analysis using cosine similarity and vision-based page segmentation.Bulletin of ElectricalEngineering and Informatics,9(6), 2492-2498.
Ramadhan, N. D., Fhatturohmah, S., Ramadhani, S., & Firmansyah, E. (2023). Analysis of Digital WalletUsage on Consumptive Lifestyle.Journal of Islamic Economics and Business,3(2), 118-136.
Sutara, B., & Firmansyah, E. (2021). Design and Build Student Attendance System Using Fingerprint.J-Tin's-Jurnal Teknik Informatika,5(1).
Wahana, A., Firmansyah, E., Al Rosyid, H. I., Fuadi, R. S., & Maylawati, D. S. A. (2021). Fuzzy Tahani Method in the Recommendation System for Selecting Mountain Tourism Destinations in West Java.
Tamrin, M. A., Rizki, B., Nodas, A., Rahman, A., & Firmansyah, E. (2020). Perbandingan PenggunaanMetode Topsis dan Metode AHP dalam Penilaian Kinerja pada Karyawan (PT XYZ).Infoman's: JurnalIlmu-ilmu Informatika dan Manajemen,14(1).
Firmansyah, E., Herdiana, D., & Yuniarto, D. (2020, October). Examining readiness of e-Learningimplementation using information system readiness impact model. In2020 8th International Conferenceon Cyber and IT Service Management (CITSM)(pp. 1-5). IEEE.
Firmansyah, E., Rosmawati, R., Fuadi, R. S., Fauzy, D., & Ramdhani, M. A. (2019, December). Designof expert system to determine the proper diet using harmony search method. InJournal of Physics:Conference Series(Vol. 1402, No. 7, p. 077006). IOP Publishing.
Firmansyah, E., & Helmiawan, M. A. (2025). Pengukuran Kesiapan Transformasi Digital Desa Kaduwulung Menuju Desa Cerdas Berbasis SNI ISO 37122: 2019 Melalui Pemetaan Data Desa.Infoman's: Jurnal Ilmu-ilmu Informatika dan Manajemen,19(1).
Firmansyah, E., Herdiana, D., Yuniarto, D., & Junaedi, D. I. (2021, September). The K-Nearest Neighbor Algorithm for the Classification of Internet Users in Rural Campus. In 2021 9th International Conference on Cyber and IT Service Management (CITSM) (pp. 1-6). IEEE.
Zaliluddin, D., Bastian, A., Yuliani, M. S. S., Firmansyah, E., & Sumaryana, Y. (2024). Engaging Teens in History through a Mobile Game Utilizing the Fisher-Yates Shuffle Algorithm and Honeycomb UX Design. International Journal of Interactive Mobile Technologies, 18(22).
Syaripudin, U., Zaenal, R., Duri, M. F. A., Firmansyah, E., & Rahman, A. (2019, December). Comparison between Naïve Bayes and certainty factor to predict big five personality. In Journal of Physics: Conference Series (Vol. 1402, No. 7, p. 077030). IOP Publishing.
K. I. Lestari, S. Putra, E. Rilvani, U. P. Bangsa, and K. Bekasi, “Permasalahan Efisiensi Algoritma Apriori Dan Evaluasi Fp-Growth Berdasarkan Studi Literatur Evaluasi Fp-Growth Berdasarkan Studi Literatur,” vol. 3, no. 7, 2025.
Divyan shuraj, “A* algorithm and its Heuristic Search Strategy in Artificial Intelligence,” geeksforgeeks.org. [Online]. Available: https://www.geeksforgeeks.org/artificial-intelligence/a-algorithm-and-its-heuristic-search-strategy-in-artificial-intelligence/
T. N. Lina et al., “Comparison Analysis of Breadth First Search and Depth Limited Search Algorithms in Sudoku Game,” vol. 2, no. 2, pp. 74–83, 2021, doi: 10.25008/bcsee.v2i2.1146.
T. M. Hutagalung, “Perbandingan Algoritma Floyd Warshall Dan Algoritma A* Dalam Pencarian Rute Terpendek Menuju Lokasi Rumah Sakit Di Palembang,” 2016.
P. Studi, T. Informatika, F. Teknologi, U. Kristen, D. Wacana, and A. Christian, “Studi literatur perbandingan algoritma dijkstra dan bellman-ford dalam pencarian jarak terdekat,” 2013.
P. Pangestu and R. Novita, “Systematic Literature Review : Perbandingan Algoritma Klasifikasi,” pp. 431–440, 2023.
Devendewc0m, “What is Simulated Annealing,” geeksforgeeks.org. [Online]. Available: https://www.geeksforgeeks.org/artificial-intelligence/what-is-simulated-annealing/
M. A. B. Ade Candra, “Application of A-Star Algorithm on Pathfinding Game,” 2021, doi: 10.1088/1742-6596/1898/1/012047.
R. Gayathri, “Comparative Analysis of Various Uninformed Searching Algorithms in AI,” vol. 8, no. 6, pp. 57–65, 2019.
Payalcs, “Generate and Test Search,” geeksforgeeks.org. [Online]. Available: https://www.geeksforgeeks.org/machine-learning/generate-and-test-search/
Ujjwal rawat, “Hill Climbing in Artificial Intelligence,” geeksforgeeks.org. [Online]. Available: https://www.geeksforgeeks.org/artificial-intelligence/introduction-hill-climbing-artificial-intelligence/
S. Singh, “Best First Search (Informed Search),” geeksforgeeks.org. [Online]. Available: https://www.geeksforgeeks.org/dsa/best-first-search-informed-search/
Mygreatlearning, “Best First Search Algorithm in AI,” Mygreatlearning. [Online]. Available: https://www.mygreatlearning.com/blog/best-first-search-bfs/
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2025 Infoman's : Jurnal Ilmu-ilmu Informatika dan Manajemen
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
This work is licensed under a Creative Commons Attribution 4.0 International License.
