Graph-Based Course Scheduling Using the Malatya Vertex Coloring Algorithm for Constraint Optimization

Cezayir Karaca; Selman Yakut

Makale detayları

Graph-Based Course Scheduling Using the Malatya Vertex Coloring Algorithm for Constraint Optimization

Yazarlar:

Cezayir Karaca | Selman Yakut

Yayıncı:

Bingol University

Ana Başlıklar:

Bilgi Sistemleri (Diğer)

Dergi:

Türk Doğa ve Fen Dergisi Vol.14 Issue 3, pp.46-56

Belge Tipi:

Makale

Yayın Tarihi:

9/2025

Belge Dili:

İngilizce

Document ID (Org No.):

2001359135

pISSN:

2149-6366

Anahtar kelimeler:

Özet:

 The course timetabling problem is a significant combinatorial optimization problem that has attracted the attention of researchers since the second half of the 20th century. Traditionally managed through manual methods, the scheduling process is time-consuming, challenging, and prone to errors. Therefore, with technological advancements, various algorithms have been developed to offer more efficient and faster solutions. In this study, the MVC Algorithm is applied to the course timetabling problem. The algorithm operates in two main steps: first, the Malatya CentralityMC values of the nodes in the timetable graph are calculated; then, the node with the highest centrality is selected and labeled with an appropriate color. Throughout the process, the main objective is to minimize course conflicts and to generate a valid timetable that complies with defined constraints. The MVC Algorithm stands out with its predictability of procedural steps and its potential to operate in polynomial time, thus offering an effective alternative to classical and heuristic methods proposed in the literature.

 The course timetabling problem is a significant combinatorial optimization problem that has attracted the attention of researchers since the second half of the 20th century. Traditionally managed through manual methods, the scheduling process is time-consuming, challenging, and prone to errors. Therefore, with technological advancements, various algorithms have been developed to offer more efficient and faster solutions. In this study, the MVC Algorithm is applied to the course timetabling problem. The algorithm operates in two main steps: first, the Malatya CentralityMC values of the nodes in the timetable graph are calculated; then, the node with the highest centrality is selected and labeled with an appropriate color. Throughout the process, the main objective is to minimize course conflicts and to generate a valid timetable that complies with defined constraints. The MVC Algorithm stands out with its predictability of procedural steps and its potential to operate in polynomial time, thus offering an effective alternative to classical and heuristic methods proposed in the literature.

 The course timetabling problem is a significant combinatorial optimization problem that has attracted the attention of researchers since the second half of the 20th century. Traditionally managed through manual methods, the scheduling process is time-consuming, challenging, and prone to errors. Therefore, with technological advancements, various algorithms have been developed to offer more efficient and faster solutions. In this study, the MVC Algorithm is applied to the course timetabling problem. The algorithm operates in two main steps: first, the Malatya CentralityMC values of the nodes in the timetable graph are calculated; then, the node with the highest centrality is selected and labeled with an appropriate color. Throughout the process, the main objective is to minimize course conflicts and to generate a valid timetable that complies with defined constraints. The MVC Algorithm stands out with its predictability of procedural steps and its potential to operate in polynomial time, thus offering an effective alternative to classical and heuristic methods proposed in the literature.

 Ders çizelgeleme problemi, 20. yüzyılın ikinci yarısından itibaren araştırmacıların dikkatini çeken önemli bir kombinatoryal optimizasyon problemidir. Geleneksel olarak manuel yöntemlerle yürütülen çizelgeleme süreci, zaman alıcı ve zorlayıcı olmakla birlikte hata yapmaya açık bir yapıdadır. Bu nedenle, teknolojik ilerlemelerle birlikte çeşitli algoritmalar geliştirilerek daha etkili ve hızlı çözümler sunulmaya çalışılmıştır. Bu çalışmada, Malatya Vertex ColoringMVC Algoritması ders çizelgeleme problemine uygulanmaktadır. Algoritma, iki temel adımda çalışmaktadır: ilk olarak, çizelge grafındaki düğümlerin Malatya Merkezilik değerleri hesaplanmakta; ardından en yüksek merkeziliğe sahip düğüm seçilerek uygun bir renkle etiketlenmektedir. Süreç boyunca temel hedef, ders çakışmalarını en aza indirmek ve tanımlı kısıtlamalara uyumlu, geçerli bir çizelge üretmektir. MVC Algoritması, işlem adımlarının öngörülebilirliği ve polinom zamanda çalışabilme potansiyeliyle dikkat çekmekte, bu yönüyle literatürde önerilen klasik ve sezgisel yöntemlere etkili bir alternatif sunmaktadır.

Makale detayları

Graph-Based Course Scheduling Using the Malatya Vertex Coloring Algorithm for Constraint Optimization

Yazarlar:

Cezayir Karaca | Selman Yakut

Yayıncı:

Bingol University

Ana Başlıklar:

Bilgi Sistemleri (Diğer)

Dergi:

Türk Doğa ve Fen Dergisi Vol.14 Issue 3, pp.46-56

Belge Tipi:

Makale

Yayın Tarihi:

9/2025

Belge Dili:

İngilizce

Document ID (Org No.):

2001359135

pISSN:

2149-6366

Course Scheduling

Centrality

Malatya Coloring

TimetablingCourse Scheduling

Centrality

Malatya Coloring

Timetabling

Sayı

Makale detayları

Yazarlar: Cezayir Karaca | Selman Yakut

Yayıncı: Bingol University

Ana Başlıklar: Bilgi Sistemleri (Diğer)

Dergi: Türk Doğa ve Fen Dergisi Vol.14 Issue 3, pp.46-56

Belge Tipi: Makale

Yayın Tarihi: 9/2025

Belge Dili: İngilizce

Document ID (Org No.): 2001359135

pISSN: 2149-6366

Sayı

Yazarlar:

Cezayir Karaca | Selman Yakut

Yayıncı:

Bingol University

Ana Başlıklar:

Bilgi Sistemleri (Diğer)

Dergi:

Türk Doğa ve Fen Dergisi Vol.14 Issue 3, pp.46-56

Belge Tipi:

Makale

Yayın Tarihi:

9/2025

Belge Dili:

İngilizce

Document ID (Org No.):

2001359135

pISSN:

2149-6366