Investigating discrete optimization by population based approaches

OData support
Dr. Kóczy László Tamás
Department of Telecommunications and Media Informatics

In my thesis one of the main task was to create a platform, which capable to create, load and save problems related to timetable schedules of courses and run tests on these problems with different algorithms. The other main task was to do bibliographical research particularly in the subject of discrete optimization by population based approaches.

I designed an environment based on the definition of the problem and the different approaches. I chose five approach and implemented the basic and the advanced versions of them. These approaches are the followings: Depth-first search, Genetic algorithm, Bacterial algorithm, Imperialist competitive algorithm and one algorithm based on my ideas.

The platform was implemented in Java language, and all the functions are available from command-line. In my thesis I show how the different approaches work, the structure of the program and the result of the approaches tested on problems used by international timetable competition and on generated problems.


Please sign in to download the files of this thesis.