A New Greedy Algorithm for the Curriculum-based Course Timetabling Problem

A New Greedy Algorithm for the Curriculum-based Course Timetabling Problem

This study describes a novel greedy algorithm for optimizing the well-known Curriculum-Based Course Timetabling (CB-CTT) problem. Greedy algorithms are a good alternative to brute-force and evolutionary algorithms, which take a long time to execute in order to find the best solution. Rather than emp...

Full description

Bibliographic Details
Main Authors: Batuhan Mustafa Coşar, Bilge Say, Tansel Dökeroğlu
Format: Article
Language:English
Published: Düzce University 2023-04-01
Series:Düzce Üniversitesi Bilim ve Teknoloji Dergisi
Subjects:
course-timetabling
greedy algorithms
heuristics
optimization
ders zaman çizelgesi oluşturma
açgözlü algoritmalar
buluşsal yöntemler
eniyileme
Online Access:https://dergipark.org.tr/tr/download/article-file/2415049

Internet

https://dergipark.org.tr/tr/download/article-file/2415049

Similar Items