Paper Info
Title
TestAnt: An ant colony system approach to sequential testing under precedence constraints
Abstract
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.
Year
DOI
Venue
2011
10.1016/j.eswa.2011.05.053
Expert Systems With Applications
Keywords
Field
DocType
problem size,general instance,ant colony system approach,ant colony algorithm,special type,Metaheuristics,precedence constraint,Sequential testing,nonlinear integer program,Diagnosis,optimal solution,Ant colony optimization,minimum cost sequential testing,polynomial time,bound algorithm
Ant colony optimization algorithms,Integer,Computer science,Artificial intelligence,Time complexity,Metaheuristic,Branch and bound,Mathematical optimization,Parallel metaheuristic,Algorithm,Ant colony,Sequential analysis,Machine learning
Journal
Volume
Issue
ISSN
38
12
Expert Systems With Applications
Citations 
PageRank 
References 
5
0.58
8
Authors
3
Name
Order
Citations
PageRank
Bülent Çatay115711.31
Ozgur Ozluk2568.92
Tonguç Ünlüyurt31028.94