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
URI
https://www.scopus.com/inward/record.uri?eid=2-s2.0-80052020907&doi=10.1109%2fCEC.2011.5949638&partnerID=40&md5=835c13c49fef9871087ecc445078eed5https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/10614
Collections
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..