AN ADAPTIVE LENGTH CHROMOSOME HYPER-HEURISTIC GENETIC ALGORITHM FOR A TRAINER SCHEDULING PROBLEM

摘要

Hyper-GA was introduced by the authors as a genetic algorithm based hyper-heuristic which aims to evolve an ordering of low-level heuristics so as to find a good quality solution for a given problem. The adaptive length chromosome hyper-GA (ALChyper-GA) is an extension of our previous work, in which the chromosome was of fixed length. The aim of a variable length chromosome is two fold; 1) it allows dynamic removal and insertion of heuristics 2) it allows the GA to find a good chromosome length which could otherwise only be found by experimentation. We apply the ALChyper-GA to a trainer scheduling problem and report that good quality solutions can be found. We also present results for four versions of the ALChyper-GA, applied to five test data sets.