Melola Discovery

← Melola Discovery

Open access Journal SINTA 1

Timetabling problem solving based on best-nests cuckoo search

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

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

Abstract

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.

Keywords

Collaboration network of the authors

5 authors · 5 co-authorship links · 1 across different organisations

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • University of Technology - Iraq
  • University of Technology
  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Israa MahmoodAffiliation unknown1
Ahmed T. SadiqUniversity of Technology1
Saif Ali Abd Alradha AlsaidiUniversity of Technology - Iraq1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

Metadata source: OpenAlex API (jurnal SINTA, ADR 0048) https://openalex.org/S2765016208, first harvested 19 Nov 2026, last seen 19 Nov 2026.
Original metadata (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>