检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:肖茂友[1] 范玉林[1] 魏翔宇 唐沂媛 XIAO Mao-you;FAN Yu-lin;WEI Xiang-yu;TANG Yi-yuan(Ji'nan Power Supply Company of State Grid Corporation of China,Ji’nan 250013)
出 处:《制造业自动化》2025年第3期110-119,共10页Manufacturing Automation
基 金:国网山东省电力科技项目(520601230009)。
摘 要:装卸作业是物流领域劳动强度较大的场景之一。三维装箱问题作为自动装卸的关键性问题正日益受到重视。针对传统三维装箱算法没有关注订单装卸顺序的不足,考虑顾客订单分类与装卸顺序的前提,对于三维装箱问题提出高效快速的两阶段启发式算法。首先将货物堆叠为“塔”状并采用降维思想转化成二维矩形填充问题进行优化,创新性地将天际线算法与BL(Bottom-Left)算法相结合,解码出最优的装箱顺序及位置。实验证明,该算法可以使得装箱策略的空间利用率达到最大化。Loading and unloading operations are one of the labor-intensive scenarios in the logistics field.As a crucial issue in automatic loading and unloading,the three-dimensional packing problem is increasingly receiving attention.In response to the shortcomings of traditional 3D packing algorithms that do not pay attention to the order loading and unloading sequence,this paper proposes an efficient and fast two-stage heuristic algorithm for the 3D packing problem under the premise of considering customer order classification and loading and unloading sequence.The algorithm first stacks goods into a"tower"shape and uses dimensionality reduction to transform it into a two-dimensional rectangular filling problem for optimization.It innovatively combines the skyline algorithm with the BL(Bottom Left)algorithm to decode the optimal packing order and position.The experimental results have shown that this algorithm can maximize the space utilization of the packing strategy.
分 类 号:TP391.7[自动化与计算机技术—计算机应用技术] U294.26[自动化与计算机技术—计算机科学与技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.171