University-timetabling problem and its solution using GELS algorithm: a case study
by Majid Nikougoftar Nategh; Ali Asghar Rahmani Hosseinabadi; Valentina Emilia Balas
International Journal of Advanced Intelligence Paradigms (IJAIP), Vol. 11, No. 3/4, 2018

Abstract: Course scheduling includes a large volume of data with numerous constraints and unchangeable specifications and each university deals with several times a year. Course scheduling is a NP-hard problem and using traditional methods to solve it is very difficult. But evolutionary algorithms suggest good solutions for this type of problems. In this paper we used gravitational emulation local search algorithm to solve the course scheduling problem which is an evolutionary algorithm. Results demonstrate the good quality of time table provided by the proposed algorithm and also decreased time against other algorithms.

Online publication date: Mon, 08-Oct-2018

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Advanced Intelligence Paradigms (IJAIP):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com