Optimization of a Two-Echelon Location Lot-Sizing Routing Problem with Deterministic Demand

Algorithm 6

The overall hybrid genetic algorithm.

Procedure: HybridGeneticAlgorithm

Input: Problem Data

Output: Best solution  

Generate initial population    using InitialSol

procedure and random chromosomes

while    do

Select parents    and    using binary tournament

from  

Cross    and    to obtain child  

Repair using Chromrepair procedure

if    then

Repeat selection and crossover

else

Apply LocalSearch Procedure to with a

probability    to obtain  

end if

if    then

  replaces the worst solution in  

end if

end while

Return the best sol    in