Procedure   algorithm LSS  (F,λ,X,G)
begin
create initial feasible solution 𝑋 0
set 𝑑 ℎ (X)= 0, (h = 1,…,H)
(set all initial smoothing factors to zero)
 for  i:   =  1   to max-iterations
 begin
   𝐹 (X) = F(X) + ∑ ℎ [ 𝜆 ℎ ∗ 𝑑 ℎ ( 𝑋 ) ]
   𝑋 𝑖 = Local search ( 𝐹 , 𝜆 ℎ , 𝑋 𝑖 − 1 , G)
  for each h:   =  1 to H
  begin
   adjust 𝑑 ℎ (X);
      ( 𝑋 ℎ is the local optimum point)
   if  F( 𝑋 𝑖 ) < 𝐹 b e s t   then
     𝐹 b e s t  :  =  F( 𝑋 𝑖 );
     𝑋 b e s t :   =   𝑋 𝑖 ;
   end
   adjust 𝜆 ℎ   for adaptive λ;
  end
 end procedure
 LSS  returns 𝑋 b e s t where F( 𝑋 b e s t ) is the minimum of all solutions so far.
Algorithm 1: Landscape smoothing search (LSS).