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 m
Genetic algorithm with alphabet optimization
✍ Scribed by Gábor J. Tóth; Szabolcs Kovács; András Lörincz
- Publisher
- Springer-Verlag
- Year
- 1995
- Tongue
- English
- Weight
- 863 KB
- Volume
- 73
- Category
- Article
- ISSN
- 0340-1200
No coin nor oath required. For personal study only.
✦ Synopsis
In recent years the genetic algorithm (GA) was used successfully to solve many optimization problems. One of the most difficult questions of applying GA to a particular problem is that of coding. In this paper a scheme is derived to optimize one aspect of the coding in an automatic fashion. This is done by using a high cardinality alphabet and optimizing the meaning of the letters. The scheme is especially well suited in cases where a number of similar problems need to be solved. The use of the scheme is demonstrated with such a group of problems: the simplified problem of navigating a 'robot' in a 'room.' It is shown that for the sample problem family the proposed algorithm is superior to the canonical GA.
📜 SIMILAR VOLUMES
reflections of y18 to y24 dB were observed for cases 1 and 2, and y16 and y20 dB for case 3. Our results indicate that the effect of RF microwave loss of the metal structures for the three cases above is clearly negligible. ## III. CONCLUSION In summary, a TirAurTi structure was found, by compari