Development of an Automated Examination Seating Arrangement Generation System Using Music Inspired Harmony Search Algorithm
This paper addresses the solution of examination seating arrangement problem using the metaheuristic music inspired Harmony Search algorithm. The objective function has been defined keeping the constraints of the problem in mind. The algorithm has been modified to suit the needs of the problem at hand, keeping the basic structure unchanged. The results obtained show an optimized seating arrangement, where none of the students appearing for the same subject have been allotted adjacent seats.
KeywordsHarmony Search Soft Constraint Hard Constraint Harmony Search Algorithm Timetabling Problem
Unable to display preview. Download preview PDF.
- 1.Geem, Z.W., Kim, J.H., Loganathan, G.V.: A New Heuristic Optimization Algorithm: Harmony Search. SIMULATON (2001), doi: 10.1177/003754970107600201Google Scholar
- 2.Geem, Z.W. (ed.): Music-Inspired Harmony Search Algorithm. Springer, Heidelberg (2009)Google Scholar
- 6.Mohammed, A.A.-B., Khader, A.T., Gani, T.A.: A harmony search algorithm for university course timetabling. In: Mohammed, A.A.-B., Khader, A.T. (eds.) Annals of Operations Research, pp. 1–29. Springer, Netherlands (2010)Google Scholar