Authors: Nigel Gwee
We apply the concept behind Genetic Algorithms to solve the dance choreography problem, and compare our implementation’s performance with that of other optimal and sub-optimal methods. Parameters such as population size, and crossover and mutation rates are considered and adjusted. Timings, average ratings, and standard deviation of results are measured with respect to amalgamation length and figures selected. Results indicate the feasibility, and limitations, of Genetic Algorithms in this domain.
Keywords: genetic algorithms; dance choreography; exhaustive search; sub-optimal algorithm