Melola Discovery

← Melola Discovery

Akses terbuka Jurnal Tanpa peringkat SINTA

Optimizing Cluster Centroids using Hybrid Firefly-Genetic Algorithm for Village Development Clustering

Jurnal Matematika, Statistika dan Komputasi · Vol. 22 No. 3 (2026) · hlm. 761–780

DOI
10.20956/j.v22i3.50288
ISSN
2614-8811, 1858-1382
Terbit
2026-05-14
Penerbit
Department of Mathematics, Hasanuddin University
Bahasa
en
Lisensi
creativecommons.org/licenses/by/4.0

Abstrak

Clustering in the Building Village Index (BVI) offers an alternative approach to identifying village groupings based on numerical and categorical characteristics similarities. K-Prototype (KP) is a popular clustering algorithm for handling. This study proposes the hybridization that combines the exploitation strength of the Firefly Algorithm (FA) with the exploration capability of the Genetic Algorithm (GA) to optimize centroid initialization of KP. The results show that FA-GA hybridization enables the centroid initialization process to be faster with optimal fitness compared to either a single FA or a single GA. FGAKP is the best clustering algorithm in this study because it produces the smallest Total Cost (TC) and the largest Cluster Validity (CV) index with the most efficient centroid initialization time across all training data. The implementation of FGAKP in village grouping based on BVI indicators in North Kalimantan Province in 2024 grouped 484 villages into 5 categories based on their village development potential, achieving an 11.69% reduction in TC and a 16.75% improvement in CV compared to the standard KP without optimization.

Kata kunci

Jaringan kolaborasi para penulis

35 penulis · 99 tautan kepenulisan bersama · 5 lintas organisasi

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • Politeknik Statistika STIS
  • Badan Pusat Statistik
  • Afiliasi tidak diketahui
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama
Rahmadathul WisdawatiBadan Pusat Statistik1
Bagaskoro Cahyo LaksonoPoliteknik Statistika STIS1
Bintang Izzatul FatahPoliteknik Statistika STIS1
Devi NovantiPoliteknik Statistika STIS1
Hajrul MultazamPoliteknik Statistika STIS1
Novira Laily HusnaPoliteknik Statistika STIS1
Ossy Sanityasa RahajengPoliteknik Statistika STIS1
L SelfinaPoliteknik Statistika STIS1
Muhammad MuawwadPoliteknik Statistika STIS1
Ananda Galuh Intan PrasetyaPoliteknik Statistika STIS1
Nawang Indah CahyaningrumPoliteknik Statistika STIS1
Danty Welmin Yoshida FatimaPoliteknik Statistika STIS1
Wisnu Adi KusumaPoliteknik Statistika STIS1
Sekar Ayu RamadhaniPoliteknik Statistika STIS1
Muhammad Rizqi DestantoPoliteknik Statistika STIS1
Muh. RizkiPoliteknik Statistika STIS1
Ahmad Safrian FauziPoliteknik Statistika STIS1
Rendy RendiAfiliasi tidak diketahui1
Ria NurulPoliteknik Statistika STIS1
Tika NovitasariPoliteknik Statistika STIS1
Cesaria DewiAfiliasi tidak diketahui1
Emban Permata SiamAfiliasi tidak diketahui1
Gona Asri WijayantiAfiliasi tidak diketahui1
Mustika PutriAfiliasi tidak diketahui1
Nurfitri AuliaAfiliasi tidak diketahui1
Mustika Putri MAfiliasi tidak diketahui1
Qonita RaihanandaPoliteknik Statistika STIS1
I Wayan Edy Darma PutraPoliteknik Statistika STIS1
Monica Seftaviani SijabatPoliteknik Statistika STIS1
Sifa RofatunnisaPoliteknik Statistika STIS1
Ibnu MarufPoliteknik Statistika STIS1
Hermarwan HermarwanPoliteknik Statistika STIS1

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Sumber metadata: OAI-PMH (metadata jurnal) https://journal.unhas.ac.id/index.php/jmsk/oai, pertama di-harvest 5 Nov 2026, terakhir terlihat 15 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en">Optimizing Cluster Centroids using Hybrid Firefly-Genetic Algorithm for Village Development Clustering </dc:title>
	<dc:creator xml:lang="en">Rahma, Annisa</dc:creator>
	<dc:creator xml:lang="en">Nooraeni, Rani</dc:creator>
	<dc:creator xml:lang="en"> Hizra, Raditya</dc:creator>
	<dc:subject xml:lang="en">Village Development Index</dc:subject>
	<dc:subject xml:lang="en">Cluster Analysis</dc:subject>
	<dc:subject xml:lang="en">Genetic Algorithm</dc:subject>
	<dc:subject xml:lang="en">Firefly Algorithm</dc:subject>
	<dc:description xml:lang="en">Clustering in the Building Village Index (BVI) offers an alternative approach to identifying village groupings based on numerical and categorical characteristics similarities. K-Prototype (KP) is a popular clustering algorithm for handling . This study proposes the hybridization that combines the exploitation strength of the Firefly Algorithm (FA) with the exploration capability of the Genetic Algorithm (GA) to optimize centroid initialization of KP. The results show that FA-GA hybridization enables the centroid initialization process to be faster with optimal fitness compared to either a single FA or a single GA. FGAKP is the best clustering algorithm in this study because it produces the smallest Total Cost (TC) and the largest Cluster Validity (CV) index with the most efficient centroid initialization time across all training data. The implementation of FGAKP in village grouping based on BVI indicators in North Kalimantan Province in 2024 grouped 484 villages into 5 categories based on their village development potential, achieving an 11.69% reduction in TC and a 16.75% improvement in CV compared to the standard KP without optimization.
 </dc:description>
	<dc:publisher xml:lang="en">Department of Mathematics, Hasanuddin University</dc:publisher>
	<dc:date>2026-05-14</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://journal.unhas.ac.id/index.php/jmsk/article/view/50288</dc:identifier>
	<dc:identifier>10.20956/j.v22i3.50288</dc:identifier>
	<dc:source xml:lang="en">Jurnal Matematika, Statistika dan Komputasi; Vol. 22 No. 3 (2026): May 2026; 761-780</dc:source>
	<dc:source>2614-8811</dc:source>
	<dc:source>1858-1382</dc:source>
	<dc:language>en</dc:language>
	<dc:relation>https://journal.unhas.ac.id/index.php/jmsk/article/view/50288/14425</dc:relation>
	<dc:rights xml:lang="en">Copyright (c) 2026 Jurnal Matematika, Statistika dan Komputasi</dc:rights>
	<dc:rights xml:lang="en">https://creativecommons.org/licenses/by/4.0</dc:rights>
</oai_dc:dc>