• 对于NP -完全的组合优化问题,至今尚无很好的解析算法一般采用启发式算法解决

    For NP-complete combination optimization problems, there is no efficient algorithm to the solution of the problems. Consequently, heuristic algorithms may be used to solve such type of problems.

    youdao

  • 路径优化问题属于组合优化问题解决组合优化问题一般使用启发式搜索算法

    The path optimization problem belongs to combinatorial optimization problems, which is solved generally by using heuristic search algorithm.

    youdao

  • 摘要算法作为一种启发式算法,其参数组合一般通过大量实验取得

    Absrtact: Ant colony algorithm (ACA) is a meta - heuristic algorithm. In general, the setting of the parameters of the ACA is based on experiments.

    youdao

  • 摘要算法新型启发式模拟进化算法求解各种复杂组合问题提供了一种新的思路

    Absrtact: Ant colony algorithm is a novel heuristic simulated evolutionary algorithm, provides a new idea for solving complex problems of combination.

    youdao

  • 通过拟人化的启发式算法模拟退火相结合组合三维装箱问题启发式算法

    By combining the personification heuristics and simulated annealing, a combinational heuristic algorithm for the three-dimensional packing problem is presented.

    youdao

  • 通过拟人化的启发式算法模拟退火相结合组合三维装箱问题启发式算法

    By combining the personification heuristics and simulated annealing, a combinational heuristic algorithm for the three-dimensional packing problem is presented.

    youdao

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定