ABSTRACT
To quote Knuth (1973), ‘A permutation of a finite set is an arrangement of its elements into a row.’ Given n unique objects, n! permutations of the objects exist. There are various properties of permutations that are relevant to the manipulation of permutation representations by evolutionary algorithms, both from a representation point of view and from an analytical perspective.
