Discrete Applied Mathematics - Special issue on the satisfiability problem and Boolean functions
A cost-reducing question-selection algorithm for propositional knowledge-based systems
Annals of Mathematics and Artificial Intelligence
Finding optimal satisficing strategies for and-or trees
Artificial Intelligence
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
On a multimode test sequencing problem
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Sequential testing policies for complex systems under precedence constraints
Expert Systems with Applications: An International Journal
Optimal ordering of independent tests with precedence constraints
Discrete Applied Mathematics
Hi-index | 12.05 |
We consider the problem of minimum cost sequential testing (diagnosis) of a series (or parallel) system under precedence constraints. We model the problem as a nonlinear integer program. We develop and implement an ant colony algorithm for the problem. We demonstrate the performance of this algorithm for special type of instances for which the optimal solutions can be found in polynomial time. In addition, we compare the performance of the ant colony algorithm with a branch and bound algorithm for randomly generated general instances of the problem. The ant colony algorithm is particularly effective as the problem size gets larger.