A Discrete Bat Algorithm for the Examination Timetabling Problem

Home Page
About
Submit A Journal
Submit A Conference
Submit Paper/Book
- Submit a Preprint
- Submit a Book
Contact

International Journal of Informatics and Applied Mathematics
Volume:4 Issue:2
A Discrete Bat Algorithm for the Examination Timetabling Problem

A Discrete Bat Algorithm for the Examination Timetabling Problem

Authors : Egbert MUJUNİ

Pages : 1-16

View : 19 | Download : 7

Publication Date : 2021-12-31

Article Type : Research Paper

Abstract :Bat Algorithm insert ignore into journalissuearticles values(BA); is one of the newest and promising nature inspired metaheuristics. Introduced by Yang in 2010, BA is a population method which is based on the echolocation characteristics of microbats. The original BA was proposed only for continuous optimization problems. Different approaches that use BA as basis for solving discrete optimization problem have been proposed. In this paper, a discrete bat algorithm version has been developed to solve the examination timetabling problem. Empirical study of the proposed algorithm was carried using data from the University of Dar es Salaam. The proposed algorithm demonstrated higher performance in comparison to a well known metaheuristic, Tabu Seach insert ignore into journalissuearticles values(TS);.
Keywords : Combinatorial Optimizations, Examination Timetabling Problems, Metaheuristics

ORIGINAL ARTICLE URL

VIEW PAPER (PDF)

* There may have been changes in the journal, article,conference, book, preprint etc. informations. Therefore, it would be appropriate to follow the information on the official page of the source. The information here is shared for informational purposes. IAD is not responsible for incorrect or missing information.