These are cell-number mutation operator (SM1), machine-number mutation operator (SM2), machine-inter-cell mutation operator (SM3), machine-intra-cell mutation operator (SM4), machine-location mutation operator (SM5), route-volume mutation operator (SM6) and part-operation mutation operator (SM7).
The part-operation mutation operator (SM7) changes the matrix P _ L _ O p _ Q P, L, O p, t by selecting an operation of a part and changing the machine assigned to process that operation.
In this paper, domain-dependent heuristics are encoded into crossover operations, mutations of genetic algorithm (GA) to solve this problem.
The edit distance relies on the alignment between two strings of (potentially) different length; its definition is based on dynamic programming [ Jones and Pevzner, 2004] and reflects the minimum number of editing operations (mutations, insertions and deletions) needed to transform one string into another.
There are mainly five components in GA: the random number generator, fitness evaluation, reproduction operation, crossover operation, and mutation operation.
After the crossover operation, mutation is performed to maintain the diversity of solution space and to avoid getting stuck at a local optimum.
On the other hand, the operation mutation perturbs the steady state of each chromosome by randomly toggling very few bits to evolve into new child chromosomes.
The central idea of evolutionary game algorithm [14] includes "choice" operation and "mutation" operation.
In order to maintain the population diversity and avoid premature convergence, on the basis of the dissimilarity coefficient, the adaptive genetic strategy that allows the algorithm dynamically select crossover operation or mutation operation to execute is proposed.
