该算法利用问题的邻域知识指导局部搜索，可克服元启发式算法随机性引起的盲目搜索。
The proposed algorithm utilizes neighborhood knowledge to direct its local search procedure which can overcome the blindness or randomness introduced by meta-heuristics.
因此本文针对标的本身的结构提出了四种启发式信息及两种求解器：二元蚁群算法及贪婪算法。
By using the intrinsic characters of this model, we design four types of heuristic information for bid and two problem solvers: the binary ant colony algorithm and the greedy algorithm.
因此本文针对标的本身的结构提出了四种启发式信息及两种求解器：二元蚁群算法及贪婪算法。
By using the intrinsic characters of this model, we design four types of heuristic information for bid and two problem solvers: the binary ant colony algorithm and the greedy algorithm.
应用推荐