An ant colony algorithm is put forward compared with Hungary method, and its effectiveness is illustrated through result.

采用蚁群算法解决了此问题，并通过实例给出了算法，并与匈牙利法做了比较，结果表明该方法比较有效。

youdao

Based on the relationship, a compounded greedy genetic algorithm and an ant colony algorithm are proposed to derive a minimum unsatisfiable subformula.

针对最小不可满足子式的求解问题，提出并证明了布尔公式最小不可满足性与极大可满足性之间的关系。

youdao

Considering the communication cost and optimization qualities, an ant colony algorithm based on the coarse-grain model is designed to solve the problem of this model.

为求解该模型，并综合考虑优化质量和通信开销，采用了基于粗粒度模型的并行蚁群算法。

youdao