基于改進蟻群的測試序列優化算法
中國測試期刊
李丹陽， 蔡金燕， 杜敏杰， 朱 賽
（軍械工程學院光學與電子工程系，河北 石家莊 050003）
摘 要：針對故障診斷中的測試序列優化問題，提出一種改進蟻群算法的解決方法。該方法根據二值屬性系統的特點，定義狀態集向量及測試向量，將故障測試隔離過程轉化為向量的位運算過程，將序列優化問題轉化為一種最小代價的動態樹構造問題，設計靈活的狀態轉移規則，并根據動態樹的分層結構特點，提出一種分層加權和遺傳變異相結合的信息素更新策略，解決這種動態樹結構的尋優問題。仿真結果表明：該算法以較高的效率收斂到已知最優解，高效實用，為大規模復雜系統的測試優化問題提供了一條新的解決途徑，具有一定的工程應用價值。
關鍵詞：測試序列優化；蟻群算法；二值屬性系統；動態樹
中圖分類號：TP277；TP391.9；TM571.62；O212.6 文獻標志碼：A 文章編號：1674-5124（2013）04-0105-04
Test sequencing optimization based on improved Ant Algorithm
LI Dan-yang， CAI Jin-yan， DU Min-Jie， Zhu Sai
（Department of Electronic and Optical Engineering，Ordnance Engineering College，Shijiazhuang 050003，China）
Abstract: For solving the problem of test sequencing optimization in fault diagnosis， an improved ant algorithm was presented in this paper. According to the feature of the binary attribute system， state-set vector and test-set vector were defined， the fault testing segregation process was transformed to the process of vector operation and the problem of test sequencing optimization was transformed to construct a dynamic tree with minimum cost. Transfer rule of the ant state was designed and a kind of layered weighted pheromone update mechanism was presented， which combine with the variation in GA and solved the optimization problem of tree-construction. Simulation results show that the algorithm convergences to the optimal solution with high efficiency and provides a new way to solve the test sequencing optimization for large-scale complicated system.
Key words: test sequencing optimization； ant algorithm； binary attribute system； dynamic tree
