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

Algorithm 1

Depots to open and customers’ assignment.

Procedure: InitialSol

Input: Problem’ data values

Output: Depots to open and customers’ assignment

repeat

Select randomly an available depot

repeat

if () then

else

end if

until ()

until ()