Applying a genetic algorithm to the quadratic assignment problem in C#
Some sample C# code on how a genetic algorithm can be applied to the quadratic assignment problem. The quadratic assignment problem (QAP) is a combinatorial optimization problem that models the following real-life problem: Given a set of n facilities and a set of n locations, specify a distance for each pair of locations and a …
Continue reading ‘Applying a genetic algorithm to the quadratic assignment problem in C#’ »