A Bit-Parallel Tabu Search Algorithm for Finding -Optimal and Minimax-Optimal Supersaturated Designs

Algorithm 1

The TS algorithm.

1 Input , , , , .

2 Generate an initial RIBD (solution) randomly;

3 Set , , , ;

4 while ( & ) do

5 Set ;

6 for do

7  Set move from to ;

8  if ( & ( or )) then

9   if () then

10    Set with 50% probability;

11   else if

12    Set , ;

13   end if

14  end if

15 end for

16 if () then

17  Update ;

18  Set , ;

19 end if

20 Update ;

21 Update ;

22 if () then

23  remove oldest move from

24 end if

25 Set ;

26 end while

27 Output , .