For the KinderUni classes of children at the age of 8-12 can apply for certain courses. The classes are then to be assigned to the single courses with respect to their preferences. The problem is now that usually the capacity of the offered courses can not cover the huge number of applications. To give as much children as possible the chance to take part in the KinderUni the corresponding problem is modelled in terms of a mathematical optimization problem as a multiple knapsack problem. The courses are interpreted as knapsacks and the different classes correspond to the different items to be assigned. The objective function, which is based on the valuation of the classes, is formulated respecting a different weighting for the goals of maximizing the number of pupils, the number of participating schools, and the number of schools participating for the first time ever.
KUniKIP is written in Perl and currently only implemented for the use under the Linux OS. The mathematical computations are done by the programs provided by the ZIB Optimization Suite.
For more information we refer to the website of the KinderUni, the README of KUniKIP, the Diploma thesis of Biliana Boeva and Praktikumsbericht of Gerwin Gamrath.
Biliana Boeva - Veranstaltungsplanung mit Multiple-Knapsack-Methoden (Diploma thesis) (in German)
Gerwin Gamrath - Praktikumsbericht 2013 (in German)
Perl
ZIB Optimization Suite
|
Disclaimer of warranty: No warranty whatsoever is given for the content
of external links.
The content of linked pages is solely the responsibility of the
providers of those pages.
The usage of external pictures is explictely allowed by the holders of their rights. |
Last Update: February 22, 2013
by Ralf Borndörfer |