Theoretical Foundations of Order-Based Genetic Algorithms

Jakub Wróblewski · Fundamenta Informaticae · 1996

A lot of research on genetic algorithms theory is concentrated on classical, binary case. However, there are many other types of useful genetic algorithms (GA), e.g. tree-based (genetic programming), or order-based ones. This paper shows, that many o

Read the paper · More papers on PaperTik