[1]YANG Bensheng,YUAN Xiangmeng,HUANG Xiaoguang.Ant colony algorithm based on dynamic priority for distributed automation test scheduling[J].CAAI Transactions on Intelligent Systems,2014,9(6):729-733.[doi:10.3969/j.issn.1673-4785.]
Copy
CAAI Transactions on Intelligent Systems[ISSN 1673-4785/CN 23-1538/TP] Volume:
9
Number of periods:
2014 6
Page number:
729-733
Column:
学术论文—智能系统
Public date:
2014-12-25
- Title:
-
Ant colony algorithm based on dynamic priority for distributed automation test scheduling
- Author(s):
-
YANG Bensheng1; YUAN Xiangmeng2; HUANG Xiaoguang2
-
1. College of Resources, Hebei University of Engineering, Handan 056038, China;
2. College of Information and Electrical Engineering, Hebei University of Engineering, Handan 056038, China
-
- Keywords:
-
distributed automated testing; ant colony algorithm; task scheduling; GridSim
- CLC:
-
TP311.5
- DOI:
-
10.3969/j.issn.1673-4785.
- Abstract:
-
Using the ant colony algorithm based on dynamic priority, the test task scheduling module in distributed automation test platform was analyzed. The algorithm mainly applies dynamic priority choice to the search of the optimal solution in the strategy of ant colony algorithm. The search time of the ant colony algorithm improves the search ability through implementation of test task priority and change of task waiting time increase, and high priority tasks to perform first. Through the simulation by GridSim, the results of experiment showed that this algorithm can improve the scheduling performance of the system, the utilization rate of test resources, and the efficiency of automated test system.