A Similarity-Based Cellular Selection Mechanism for Genetic algorithms to Solve Assignment Problems

In this paper, the authors illustrate a cellular structure mixed with Genetic Algorithms for solving assignment problems which have more than one feasible or optimum solution. Considering similarity among individuals in population, they use two dimensions Cellular Automata in order to place the individuals onto its cells to make the locality and neighborhood on Hamming distance basis. This new structure and using Genetic Algorithm on it, as 2D Cellular Automata Hamming GA, introduces locality for genetic selection and local knowledge for their selection process on cells of 2D Cellular Automata.

Provided by: International Association of Computer Science & Information Technology (IACSIT) Topic: Software Date Added: Jan 2012 Format: PDF

Find By Topic