Genetic Algorithm Analysis using the Graph Coloring Method for Solving the University Timetable Problem
The Timetable Problem is one of the complex problems faced in any university in the world. It is a highly-constrained combinatorial problem that seeks to find a possible scheduling for the university course offerings. There are many algorithms and approaches adopted to solve this problem, but one of...
Saved in:
| Main Author: | Haraty, Ramzi A. (author) |
|---|---|
| Other Authors: | Assi, Maram (author), Halawi, Bahia (author) |
| Format: | article |
| Published: |
2018
|
| Online Access: | http://hdl.handle.net/10725/10289 https://doi.org/10.1016/j.procs.2018.08.024 http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php https://www.sciencedirect.com/science/article/pii/S1877050918313024 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A method for the minimum coloring problem using genetic algorithms
by: Harmanani, Haidar
Published: (2006) -
Supersaturation problem for color-critical graphs
by: Oleg Pikhurko (23277277)
Published: (2017) -
Graph coloring and the immersion order
by: Abu-Khzam, Faisal N.
Published: (2017) -
Parallel metaheuristic algorithm for exam timetabling
by: Mansour, Nashat
Published: (2010) -
Genetic Algorithm for Solving Site Layout Problem with Unequal-Size and Constrained Facilities
by: Zouein, P. P.
Published: (2002)