|
Furthermore, a selection operator that selects parents based on fitness
and spread of mating pool members is adopted. Having solutions of the
replication problem as chromosomes, the algorithm selects solution for mating
from a set of previously initialized solution set, the chosen solutions mate together
and produce more solutions, the new solutions are added to the solution
set, the solution set is cut to fronts based on comparisons between solutions,
a solution is better than another if it dominates the other solutions. Solution
'A' dominates solution 'B' if solution 'A' is better or equal to solution 'B' in
terms of all criterions, namely, delay, reliability, and consumed storage. For our
system, we care about the first front which contains the set of solutions that
are not dominated by any other solutions. Small network configuration process continues until a specific
number of fitness evaluations are attempted. It can also be set to continuous
execution until a specific time expires or until there is no further improvement.
|