Essays about: "timetabling"
Showing result 11 - 15 of 29 essays containing the word timetabling.
-
11. Comparing MAX-MIN and Rank-based Ant Colony Optimization Algorithms for solving the University Course Timetabling Problem
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : The University Course Timetabling Problem (UCTP) is a scheduling problem regarding courses, time slots and rooms, and is often accompanied by a set of feature requirements. As non-trivial instances of the UCTP are NP-hard, traditional computational methods are ineffective. READ MORE
-
12. Algorithm for inserting a single train in an existing timetable
University essay from Linköpings universitet/Kommunikations- och transportsystem; Linköpings universitet/Tekniska högskolanAbstract : The purpose with this report is to develop a network based insertion algorithm and evaluate it on a real-case timetable. The aim of the algorithm is to minimize the effect that that train implementation cause on the other, already scheduled traffic. READ MORE
-
13. A comparative study between a simulated annealing and a genetic algorithm for solving a university timetabling problem
University essay from KTH/Skolan för datavetenskap och kommunikation (CSC)Abstract : The university timetabling problem is an NP-complete problem which schools all over the world face every semester. The aim of the problem is to schedule sets of events such as lectures and seminars into certain time slots without violating numerous specified constraints. READ MORE
-
14. Stillestånd för rundvirkesbilar utan kran : en studie i effekter och orsaker till icke-värdeskapande tid
University essay from SLU/Dept. of Forest ProductsAbstract : Bakgrund: Lönsamheten för rundvirkestransportörer är låg och konkurrensen är hård. Åkerierna drivs mellan prispress från skogsbolagen och minskad efterfrågan från industrierna. READ MORE
-
15. Solving the Train Timetabling Problem by using Rapid Branching
University essay from KTH/Optimeringslära och systemteoriAbstract : The topic of this thesis is the implementation of rapid branching to find an integer solution for the train timetabling problem. The techniques that rapid branching are based on are presented. The important aspect of rapid branching are discussed and then the algorithm is applied to some artificial problems. READ MORE