...约束布局问题；凸多边形；临界多边形；启发式方法；粒子群算法；混合算法 [gap=774]keywords：packing problem with constraints; convex polygon; no-fit polygon; heuristic algorithm; particle swarm optimizati..
基于28个网页-相关网页
...约束 布局问题；凸多边形；临界多边形；启发式方法；粒子群算法； 混合算法 [gap=774]keywords：packing problem with constraints; convex polygon; no-fit polygon; heuristic algorithm; particle swarm optimizati..
基于1个网页-相关网页
Three dimension packing problem with multi constraints is a complicated combinatorial optimization, and is NP HARD problem. It is difficult to obtain on optimal solution.
多约束条件下的三维装箱问题是一个复杂的组合优化问题，属于NP- HARD问题，其求解是很困难的。
As a combinatorial optimization problem, three dimension packing problem with multi-constraints is NP-HARD problem. It is very difficult to obtain an optimal solution.
作为一类组合优化问题，多约束条件下的三维装载问题属于NP - Hard问题，其求解也是相当困难的。
应用推荐