A Parallel Genetic Algorithm to Solve Scheduling the University Class Problem
This paper describes the development and implementation of a parallel genetic algorithm (GA) to solve scheduling the university class problem. The proposed GA is based on the "farmer-workers" model and uses a number of heuristics, e. g. classroom and time selection during populatio...
Saved in:
| Date: | 2017 |
|---|---|
| Main Authors: | , , |
| Format: | Article |
| Language: | Ukrainian |
| Published: |
PROBLEMS IN PROGRAMMING
2017
|
| Subjects: | |
| Online Access: | https://pp.isofts.kiev.ua/index.php/ojs1/article/view/140 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Problems in programming |
| Download file: |  |
Institution
Problems in programming| Summary: | This paper describes the development and implementation of a parallel genetic algorithm (GA) to solve scheduling the university class problem. The proposed GA is based on the "farmer-workers" model and uses a number of heuristics, e. g. classroom and time selection during population initialization, adding useful subsolutions into the initial population, using special (new) mutation operator. In the algorithm a specific chromosome coding and fitness function that takes into account a number of restrictions on the resulting schedule are proposed. Problem-specific crossover and mutation operators are developed. Based on a number of computational experiments optimal parameters of GA are proposed for further use. |
|---|