装箱问题

本文利用二分搜索法和时间表理论中LPT算法求解装箱问题的近似最优解；

This paper gives a heuristic algorithm DLPT for bin packing problem by using LPT algorithm of scheduling theory and binary search method .

在线A形装箱问题：模型及算法研究

On-line A-shaped bin packing problem : models and analysis of heuristics

集装箱装箱问题（ContainerLoadingProblem，CLP）是物流优化领域中一个经典的问题，具有很大的研究价值。

Container Loading Problem ( CLP ) is a typical optimal problem in logistics . It has great value to be researched .

基于装箱问题的Hopfield网络优化设计

Optimal Decisions of Hopfield Network Based on Packing Problem

装箱问题是一个传统的NP难问题，它也是一个经典的组合优化问题。

The packing problem is a traditional NP-hard problem , it is a classic combinatorial optimization problem .

三维装箱问题是一类典型的NP-complete问题。

Three-dimensional Loading problem is a kind of typical NP-complete problem .

某些装箱问题是NP完全的，但可以通过动态规划法或近似最优的启发式解法来解决。

Some bin packing problems are NP-complete but are amenable to dynamic programming solutions or to approximately optimal heuristic solutions .

时间表理论中LPT算法在装箱问题中的应用

An application of LPT algorithm in scheduling theory to bin packing problem

将泊位分配问题描述为一个带约束的二维装箱问题，应用增广Lagrange算法求解了几个算例。

We formulate the berth allocation problem as a two-dimensional strip packing problem with additional constraints and use the augmented Lagrange algorithm to solve several instances .

装箱问题是一类非常典型的NP-hard问题，具有很重要的理论价值与实际应用意义。

The Bin-packing problem ( BPP ) is a kind of very typical NP-hard problem . And it is of important theoretical value and practical significance .

本文从有害危险物品处理场的选址领域描述了极端装箱问题，给出了求解此问题的2-近似算法，称其为增量式Voronoi插入法。

An extreme packing problem was formulated in locating hazardous materials disposal sites context . A 2-approximation algorithm , which we called Incremental Voronoi Insertion , was given .

提出了一种带有启动空间的约束装箱问题（start-upbinpackingproblem，简称SBPP），即不同类型的物品放入同一箱子中需要一个启动空间。

A constrained bin packing problem with start-up space ( SBPP ) is proposed in this paper , in which an additional start-up space is needed if different items are put into a same bin .

另一种是混合遗传算法，它综合运用解装箱问题的FFD（FirstFitDe－creasing）近似算法和简单遗传算法。

Another belongs to hybrid genetic algorithm , which is a hybrid of First Fit Decreasing approximation algorithms and simple genetic algorithms .

在算法框架的基础上，进一步针对两个经典的组合优化（CO）问题：装箱问题和旅行商问题，应用EAMG进行求解。

Based on the framework of the algorithm , we use EAMG to solve two typical Combinatorial Optimization Problems : Bin-Packing Problem ( BPP ) and Traveling Salesman Problem ( TSP ) .

最后通过算例比较，得出以下结论：在求解装箱问题时，结合了BFD思想的混合遗传算法要比基本遗传算法优化许多，具有很高的实用价值。

After the comparison of the example , we have a conclusion that the hybrid genetic algorithm constituted by BFD and SGA is better than SGA in solving BP and it has an applied value .

在研究解决装箱问题的递降最佳适合算法（BFD算法）的基础上，提出了文档管理备份的优化BFD算法。

Based on the study of the optimal and descending algorithm ( BFD algorithm ) which is used to resolve the case question , the optimized BFD algorithm for mass backup-file in Document Management is presented .

求解三维装箱问题的启发式分层搜索算法

A Heuristics Multi-layer Search Algorithm for Three Dimensional Container Loading Problem

针对装箱问题对编码方式作了改进，采用数字符号编码方式。

Numerical sign coding is improved to solve bin packing problems .

超尺寸物品装箱问题及其算法

Bin packing problem with over sized items and a new algorithm

同一尺寸货物三维装箱问题的一种启发式算法

A Heuristic algorithm for Three Dimensional Container Packing Problem of Fixed-size Cargos

锁具装箱问题的最大不互开锁数的理论证明

The Theoretical Proof on the Maximal Number of Non-Opening-Mutually Locks

二维矩形条带装箱问题的底部左齐择优匹配算法

Lowest-Level Left Align Best-Fit Algorithm for the 2D Rectangular Strip Packing Problem

染色装箱问题及其启发式算法

Two Variations of Bin Packing and Bin Covering Problems and their Algorithms

求解三维装箱问题的混合模拟退火算法

A Hybrid Simulated Annealing Algorithm for the Three-Dimensional Packing Problem

有向图上最大权圈装箱问题的有效算法

An Efficient Algorithm for the Maximum Weighted Cycle Packing Problem on Digraphs

受启动空间约束的装箱问题

On a Constrained Bin Packing Problem with Start-Up Space

关于锁具装箱问题的几点评注

Notes and Commentary on the Problem of Putting Locks and Keys in Boxes

板材排样可映射为一个装箱问题。

The problem of plates layout can be mapped into an encasement problem .

使用混合人工鱼群算法求解装箱问题

Solving bin-packing problem by hybrid artificial fish swarm algorithm

装箱问题广泛存在于工业领域，在实际应用中，装箱问题的解决效果影响最直接和显著的领域是物流运输业。

Container packing problem exists in industry areas widely , especially in logistics area .