Solving a Novel Inventory Location Model with Stochastic Constraints and (𝑅,𝑠,𝑆) Inventory Control Policy

Algorithm 1

General algorithmic frame for tabu search.

begin

   𝑘 = 0;

  Generate initialSolution 𝑆_𝑘;

   𝑆_best = 𝑆_𝑘;

   while 𝑘<  iterationNumber do

   NS_𝑘 = Generate Neighbourhood (𝑆_𝑘);

   find best (NS_𝑘);

   while    NS^best_𝑘  isTabu   do

      if   cost of NS^best_𝑘 < cost of 𝑆_best   then

        aspirationCriterion;

     reeplace NS^best_𝑘;

   If   cost of ns^best_𝑘 < cost of 𝑆_best   then

      𝑆_best=ns^best_𝑘;

      iteration without improvements = 0;

   iteration without improvements + 1;

   𝑆_𝑘=ns^best_𝑘;

   update (tabuList);

   check (diversificationCriterion);

   𝑘=𝑘+1

end