Solving Timetable Scheduling Problems Using Genetic Algorithm
Deeba Kannan1, Kuntal Bajpayee2, Samriddho Roy3
1Deeba Kannan, SRM IST, Chennai (Tamil Nadu), India.
2Kuntal Bajpayee, SRM IST, Chennai (Tamil Nadu), India.
3Samriddho Roy, SRM IST, Chennai (Tamil Nadu), India.
Manuscript received on 10 February 2019 | Revised Manuscript received on 06 April 2019 | Manuscript Published on 28 April 2019 | PP: 168-170 | Volume-7 Issue-5C February 2019 | Retrieval Number: E10410275C19/19©BEIESP
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: There are various methods to solve the timetable scheduling problem and preventing various slots from clashing like the ant colony optimization problem which by result is a very time consuming process and other approach includes heuristic approach where problem can be solved by using trial and error method or by using a multi dimensional matrix which again may or may not give the optimal solution .The most important factor which should be taken in consideration is that it’s a NP hard problem which means there is not any best solution to this problem so ,by considering all the above factors it is found that Genetic Algorithm (GA) is the best approach to such problem where the main algorithm goal is to minimize the number of conflicts in the timetable and reduction to encoding of search space.
Keywords: Scheduling, Genetic Algorithm, NP Hard.
Scope of the Article: Algorithm Engineering