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完全问题，在一定时间内求其精确全局最优解是相当困难的。
Taking hull parts nesting as its background, auto packing problem and its solutions of two-dimensional irregular polygon are studied in this paper.
本文以船体零件套料为背景，研究了二维不规则多边形的自动排样问题及其方法。
One dimensional bin packing problem has many important applications such as multiprocessor scheduling, resource allocation, real world planning, and packing and scheduling optimization problems.
经典一维装箱问题在多处理器调度、资源分配和日常生活中的计划、包装、调度等优化问题中有着极为重要的应用。
Container loading is the three-dimensional problem in "cutting and packing" problems. It is combined optimization with complex constraint condition.
集装箱装入问题是“切割和装入”问题领域中的三维空间问题，是具有复杂约束条件的组合优化问题。
This paper presents a model based on discrete no-fit polygon for the two-dimensional irregular packing problem.
提出了一个用于求解二维不规则排样问题的离散临界多边形模型。
The experiment indicates the validity of the TS to the three dimensional bin packing problem with multi-type bins.
实验结果表明了提出的禁忌算法对优化多箱型三维装箱问题的有效性。
The experiment indicates the validity of the TS to the three dimensional bin packing problem with multi-type bins.
实验结果表明了提出的禁忌算法对优化多箱型三维装箱问题的有效性。
应用推荐