Paper Info
Title
A Network Flow Based Construction For A Grasp Plus Sa Algorithm To Solve The University Timetabling Problem
Abstract
Educational timetabling is one of the most researched topics in the field of timetabling. This problem consists of allocating a set of lectures to available rooms and periods, considering students and teachers requests and constraints. Several mathematical models for this problem can be found in the literature. The model considered in this paper is based on courses curricula of a university, proposed in the second International Timetabling Competition (ITC-2007). A maximum flow partial solution is used together with the GRASP constructive algorithm to generate a local solution improved by Simulated Annealing. Computational experiments were performed in ITC-2007 instances, and the results were compared to the best solutions of ITC-2007 and to the literature.
Year
DOI
Venue
2019
10.1007/978-3-030-24302-9_16
COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2019, PT III: 19TH INTERNATIONAL CONFERENCE, SAINT PETERSBURG, RUSSIA, JULY 1-4, 2019, PROCEEDINGS, PART III
Keywords
Field
DocType
University timetabling problem, Hybrid algorithm, Network flow
Flow network,Simulated annealing,Mathematical optimization,Hybrid algorithm,GRASP,Computer science,Maximum flow problem,Mathematical model,Timetabling problem,Constructive algorithms
Conference
Volume
ISSN
Citations 
11621
0302-9743
0
PageRank 
References 
Authors
0.34
0
4
Name
Order
Citations
PageRank
Edmar Hell Kampke100.34
Leonardo Moreli Scheideger200.34
Geraldo Regis Mauri3888.79
Maria Cláudia Silva Boeres400.34