Contents

Foreword

1 Searching for more solutions

1.1 Parallel search for more solutions

1.1.1 Parent selection based methods

1.1.2 Forming new generation based methods

1.2 Sequential search for more solutions

1.3 Comparison of parallel search methods for more solutions

2 Solving multi-criteria problems

2.1 Synthetic fitness formation methods

2.1.1 Fitness aggregation

2.1.2 Fitness based sorting

2.1.3 Dominance based fitness

2.2 Methods using fitness vector

2.3 Algorithm structure enrichment

2.4 Comparison of methods for multi-criteria problems

3 Solving non-stationary problems

3.1 Diversity generating and maintaining

3.1.1 Diversity support using mutation

3.1.2 Diversity support using selection

3.2 Using memory

3.2.1 Algorithms with explicit memory

3.2.2 Algorithms with implicit memory

3.2.2.1 Dominant-recessive diploids

3.2.2.2 Additive diploids

3.3 Comparison of methods for non-stationary problems

4 Solving problems with constraints

4.1 Searching in feasible region

4.1.1 Penalty functions

4.1.2 Decoders

4.1.3 Repair procedures

4.1.4 Constraint preserving operators

4.2 Searching on the edge of feasible region

4.3 Comparison of methods for problems with constraints

Mathematical symbols

References

Index