A discrete particle swarm algorithm for the rectangular strip packing problem is presented.
提出了一种基于离散粒子群优化算法求解矩形件排样问题的方法。
Solving Rectangular Packing Problem Based on Discrete Particle Swarm Optimization Algorithm;
提出了一种求解置换流水车间调度问题的离散粒子群优化算法。
Practical data tests show that the algorithm is feasible in solving steel coils packing problem.
实际数据试验说明，该算法在解决钢卷入库问题时是可行的。
Packing problem is a typical combinatorial optimization problem, and has NPC difficulty in solving complexity.
布局问题是一种经典的组合优化问题，在求解复杂性上具有NP完全性。
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.
实验结果表明了提出的禁忌算法对优化多箱型三维装箱问题的有效性。
Experimental results demonstrate that the algorithm developed is fairly efficient for solving the rectangle and circle packing problem.
测试结果表明，算法对求解矩形和圆形装填问题是行之有效的。
The bin packing problem is to put some objects with various sizes into a defined space in order to obtain the specified optimal benefit.
装箱问题就是将不同尺寸的物品摆放入有一定容量的容器中，以获得某种最佳的效益。
The path packing problem is an optimization problem with many important applications. However, it is NP-hard in computational complexity.
图的路包装问题是一类有着重要应用背景的最优化问题，然而它在计算复杂度上是NP-困难的。
The problem how to put large goods into the storage is different from packing problem because the former one must take transit into account.
货物摆放问题不同于传统的排样问题，不仅要优化平面布局，还必须兼顾货物的运出。
Packing problem is faced in many industries, for example, the container loading, the sheet cutting, the design of VLSI and the newspaper editor.
装箱问题是个在工业生产中经常碰到的问题，如集装箱的装载、板材的切割、集成电路的设计、报纸的排版等等。
In complexity theory, set packing problems is an important NP-hard problem, which is used widely in the fields of scheduling and code optimization.
在复杂性理论中，此问题是一类重要的NP难问题，被广泛应用于调度、代码优化和生物信息学等领域。
Taking hull parts nesting as its background, auto packing problem and its solutions of two-dimensional irregular polygon are studied in this paper.
本文以船体零件套料为背景，研究了二维不规则多边形的自动排样问题及其方法。
As one of the constrained bin packing problem (BPP), coloring BPP has many important applications such as multi-processor real-time scheduling, etc.
作为经典装箱问题的推广，有色装箱问题在多处理器实时计算机系统的任务调度等实际问题中有着很强的应用背景。
As one of the constrained bin packing problem (BPP), coloring BPP has many important applications such as multi-processor real-time scheduling, etc.
作为经典装箱问题的扩展，有色装箱问题在多处理器实时调度的过程中有很强的应用背景。
In the cycle packing problem, given an undirected connected graph g, it is required to find the maximum number of pairwise edge disjoint cycles in g.
给定一个无向连通图g，圈包装问题就是求g的边不相交圈的最大数目。
Therefore, in order to improve solving efficiency of packing problem fundamentally, we design parallel algorithm with the structure of CUDA based on GPU.
因此，为了从根本上提高布局问题的求解效率，本文采用基于GPU结构的CUDA技术设计并行算法。
Absrtact: Bin- packing problem is a combinatorial optimization problem having very strong application background and its solution is extremely difficult.
摘 要：装箱问题是一个有很强应用背景的组合优化问题，求解极为困难。
Based on extensive researches on various heuristic methods, an objective-based heuristic algorithm was developed to solve the 2d rectangle packing problem.
为解决二维矩形布局问题，在广泛研究各种启发式方法的基础上，提出了基于目标的启发式算法。
Treated as the bin packing problem, the depository loading problem of cool steel coils is discussed for the annealing shop of a cool steel rolling factory.
讨论某冷轧厂热处理车间冷卷入库堆垛问题，并将其归结为装箱问题进行研究。
The container's packing problem is a typical problem about optimization, so people often use the popular intelligent algorithm to seek an ideal packing plan.
集装箱装箱问题是一个典型的组合优化问题，人们往往使用流行的智能算法寻求一种更为理想的装箱方案。
By combining the personification heuristics and simulated annealing, a combinational heuristic algorithm for the three-dimensional packing problem is presented.
通过拟人化的启发式算法和模拟退火相结合，组合的三维装箱问题的启发式算法。
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问题，其求解也是相当困难的。
The classic algorithms for the bin packing problem were extended to the on line ASBP. Comparisons of the worst case analysis and simulation lead to interesting results.
把装箱问题的经典算法推广到在线A形装箱问题，并分别从最坏情形分析与数值模拟两方面对算法进行了比较，得到了不同而且有趣的结果。
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问题，其求解是很困难的。
Two different Ant Colony Optimization heuristics based separately on Bin-packing Problem structure and Generalized Assignment Problem structure were designed for Books Warehouse Layout Problem.
将该图书仓库布局模型分别基于装箱问题结构和广义指派问题结构，设计了两种不同的蚁群优化算法。
One dimensional bin packing problem has many important applications such as multiprocessor scheduling, resource allocation, real world planning, and packing and scheduling optimization problems.
经典一维装箱问题在多处理器调度、资源分配和日常生活中的计划、包装、调度等优化问题中有着极为重要的应用。
One dimensional bin packing problem has many important applications such as multiprocessor scheduling, resource allocation, real world planning, and packing and scheduling optimization problems.
经典一维装箱问题在多处理器调度、资源分配和日常生活中的计划、包装、调度等优化问题中有着极为重要的应用。
应用推荐