Some bin packing problems are NP-complete but are amenable to dynamic programming solutions or to approximately optimal heuristic solutions.
某些装箱问题是NP完全的，但可以通过动态规划法或近似最优的启发式解法来解决。
In order to search for the optimizing solutions of tool switching problem effectively, a beam search based heuristic algorithm is put forward for formulating heuristic solution space of the problem.
为了有效地搜索到刀具交换问题的优化解，本文提出了基于定向搜索的启发式算法的求解方法。
The initial population was generated by the NEH constructive heuristic to enhance the quality of the initial solutions.
在该混合算法中，采用NEH启发式算法进行种群初始化，以提高初始解质量。
应用推荐