Fish swarm intelligent algorithm for the course timetabling problem

17Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this work, a simulation of fish swarm intelligence has been applied on the course timetabling problem. The proposed algorithm simulates the movements of the fish when searching for food inside a body of water (refer as a search space). The search space is classified based on the visual scope of fishes into three categories which are crowded, not crowded and empty areas. Each fish represents a solution in the solution population. The movement direction of solutions is determined based on a Nelder-Mead simplex algorithm. Two types of local search i.e. a multi decay rate great deluge (where the decay rate is intelligently controlled by the movement direction) and a steepest descent algorithm have been applied to enhance the quality of the solution. The performance of the proposed approach has been tested on a standard course timetabling problem. Computational experiments indicate that our approach produces best known results on a number of these benchmark problems. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Turabieh, H., Abdullah, S., McCollum, B., & McMullan, P. (2010). Fish swarm intelligent algorithm for the course timetabling problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6401 LNAI, pp. 588–595). https://doi.org/10.1007/978-3-642-16248-0_80

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free