An ant colony algorithm for the sequential testing problem under precedence constraints

Warning The system is temporarily closed to updates for reporting purpose.

Çatay, Bülent and Özlük, Özgür and Ünlüyurt, Tonguç (2008) An ant colony algorithm for the sequential testing problem under precedence constraints. In: 2008 IEEE International Conference on Service Operations and Logistics, and Informatics, Beijing, China

This is the latest version of this item.

PDF (This is a RoMEO green publisher -- author can archive pre-print (ie pre-refereeing) and post-print (ie final draft post-refereeing)) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader

Official URL: http://dx.doi.org/10.1109/SOLI.2008.4682822


We consider the problem of minimum cost sequential testing of a series (parallel) system under precedence constraints that can be modeled 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 algorithm with a special branch and bound algorithm for general instances. The ant colony algorithm is shown to be particularly effective for larger instances of the problem.

Item Type:Papers in Conference Proceedings
Uncontrolled Keywords:Sequential testing; ant colony optimization; precedence constraints.
ID Code:10930
Deposited By:Tonguç Ünlüyurt
Deposited On:16 Dec 2008 16:38
Last Modified:22 Jul 2019 12:03

Available Versions of this Item

Repository Staff Only: item control page