Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 1

Modified gorilla troops optimization for the quadratic assignment problem

IAES International Journal of Artificial Intelligence · Vol. 15 No. 3 (2026) · hlm. 2153–2165

DOI
10.11591/ijai.v15.i3.pp2153-2165
ISSN
2252-8938, 2089-4872
Terbit
2026-06-01
Penerbit
Institute of Advanced Engineering and Science
Bahasa
eng
Lisensi
creativecommons.org/licenses/by-sa/4.0

Abstrak

Balancing exploration and exploitation remain a fundamental challenge in artificial intelligence-based optimization, particularly when addressing discrete combinatorial problems such as the quadratic assignment problem (QAP). The gorilla troops optimizer (GTO), inspired by the collective social behavior of gorillas, has shown promising results in continuous domains but faces limitations when directly applied to discrete optimization. To address this, the present study introduces a modified gorilla troops optimizer (MGTO), a novel discrete adaptation designed specifically for the QAP. The proposed MGTO strategically integrates a swapping-based diversification mechanism to enhance exploration within discrete solution spaces, while a modified uniform crossover operator promotes effective exploitation of high-quality solutions. Extensive experiments on benchmark instances from the quadratic assignment problem library (QAPLIB) show that MGTO achieves superior convergence behavior and solution quality compared with several state-of-the-art algorithms. These results demonstrate MGTO’s capacity to maintain a balanced equilibrium between exploration and exploitation, effectively navigating complex discrete landscapes to yield high-quality solutions with strong computational efficiency.

Kata kunci

Jaringan kolaborasi para penulis

7 penulis · 13 tautan kepenulisan bersama · 1 lintas organisasi

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

  • Shatt Al-Arab University College
  • Universiti Utara Malaysia
  • 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
Hassan Fouad Abbas Al-MaziniAfiliasi tidak diketahui2
Hayder Naser Khraibet Al-BehadiliShatt Al-Arab University College2
Jawad AlkenaniShatt Al-Arab University College2
Yuhanis YusofUniversiti Utara Malaysia1

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) http://ijai.iaescore.com/index.php/IJAI/oai, pertama di-harvest 8 Nov 2026, terakhir terlihat 16 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-US">Modified gorilla troops optimization for the quadratic assignment problem</dc:title>
	<dc:creator>Almazini, Hussein Fouad</dc:creator>
	<dc:creator>Mortada, Salah</dc:creator>
	<dc:creator>Al-Mazini, Hassan</dc:creator>
	<dc:subject xml:lang="en-US"></dc:subject>
	<dc:subject xml:lang="en-US">Combinatorial optimization; Gorilla troops optimizer;  Metaheuristic; Optimization; Quadratic assignment problem; Swarm intelligence</dc:subject>
	<dc:description xml:lang="en-US">Balancing exploration and exploitation remain a fundamental challenge in artificial intelligence-based optimization, particularly when addressing discrete combinatorial problems such as the quadratic assignment problem (QAP). The gorilla troops optimizer (GTO), inspired by the collective social behavior of gorillas, has shown promising results in continuous domains but faces limitations when directly applied to discrete optimization. To address this, the present study introduces a modified gorilla troops optimizer (MGTO), a novel discrete adaptation designed specifically for the QAP. The proposed MGTO strategically integrates a swapping-based diversification mechanism to enhance exploration within discrete solution spaces, while a modified uniform crossover operator promotes effective exploitation of high-quality solutions. Extensive experiments on benchmark instances from the quadratic assignment problem library (QAPLIB) show that MGTO achieves superior convergence behavior and solution quality compared with several state-of-the-art algorithms. These results demonstrate MGTO’s capacity to maintain a balanced equilibrium between exploration and exploitation, effectively navigating complex discrete landscapes to yield high-quality solutions with strong computational efficiency.</dc:description>
	<dc:publisher xml:lang="en-US">Institute of Advanced Engineering and Science</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2026-06-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US"></dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ijai.iaescore.com/index.php/IJAI/article/view/28202</dc:identifier>
	<dc:identifier>10.11591/ijai.v15.i3.pp2153-2165</dc:identifier>
	<dc:source xml:lang="en-US">IAES International Journal of Artificial Intelligence (IJ-AI); Vol 15, No 3: June 2026; 2153-2165</dc:source>
	<dc:source>2252-8938</dc:source>
	<dc:source>2089-4872</dc:source>
	<dc:source>10.11591/ijai.v15.i3</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ijai.iaescore.com/index.php/IJAI/article/view/28202/15190</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2026 Hussein Fouad Almazini, Salah Mortada, Hassan Al-Mazini</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>