ABSTRACT
In contrast to trajectory-based heuristic optimization techniques such as simulated annealing or tabu search, and also in contrast to population-based heuristics which perform parallel local search as for example the conventional variants of evolution strategies (ES without recombination), genetic algorithms and genetic programming operate under fundamentally different assumptions.
