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
- ISSN
- 2089-3191, 2302-9285
- Terbit
- 2021-12-01
- Penerbit
- Institute of Advanced Engineering and Science (IAES)
- Bahasa
- en
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 penulis | Organisasi | Artikel bersama |
|---|---|---|
| Israa Mahmood | Afiliasi tidak diketahui | 1 |
| Ahmed T. Sadiq | University of Technology | 1 |
| Saif Ali Abd Alradha Alsaidi | University of Technology - Iraq | 1 |
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.