Modeling Permutations for Genetic Algorithms
Pavel Krömer, Jan Platoš, Václav Snåšel · 2009
Combinatorial optimization problems form a class of appealing theoretical and practical problems attractive for their complexity and known hardness. They are often NP-hard and as such not solvable by exact methods. Combinatorial optimization problems are subject to numerous heuristic and metaheuristic algorithms, including genetic algorithms. In this paper, we present two new permutation encodings for genetic algorithms and experimentally evaluate the influence of the encodings on the performance and result of genetic algorithm on two synthetic and real-world optimization problems.