Question: Consider 10 Boolean variables, Bi, i = 1, 2, c, 10. Each variable assumes the value T (true) or F (false). Next, consider the following
Consider 10 Boolean variables, Bi, i = 1, 2,
c, 10. Each variable assumes the value T (true) or F (false). Next, consider the following six expressions (the notation Bi defines not Bi):
(B1 and B3 and B8) or (B4 and B10) and B6 B2 and B7
(B2 or B5) and (B1 or B4 or B6)
(B1 and B3 or B4) or (B5)
(B4 and B6) or B9 B2 or B5 or B6 or (B1 and B3)
Use TS to assign a solution to each Boolean variable that maximizes the number of true logical expressions. Carry out five TS iterations starting with solution S0 = 1T, F, T, F, T, F, T, F, T, F2 and a tabu tenure period of two iterations.
(Hint: For convenience, file exelSAT.xls automates the evaluation of the Boolean expressions.)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
