Experiments show that, with respect to CPU time, preferential greedy algorithm improves Kuhn-Munkres algorithm by about 31.6% on average, and standard greedy algorithm by about 36.3% on average.

• 3种算法的仿真实验表明；优先贪婪算法比精确算法损失匹配数量约8.；0%25；节约时间约31