| dc.contributor | Chiwiacowsky, Leonardo Dagnino | |
| dc.creator | Spindler, Morgana | |
| dc.date.accessioned | 2015-03-05T14:01:22Z | |
| dc.date.accessioned | 2022-09-22T19:05:33Z | |
| dc.date.accessioned | 2023-03-13T19:11:07Z | |
| dc.date.available | 2015-03-05T14:01:22Z | |
| dc.date.available | 2022-09-22T19:05:33Z | |
| dc.date.available | 2023-03-13T19:11:07Z | |
| dc.date.created | 2015-03-05T14:01:22Z | |
| dc.date.created | 2022-09-22T19:05:33Z | |
| dc.date.issued | 2010-02-12 | |
| dc.identifier | https://hdl.handle.net/20.500.12032/56821 | |
| dc.identifier.uri | https://repositorioslatinoamericanos.uchile.cl/handle/2250/6148904 | |
| dc.description.abstract | This paper discusses the use of a populational metaheuristic to solve the optimization problem known in Operational Research, as Curriculum Based Timetabling. The Curriculum
Based Timetabling problem is the construction of schedule of courses in educational institutions that indicate which weekly times each subject of these courses should occur,
allocating rooms and teachers and a respecting a set of organizational, pedagogical and personal requirements. This paper presents a mathematical formulation for the problem
and specify a solution algorithm based on the Scatter Search metaheuristic technique, combined with the method Path Relinking. Furthermore, it is present the record of tests
with instances of problems used in the International Timetabling Competition and also a real problem of a local institution. | |
| dc.publisher | Universidade do Vale do Rio do Sinos | |
| dc.rights | openAccess | |
| dc.subject | busca dispersa | |
| dc.subject | combinatorial optimization | |
| dc.title | Uma proposta de solução para problemas de horário educacional utilizando busca dispersa e reconexão por
caminhos | |
| dc.type | Dissertação | |
