装箱问题是复杂的离散组合最优化问题。所谓组合优化,是指在离散的、有限的数学结构上,寻找一个满足给定条件,并使其目标函数值达到最大或最小的解。一般来说,组合优化问题通常带有大量的局部极值点,往往是不可微的、不连续的、多维的、有约束条件的、高度非线性的NP完全问题。装箱问题也不例外,同许多组合最优化问题,如旅行商问题、图的划分问题等一样属于NP一HARD问题。经典的装箱问题要求把一定数量的物品放入容量相同的一些箱子中,使得每个箱子中的物品大小之和不超过箱子容量并使所用的箱子数目最少。
... Intersection Detection 碰撞测试 Bin Packing 装箱问题 Medial-Axis Transformation 中轴变换 ...
基于2个网页-相关网页
Typical combinatorial optimization problems include Travelling Salesman Problem, Knapsack Problem, Bin Packing Problem, Minimum Degree Spanning Tree Problem, Set Cover Problem, etc. These problems are seemingly simple, and closely related to engineering situations.
典型的组合优化问题有旅行商问题、背包问题、装箱问题、最小度生成树问题、集合覆盖问题等。
参考来源 - 若干组合优化问题的算法研究This paper presents an efficient heuristics multi-layer search algorithm for three-dimensional container loading problem.
本文提出了一个高效求解三维装箱问题的启发式分层搜索算法。
参考来源 - 求解三维装箱问题的启发式分层搜索算法The typical engineering design problems include a knapsack problem, bin-packing problem, traveling salesman problem, vehicle routing problem, machine scheduling order and balance, create yuan design issues, equipment, location and layout.
比较典型的工程设计问题包括了背包问题、装箱问题、旅行商问题、车辆路径问题、机器调度排序与平衡问题、制造元设计问题、设备定位与布局等。
参考来源 - 遗传算法在组合优化中的应用研究·2,447,543篇论文数据,部分数据来源于NoteExpress
装箱问题,即在一定的约束条件下如何将不同重量的物体放入不同的箱子,是一个历史悠久的有趣问题。
Bin packing, or the placement of objects of certain weights into different bins subject to certain constraints, is an historically interesting problem.
集装箱装箱问题是一个典型的组合优化问题,人们往往使用流行的智能算法寻求一种更为理想的装箱方案。
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.
经典一维装箱问题在多处理器调度、资源分配和日常生活中的计划、包装、调度等优化问题中有着极为重要的应用。
One dimensional bin packing problem has many important applications such as multiprocessor scheduling, resource allocation, real world planning, and packing and scheduling optimization problems.
People use bin packing algorithms to figure out, for example, how to load up container ships.
人么通常用装箱算法来计算这个问题,比如说怎样装载货船。
应用推荐