Solving the University course timetabling problem using bat inspired algorithm
Article published by the Tanzania Journal of Science Vol. 47 No. 2 (2021)
Saved in:
Main Authors: | , , |
---|---|
格式: | 文件 |
语言: | 英语 |
出版: |
Tanzania Journal of Science
2024
|
主题: | |
在线阅读: | https://doi.org/10.4314/tjs.v47i2.23 https://scholar.mzumbe.ac.tz/handle/123456789/619 |
标签: |
添加标签
没有标签, 成为第一个标记此记录!
|
_version_ | 1820347763701841920 |
---|---|
author | Limota, Ushindi Mujuni, Egbert Mushi, Allen R. |
author_facet | Limota, Ushindi Mujuni, Egbert Mushi, Allen R. |
author_sort | Limota, Ushindi |
collection | DSpace |
description | Article published by the Tanzania Journal of Science Vol. 47 No. 2 (2021) |
format | Article |
id | oai:41.59.85.69:123456789-619 |
institution | Mzumbe University |
language | English |
publishDate | 2024 |
publisher | Tanzania Journal of Science |
record_format | dspace |
spelling | oai:41.59.85.69:123456789-6192024-04-16T05:57:20Z Solving the University course timetabling problem using bat inspired algorithm Limota, Ushindi Mujuni, Egbert Mushi, Allen R. Combinatorial optimization Timetabling problem Metaheuristic algorithms Bat algorithm. Article published by the Tanzania Journal of Science Vol. 47 No. 2 (2021) Many mathematical optimization problems from real-life applications are NP-hard, and hence no algorithm that solves them to optimality within a reasonable time is known. For this reason, metaheuristic methods are mostly preferred when their size is big. Many meta-heuristic methods have been proposed to solve various combinatorial optimization problems. One of the newly introduced metaheuristic methods is a bat-inspired algorithm, which is based on the echolocation behaviour of microbats. Bat algorithm (BA) and its variants have been used successfully to solve several optimization problems. However, from the No-free Lunch Theorem, it is known that there is no universal metaheuristic method that can solve efficiently all optimization problems. Thus, this study work focused on investigating the usefulness of BA in solving an optimization problem called Course Teaching Problem (CTP). Since BA was originally designed to solve continuous problems, and CTP is a combinatorial optimization problem, a discrete version of BA for CPT has been proposed and tested using real-life data from the Dar es Salaam University College of Education (DUCE). The algorithm has produced promising results, as in each execution test, it generated a timetable in which all hard constraints were met and soft constraints were significantly satisfied within a few iterations. Private 2024-04-16T05:57:17Z 2024-04-16T05:57:17Z 2021 Article APA https://doi.org/10.4314/tjs.v47i2.23 https://scholar.mzumbe.ac.tz/handle/123456789/619 en application/pdf Tanzania Journal of Science |
spellingShingle | Combinatorial optimization Timetabling problem Metaheuristic algorithms Bat algorithm. Limota, Ushindi Mujuni, Egbert Mushi, Allen R. Solving the University course timetabling problem using bat inspired algorithm |
title | Solving the University course timetabling problem using bat inspired algorithm |
title_full | Solving the University course timetabling problem using bat inspired algorithm |
title_fullStr | Solving the University course timetabling problem using bat inspired algorithm |
title_full_unstemmed | Solving the University course timetabling problem using bat inspired algorithm |
title_short | Solving the University course timetabling problem using bat inspired algorithm |
title_sort | solving the university course timetabling problem using bat inspired algorithm |
topic | Combinatorial optimization Timetabling problem Metaheuristic algorithms Bat algorithm. |
url | https://doi.org/10.4314/tjs.v47i2.23 https://scholar.mzumbe.ac.tz/handle/123456789/619 |
work_keys_str_mv | AT limotaushindi solvingtheuniversitycoursetimetablingproblemusingbatinspiredalgorithm AT mujuniegbert solvingtheuniversitycoursetimetablingproblemusingbatinspiredalgorithm AT mushiallenr solvingtheuniversitycoursetimetablingproblemusingbatinspiredalgorithm |