quadratic assignment problem

基本解釋

A Modified Ant Colony Algorithm for the Quadratic Assignment Problem;
本文給出了一種求解二次指派問(wèn)題的混合演化策略。
The applications of ACO to static and dynamic COPs, such as traveling salesman problem, quadratic assignment problem, network routing problem are reviewed.
結(jié)合旅行商問(wèn)題、二次指派問(wèn)題以及網(wǎng)絡(luò)路由問(wèn)題等典型組合優(yōu)化問(wèn)題，概述了ACO在靜態(tài)組合最優(yōu)化和動(dòng)態(tài)組合優(yōu)化問(wèn)題中的應(yīng)用。
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.
針對(duì)處理任務(wù)分配，將其建模為二次0-1規(guī)劃問(wèn)題，并提出了分布式逐層優(yōu)化分配算法OALL。