The experiment indicates the validity of the TS to the three dimensional bin packing problem with multi-type bins.
实验结果表明了提出的禁忌算法对优化多箱型三维装箱问题的有效性。
The bin packing problem is to put some objects with various sizes into a defined space in order to obtain the specified optimal benefit.
装箱问题就是将不同尺寸的物品摆放入有一定容量的容器中，以获得某种最佳的效益。
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.
作为经典装箱问题的扩展，有色装箱问题在多处理器实时调度的过程中有很强的应用背景。
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 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形装箱问题，并分别从最坏情形分析与数值模拟两方面对算法进行了比较，得到了不同而且有趣的结果。
One dimensional bin packing problem has many important applications such as multiprocessor scheduling, resource allocation, real world planning, and packing and scheduling optimization problems.
经典一维装箱问题在多处理器调度、资源分配和日常生活中的计划、包装、调度等优化问题中有着极为重要的应用。
Bin packing, or the placement of objects of certain weights into different bins subject to certain constraints, is an historically interesting problem.
装箱问题，即在一定的约束条件下如何将不同重量的物体放入不同的箱子，是一个历史悠久的有趣问题。
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.
将该图书仓库布局模型分别基于装箱问题结构和广义指派问题结构，设计了两种不同的蚁群优化算法。
Absrtact: Bin- packing problem is a combinatorial optimization problem having very strong application background and its solution is extremely difficult.
摘 要：装箱问题是一个有很强应用背景的组合优化问题，求解极为困难。
Absrtact: Bin- packing problem is a combinatorial optimization problem having very strong application background and its solution is extremely difficult.
摘 要：装箱问题是一个有很强应用背景的组合优化问题，求解极为困难。
应用推荐