基于蚁群算法的并行测试任务调度  

Novel Ant Colony Algorithm for Parallel Test Task Scheduling

作　　者：付新华[1] 肖明清[1] 夏锐[1] 

机构地区：[1]空军工程大学工程学院自动测试系统实验室,陕西西安710038

出　　处：《系统仿真学报》2008年第16期4352-4356,共5页Journal of System Simulation

基　　金：总装"十一五"重点预研项目(51317030103);电子测试技术国防科技重点实验室基金项目(51487020305JB3201)

摘　　要：并行测试的任务优化调度是并行测试技术的核心问题。提出了一种用于解决并行测试任务调度问题的改进蚁群算法,通过该算法可以获得测试时间最短的任务调度序列。给出了并行测试任务调度问题的数学模型,设计了启发式函数和状态转移概率的计算公式。采用动态标注方法在搜索过程中加大可行解间的信息素差别,避免算法早熟。给出了应用实例,实际应用表明该算法是有效的,能很好地解决此类多维动态组合优化问题。The optimized parallel test task scheduling is a key problem to the parallel test, A novel ant colony algorithm was proposed to optimizing the parallel test task scheduling, With this algorithm, the task sequence with shortest total test time could be obtained. The mathematical model of the problem of parallel test task scheduling was established. The calculate formulae of heuristic information and probability of selecting were given. An approach of dynamic labeling to increase the pheromone difference between feasible solutions was adopted to avoid earliness of algorithm. Two examples were given. The practice application shows that this method is validated and can solve complex multidimensional dynamic combinatorial optimization problems.

关 键 词：自动测试系统 并行测试 任务调度 蚁群算法 

分 类 号：TP202[自动化与计算机技术—检测技术与自动化装置]