Thumbnail
Access Restriction
Open

Author Saadouli, Hadhemi ♦ Dammak, Abdelaziz
Source CiteSeerX
Content type Text
File Format PDF
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Routing Problem ♦ Case Study ♦ Course Timetabling ♦ Tunisian University ♦ University Course ♦ Total Distance ♦ Current Software ♦ Real Data ♦ Good Quality ♦ Management Science ♦ Heuristic Algorithm ♦ Obtained Result ♦ Different Building
Abstract In this paper we present a solution for the routing problem related to university course timetabling. We propose a heuristic algorithm that reduces the total distance travelled by each group of student between the different buildings occupying classrooms. This heuristic was tested using real data from the faculty of economic and management sciences of Sfax in Tunisia. The obtained results have confirmed the good quality of the proposed solution when compared with the one generated by the current software.
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study
Learning Resource Type Article
Publisher Date 2012-01-01