ant colony optimization 蚁群算法 ; 蚁群优化 ; 蚁群优化算法 ; 算法
Ant Colony Optimization Algorithm 蚁群优化算法 ; 蚁群算法 ; 了基于蚁群优化算法 ; 和蚁群优化算法
ant colony optimization clustering 蚁群优化聚类
Chaos Ant Colony Optimization 混沌蚁群算法 ; 以形成混沌蚁群算法
Ant Colony Optimization ACO 蚁群优化
multiple ant colony optimization 多种群蚁群算法
parallel ant colony optimization 并行蚁群算法
ant colony optimization aco algorithm 蚁群优化算法
cultural ant colony optimization 文化蚂蚁优化算法
ant colony optimization algorithms 说明 ; 蚁群算法
Ant Colony optimization (ACO) is a new-style simulating evolution algorithm. The behavior of real ant colonies foraging for food is simulated and used for solving optimization problems.
蚁群算法是一种新型的模拟进化算法，它通过模拟蚁群在觅食过程中寻找最短路径的方法来求解优化问题。
A novel ant colony optimization algorithm with random perturbation behavior (RPACO) based on combination of general ant colony optimization and stochastic mechanism is developed in this paper.
从随机优化技术出发，针对基本蚁群算法，提出了一种随机摄动蚁群优化算法。
Two-dimensional stock cutting problem can be settled by solving two one-dimensional knapsack problems, this paper presents a new algorithm based on the ant colony optimization idea.
基于一维问题的蚂蚁算法，本文将二维矩形件排样问题转化为一维背包问题，然后进行求解。
应用推荐