Method of generating precedence-preserving crossover and mutation operations in genetic algorithms

摘要

A method for generating precedence-preserving crossover and mutations operations for genetic algorithms is provided. The method is based on the determination of activities' Forward Free Float (FFF) and Backward Free Float (BFF) values, utilizing these float values in randomly selected forward and backward paths, respectively. The method may be applied to the finance-based scheduling domain using large scale projects, with the chromosomes of the genetic algorithm encoding activities' start times in a resource-constrained scheduling problem.