ePrints.FRI - University of Ljubljana, Faculty of Computer and Information Science

Parallelization of an evolutionary algorithm for scheduling with complex constraints

Sašo Stanovnik (2015) Parallelization of an evolutionary algorithm for scheduling with complex constraints. EngD thesis.

Download (750Kb)


    The focus of our work is on the problem of generating a timetable using a parallel evolutionary algorithm. We explore commonly used scheduling methods and determine their suitability for cases with complex constraints, then select a parallelization scheme most suitable for efficient computation. Furthermore, we choose a data representation that best complements genetic operators and the fitness function, which covers a wide range of complex constraints. We implement and parallelize an extensible algorithm for computing solutions to our problem. A method of minimizing the space complexity of the problem by efficiently dividing data between processes is also described. We analyse the properties of our solution through a thorough analysis of run times and memory consumptions coupled with a theoretical analysis of the results.

    Item Type: Thesis (EngD thesis)
    Keywords: evolutionary algorithm, parallelization, MPI, timetable
    Number of Pages: 43
    Language of Content: Slovenian
    Mentor / Comentors:
    Name and SurnameIDFunction
    izr. prof. dr. Uroš Lotrič270Mentor
    Link to COBISS: http://www.cobiss.si/scripts/cobiss?command=search&base=51012&select=(ID=1536530883 )
    Institution: University of Ljubljana
    Department: Faculty of Computer and Information Science
    Item ID: 3097
    Date Deposited: 14 Sep 2015 14:17
    Last Modified: 01 Oct 2015 13:53
    URI: http://eprints.fri.uni-lj.si/id/eprint/3097

    Actions (login required)

    View Item