J4 ›› 2011, Vol. 33 ›› Issue (5): 191-194.
• 论文 • 上一篇
席阳
收稿日期:
修回日期:
出版日期:
发布日期:
作者简介:
基金资助:
北京市教育委员会专项资助项目(JD201005)
XI Yang
Received:
Revised:
Online:
Published:
摘要:
堆场垛位优化问题一直是仓储管理的难点和焦点之一,垛位优化可以保证物料装卸和出入库的高效率,同时对保证合同交货期也起着至关重要的作用。针对仓储和生产一体化下的入库堆垛问题,本文通过分析将其归结为一类半在线的A型装箱问题,并依据问题的特点,建立了最小化总倒垛次数的优化模型。根据货场天车在相邻入库过程中存在空闲作业量的特点,设计了一种前序货物允许移动的动态堆垛策略,结合堆垛约束后嵌入到经典装箱启发式算法中,最后通过仿真算例验证了该策略的有效性。
关键词: 堆垛问题, 装箱问题, 装箱启发式, 半在线
Abstract:
High efficiency of stock position optimization decision plays an important role in material handling and insuring of delivery times. Concerning on the warehousing entry problem in the storage production integration, a mathematical model considering the minimum of goods shuffling numbers is build based on the formulation of semionline Ashape bin packing problem through analysis. A heuristics strategy named dynamic stacking strategy (DSS), which in view of vacant workload of overhead cranes between the adjacent incoming goods, and together with stacking constraints embedded in bin packing heuristics is designed to solve the suggested model. The numerical experiments show the validity of the DSS strategy.
Key words: stack selection problem;bin packing problem;bin packing heuristics;semionline
席阳. 半在线入库堆垛问题的动态求解算法[J]. J4, 2011, 33(5): 191-194.
XI Yang. [J]. J4, 2011, 33(5): 191-194.
0 / / 推荐
导出引用管理器 EndNote|Ris|BibTeX
链接本文: http://joces.nudt.edu.cn/CN/
http://joces.nudt.edu.cn/CN/Y2011/V33/I5/191