Test-Sheet Composition Using Analytic Hierarchy Process and Hybrid Metaheuristic Algorithm TS/BBO

Algorithm 6

Algorithm of tabu search.

Begin

  Step  1: Randomly generate an initial configuration, 𝑥=[𝑥₁,𝑥₂,…,𝑥_𝑛], with an

      empty tabu list

  Step  2: Repeat the following statements until the stopping criterion is met

   Step  2.1: Identify the neighborhood Ω(𝑥)={𝑥^′∣𝑥^′=𝑆(𝑥)} of current

        configuration 𝑥, and consider a subset 𝐻(𝑥) from Ω(𝑥)

   Step  2.2: Choose the best (in terms of a moving evaluation score)

        configuration 𝑥^∗∈𝐻(𝑥) which is either nontabu or is tabu

        but satisfying the aspiration criterion

   Step  2.3: Update the tabu list and let 𝑥=𝑥^∗

  Step  3: Output the best configuration found

End.