Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 1

Timetabling problem solving based on best-nests cuckoo search

Bulletin of Electrical Engineering and Informatics · Vol. 10 No. 6 (2021) · hlm. 3333–3340

DOI
10.11591/eei.v10i6.3206
ISSN
2089-3191, 2302-9285
Terbit
2021-12-01
Penerbit
Institute of Advanced Engineering and Science (IAES)
Bahasa
en
Lisensi
creativecommons.org/licenses/by-sa/4.0/

Abstrak

The university courses timetabling problem (UCTP) is a popular subject among institutions and academics because occurs every academic year. In general, UCTP is the distribution of events through slots time for each room based on the list of constraints for instance (hard constraint and soft constraint) supplied in one semester, intending to avoid conflicts in such assignments. Under no circumstances should hard constraints be broken while attempting to fulfill as many soft constraints as feasible. this article presented a modified best-nests cuckoo search (BNCS) algorithm depend on the base cuckoo search (CS) algorithm. BNSC algorithm was achieved by dividing the nests into two groups (best-nests and normal-nests). The BNCS algorithm selection was limited to the best-nests to generate new solutions. The comparison between BNCS and basic CS based on the experimental result is achieved. For performance evaluation, the BNCS has been tested on four variant-size datasets. It was observed that the BNCS has performed high performance and is faster at finding a solution from CS.

Kata kunci

Jaringan kolaborasi para penulis

5 penulis · 5 tautan kepenulisan bersama · 1 lintas organisasi

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

  • University of Technology - Iraq
  • University of Technology
  • 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
Israa MahmoodAfiliasi tidak diketahui1
Ahmed T. SadiqUniversity of Technology1
Saif Ali Abd Alradha AlsaidiUniversity of Technology - Iraq1

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: OpenAlex API (jurnal SINTA, ADR 0048) https://openalex.org/S2765016208, pertama di-harvest 19 Nov 2026, terakhir terlihat 19 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"><dc:title xml:lang="en">Timetabling problem solving based on best-nests cuckoo search</dc:title><dc:creator>Mohammed A. Jebur</dc:creator><dc:creator>Hasanen Samir Abdullah</dc:creator><dc:subject>university course timetabling</dc:subject><dc:subject>cuckoo search algorithm</dc:subject><dc:subject>metaheuristic optimization</dc:subject><dc:subject>hard and soft constraints</dc:subject><dc:subject>room assignment</dc:subject><dc:subject>combinatorial optimization</dc:subject><dc:description xml:lang="en">The university courses timetabling problem (UCTP) is a popular subject among institutions and academics because occurs every academic year. In general, UCTP is the distribution of events through slots time for each room based on the list of constraints for instance (hard constraint and soft constraint) supplied in one semester, intending to avoid conflicts in such assignments. Under no circumstances should hard constraints be broken while attempting to fulfill as many soft constraints as feasible. this article presented a modified best-nests cuckoo search (BNCS) algorithm depend on the base cuckoo search (CS) algorithm. BNSC algorithm was achieved by dividing the nests into two groups (best-nests and normal-nests). The BNCS algorithm selection was limited to the best-nests to generate new solutions. The comparison between BNCS and basic CS based on the experimental result is achieved. For performance evaluation, the BNCS has been tested on four variant-size datasets. It was observed that the BNCS has performed high performance and is faster at finding a solution from CS.</dc:description><dc:publisher>Institute of Advanced Engineering and Science (IAES)</dc:publisher><dc:date>2021-12-01</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:format>application/pdf</dc:format><dc:identifier>https://doi.org/10.11591/eei.v10i6.3206</dc:identifier><dc:identifier>10.11591/eei.v10i6.3206</dc:identifier><dc:source>Bulletin of Electrical Engineering and Informatics; Vol 10 No 6 (2021); 3333-3340</dc:source><dc:source>2089-3191</dc:source><dc:source>2302-9285</dc:source><dc:language>en</dc:language><dc:relation>https://beei.org/index.php/EEI/article/download/3206/2373</dc:relation><dc:rights>https://creativecommons.org/licenses/by-sa/4.0/</dc:rights></oai_dc:dc>