Traditional methods include Dynamic Programming, Greedy Algorithms, Local Search Heuristics and Branch and Bound algorithms.

传统的求解方法包括动态规划法、贪婪算法、局部搜索法和分支定界法等。

youdao

Heuristics mutation operator and local search scheme are designed in the algorithm.

该算法采用新的启发式变异算子和局部搜索算子。

youdao

The proposed algorithm utilizes neighborhood knowledge to direct its local search procedure which can overcome the blindness or randomness introduced by meta-heuristics.

该算法利用问题的邻域知识指导局部搜索，可克服元启发式算法随机性引起的盲目搜索。

youdao