Two dimensional packing problem 二维排样问题
two-dimensional packing problem 二维布局问题
one dimensional packing problem 一维装箱问题
two-dimensional strip packing problem 二维装箱问题
one dimensional bin packing problem 一维装箱条码问题
The most effective solution to three-dimensional packing problem.
目前最有效的解决三维装箱问题的方法。
By combining the personification heuristics and simulated annealing, a combinational heuristic algorithm for the three-dimensional packing problem is presented.
通过拟人化的启发式算法和模拟退火相结合，组合的三维装箱问题的启发式算法。
Three-dimensional component packing is a combinatorial optimization and NP-complete problem. It is difficult to find its exact global optimum.
三维布局问题属于组合最优化问题和NP完全问题，在一定时间内求其精确全局最优解是相当困难的。
应用推荐