Genetic-annealing Phase ,

(a) Determine, stringlett^tBMd coding scheme

. for the solution
|p) Initialise population
(c) Evaluate population
(d) Repeat
* Apply reproduction operator
* Apply crossover operator
* Apply mutation operator
* Check for constraint satisfaction
* Evaluate population
(e) Until (termination condition)
Simulated-annealing Phase
(f) Select the best solution amongst the population
given by last genetic pass as initial start
point !
(g) Start with the best solution vector and estimate
the fitness (objective function)
(h), Repeat
, Generate a new solution in the neighbourhood
and estimate its fitness
Use an appropriate criterion for acceptance
of a new move
If the new move is accepted, make it
the current move, else accept this new
solution as current with a probability
min (1, exp (-$f/T)) -
(i) Until (maximum number of solutions to be
considered for each iteration are performed)
(j) Reduce the temperature using a cooling
schedule
(k) Repeat the steps (h)!to,(j) until appropriate
stopping criteria is satisfied

hybridization refers to the inclusion of problem-dependent knowledge in a general

search algorithm. More precisely, two major hybridization models are distinguished:
strong hybridization and weak hybridization.

Strong hybrids: algorithms in which knowledge has been included as specific

non-conventional problem representations and/or operators.
Weak hybrids: algorithms resulting from the combination of lower-lever
hybrid algorithms
While the GA allow to move to good regions of the search space, the SA allow to explore in
an exhaustive way those regions of the search space.

In each hybrid have been developed several versions of hybridization:

Version 1: The SA algorithm is used as genetic operator of the GA.

Version 2 and Version 3: The second hybrid schema executes a GA until the algorithm
completely finishes. Then the hybrid selects some individuals from the final population and
executes a SA algorithm over them. Concretely, it exists a first version (newGASA2) that uses
a tournament selection, and another version (newGASA3) that uses a random choice of
individuals.