OMEGA - Ordering Messy GA: Solving Permutation Problems with the Fast Messy Genetic Algorithm and Random Keys

摘要

This paper presents an ordering messy genetic algorithm (OmeGA) that is able to solve difficult permutation problems efficiently. It is essentially a fast messy genetic algorithm (fmGA) using random keys to reprresent chromosomes. Experimental results that show the random key-based simple genetic algorithm (RKGA) being outperformed by its messy competitor in 32-length ordering deceptive problems are presented.