Ant colony algorithm is a new heuristicoptimizationmethod and it has many merits.
蚁群算法是一种新型启发式优化算法，具有较多优点。
2
The method gives out the presentation be constrained to objects into pipeline by using collision matrix, and findsout scheduling model with goal-oriented optimization by heuristic search.
该方法给出冲突矩阵表示对象流入流水线的限制，通过启发式搜索寻找面向目标优化的调度策略。
3
Second, combining with the result of first step, it carries out branch exchange by using heuristic rule to reduce the defect due to using a method independently and improve the optimization effect.