At the end of the paper, it proves that the Ant Colony Algorithm is good through comparison it to the greedymethod.
并将用蚁群算法得到的结果与基于贪心策略得到的结果进行了比较，效果较好。
2
This paper adopts dynamic programming method and greedymethod to solve such problems, then analyzes and compares the differences of two algorithms.
采用动态规划法和贪心法对该问题进行求解，分析和比较这两种算法在求解同一问题时的差异。
3
Through the investigation of the reconfiguration practice in a certain plant, the conclusion is attained that the greedymethod based on matroid model is efficient and practicable.