A simulated annealing ant colony algorithm is presented to tackle the Quadratic Assignment Problem (QAP).
提出了一种求解二次分配问题的模拟退火蚁群算法。
Therefore, research on heuristics for the quadratic assignment problem (QAP) has become the hotline of computer science for a long time.
故求解qap问题的启发式算法成为计算机科学基础研究的热点之一。
The applications of ACO to static and dynamic COPs, such as traveling salesman problem, quadratic assignment problem, network routing problem are reviewed.
结合旅行商问题、二次指派问题以及网络路由问题等典型组合优化问题，概述了ACO在静态组合最优化和动态组合优化问题中的应用。
The processing task assignment is formulated as a quadratic 0-1 programming problem, and a distributed OALL algorithm (optimizing assignment layer by layer) is proposed.
针对处理任务分配，将其建模为二次0 - 1规划问题，并提出了分布式逐层优化分配算法oall。
The processing task assignment is formulated as a quadratic 0-1 programming problem, and a distributed OALL algorithm (optimizing assignment layer by layer) is proposed.
针对处理任务分配，将其建模为二次0 - 1规划问题，并提出了分布式逐层优化分配算法oall。
应用推荐