Constraint satisfaction algorithms: edition of timetables in the license-master-doctorate system
| Auteur | COMLAN, MAURICE | |
| Auteur | ALLOHOUMBO, CORENTIN | |
| Date d'ajout | 2026-06-02T16:06:57Z | |
| Date de disponibilite | 2026-06-02T16:06:57Z | |
| Date de publication | 2023 | |
| Resume | In this paper, we studied some algorithms for solving constraint satisfaction problem (CSP) and then applied them to solve the problem of generating sched- ules in a university setting. In other words, we studied the genetic algorithm, the simulated annealing, the hill climbing, a hybridization of the genetic algorithm and the simulated annealing as well as a hybridization of the genetic algorithm and the hill climbing. These algorithms have been tested on the problem of scheduling in a university environment. The hybrid uses hill climbing or simu- lated annealing to improve each individual in the starting population to a certain stopping point. These individuals are then sent to the genetic algorithm. Our results show that the hybridization of the genetic algorithm with a metaheuristic gives better execution time and performs better as the problem size increases compared to the classical genetic algorithm. | |
| DOI | 10.11591/csit.v4i3.pp217-225 | |
| Autre identifiant | BECDB-13488 | |
| URI | https://dspace.uac.bj/handle/123456789/11550 | |
| Langue | fr | |
| Fait partie de | Computer Science and Information Technologies | |
| Sujet | Constraint satisfaction problem Genetic algorithm License-master-doctorate system Scheduling | |
| Sujet | Simulated annealing | |
| Titre | Constraint satisfaction algorithms: edition of timetables in the license-master-doctorate system | |
| Type | Article |