Academic Timetable Optimization For Asia Pacific University, Malaysia using Graph Coloring Algorithm
Sireesha Prathi Gadapa1, M. M. Mohamed Ubaidullah2, Rajasegeran Ramasamy3, Raja Rajeswari Ponnusamy4
1Sireesha Prathi Gadapa, School of Mathematics, Accounting and Quantitative Studies, Asia Pacific University, Malaysia.
2M. M. Mohamed Ubaidullah, School of Mathematics, Accounting and Quantitative Studies, Asia Pacific University, Malaysia.
3Rajasegeran Ramasamy, School of Mathematics, Accounting and Quantitative Studies, Asia Pacific University, Malaysia.
4Raja Rajeswari Ponnusamy, School of Mathematics, Accounting and Quantitative Studies, Asia Pacific University, Malaysia.
Manuscript received on 04 February 2019 | Revised Manuscript received on 17 February 2019 | Manuscript Published on 19 February 2019 | PP: 89-94 | Volume-7 Issue-5S January 2019 | Retrieval Number: Es2130017519/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: This paper proposes an optimized solution for timetable scheduling system (TTSS) at Asia Pacific University[APU], Malaysia. TTSS generates the students’ weekly timetable under given set of constraints and preferences such as lecturers, classroom availability, modules etc. Due to various coinciding problems (multiple intakes, various cohorts, academic calendar, increase in student population and limitations of resources), TTSS optimization is vital. This optimization of TTSS is known as Node-Point problem, for which there is no known polynomial algorithm, leads to time consuming problem to find an optimizesolution that grows rapidly with population size. Graph coloring algorithm is a heuristic approach to generate an automated system that will optimize the TTSS to provide a conducive learning environment for students and utilize absolute APU’s resources in an efficient way. The paper propose a user-friendly database system that applies graph vertex coloring approach associating with a data course matrix to overcome the problems of TTSS, APU.
Keywords: Graph Coloring, Timetable Scheduling System, Heuristic Approach, Course Matrix.
Scope of the Article: Cryptography and Applied Mathematics