Evolution Strategies, Random Network Keys, and the One-Max Tree Problem

Evolution strategies (ES) are efficient optimization methods for continuous problems. However, many combinatorial optimization methods can not be represented by using continuous representations. The development of the network random key representation (Rothlauf et al., 2001) which represents trees by using real numbers allows one to use ES for combinatorial tree problems.[...]

MoreLess

Year of publication:	2001-11-15
Authors:	Schindler, Barbara ; Rothlauf, Franz
Institutions:	Universität <Mainz> / Lehrstuhl für Wirtschaftsinformatik und BWL
Subject:	Netzwerk \| Optimierung \| Nonsmooth optimization \| Evolutionsstrategie \| Kombinatorik

Check Google Scholar |

More access options

In German libraries (KVK)

I need help

1 Introduction
2 Network Random Keys
3 The One-Max Tree Problem
4 Performance of Evolution strategies and Adjustment of Parmeters
4.1 A Short Introduction into Evolution Strategies
4.2 Adjustment of Parameters
4.3 A Comparison to Genetic Algorithms for the One-Max Problem
5 Conclusions
References

Persistent link: https://www.econbiz.de/10005868204