Genetic algorithm for finding the nucleolus of assignment games

This paper describes a heuristic approach to finding the nucleolus of assignment games using genetic algorithms. The method consists of three steps, as follow. The first step is to maintain a set of possible solutions of the core, called population. With the concept of nucleolus, the lexicographic order is the function of fitness. The second step is to improve the population, by a cyclic three-stage process consisting of a reproduction (selection), recombination (mating), and evaluation (survival of the fittest). Each cycle is called a generation. Generation by generation, the selected population will Be a set of vectors with the higher fitness values. A mutation operator changes individuals that may lead to a high fitness region by performing an alternative search path. The last step is to terminate the loop by setting an acceptable condition. The highest fitness individual presents the nucleolus. The discussion includes an outline of the processing pseudocode.