Optimization Of University Course Scheduling Problem With A Hybrid Artificial Bee Colony Algorithm
Abstract
Course scheduling problem (CSP) is concerned with developing a timetable that illustrates a number of courses assigned to the classrooms. In this study, a hybrid algorithm composed of a heuristic graph node coloring (GNC) algorithm and artificial bee colo
Collections
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..