Genetic algorithm with local optimization

✍ Scribed by Károly F. Pál

• Publisher: Springer-Verlag
• Year: 1995
• Tongue: English
• Weight: 843 KB
• Volume: 73
• Category: Article
• ISSN: 0340-1200
• DOI: 10.1007/bf00199469

✦ Synopsis

A hybrid of genetic algorithm and local optimization was tested on a massively multimodal spin-lattice problem involving a huge configuration space. The resuits are good, and global optima will probably be achieved in a sizeable proportion of cases, especially if a selection scheme is applied that maintains genetic diversity by introducing a spatial separation between the members of the population. If we use single-point crossover, the performance of the algorithm depends strongly on the order of the units corresponding to individual spins in the bit strings that the genetic part of the algorithm processes. Due to some interplay between the genetic algorithm and local optimization, the best performance is achieved with a peculiar ordering, while the results with the most obvious ordering are much worse. I introduce an ordering-invariant crossover operation that gives excellent performance: it almost always yields states of the lowest energy. I expect this or some similar crossover operation to work well in the hybrid scheme for many other problems as well.