The set partition problem is a typical NP-Complete problem. An optimization model of set partition problem is given in this paper. An ant colony algorithm is put forward to solve this problem.
集合划分问题是一个典型的NP完全问题，建立了集合划分问题的优化数学模型，采用蚁群算法解决了此问题。
The set partition problem is a typical NP-Complete problem. An optimization model of set partition problem is given in this paper. An ant colony algorithm is put forward to solve this problem.
集合划分问题是一个典型的NP完全问题，建立了集合划分问题的优化数学模型，采用蚁群算法解决了此问题。
应用推荐