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

Algorithm 4

Chromosome repairing procedure.

Procedure: Chromrepair

Input: A chromosome

Output: Valid chromosome

Find  , if it fails, find the first closed depot

  and  

for each  

if    then

repeat

last customer assigned to

if    then

Find  

end if

until  

end if

end for