Testing strategies for k-out-of-n systems precedence constraints

Özdemir, Elif (2011) Testing strategies for k-out-of-n systems precedence constraints. [Thesis]

[img]PDF - Registered users only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader

Official URL: (Table of Contents)


This thesis investigates diagnosis strategies for k-out-of-n systems under the general type precedence constraints. Given the testing costs and the prior working probabilities, the problem is to devise strategies that minimizes the total expected cost of finding the correct state of the system. The true state of the system is determined by sequential inspection of these n components. We try to find good strategies for the problem under general type precedence constraints by adapting an optimal algorithm that works when there are no precedence constraints. We refer to this algorithm Intersection-Precedence and represent the strategy that we obtain efficiently by a Block-Walking Diagram structure. Since no computational results are reported in the literature for this particular problem, in order to benchmark the performance of the Intersection-Precedence algorithm, we develop Tabu Search and Simulated Annealing algorithms that find permutation strategies.We conduct an extensive computational study to compare the results obtained by the alternative algorithms and we observe that Intersection- Precedence algorithm, in general, outperforms the other algorithms.

Item Type:Thesis
Uncontrolled Keywords:k-out-of-n system. -- Tabu search. -- Simulated annealing. -- General type precedence constraint. -- Simulated annealing -- n'nin k'lısı sistemler. -- Tabu arama. -- Benzetilmiş tavlama. -- Genel tipte öncelik kısıtları. -- Sıralı test etme.
Subjects:T Technology > T Technology (General) > T055.4-60.8 Industrial engineering. Management engineering
ID Code:24549
Deposited By:IC-Cataloging
Deposited On:25 Sep 2014 10:51
Last Modified:25 Sep 2014 10:51

Repository Staff Only: item control page