An Ant Colony Algorithm for the Sequential Testing Problem under Precedence Constraints

摘要：

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.

关键词： Sequential testing ant colony optimization precedence constraints

作者: Bulent Catay Ozgur Ozluk Tonguc Unluyurt

作者单位: Sabanci University Orhanli,Tuzla34956,Istanbul,Turkey San Francisco State UniversityCollege of BusinessSan Francisco,CA,USA Sabanci University Orhanli,Tuzla 34956,Istanbul,Turkey

会议类型: 国际会议

会议名称: 2008 IEEE International Conference on Service Operations and Logistics, and Informatics(IEEE/SOLI’2008)(IEEE服务运作、物流与信息年会)

会议地点: 北京

会议语种:英文

在线出版日期: 2008-10-12（万方平台首次上网日期，不代表论文的发表时间）