Genetic algorithms and mixed integer linear programs for optimal strategies in a student's 'sports' activity

摘要

This paper uses an entertaining student "sports" game to illustrate that GAs can be adapted to problems with uncertain properties and complexity. These problems can be solved easily through GAs within a few seconds. Contrary to this, using standard MILP techniques does not yield results in a reasonable time.