李涛,杜国政,张正利,曹刚.基于“货到人”拣选模式的自动化电缆堆场动态货位分配优化[J].包装工程,2024,45(13):230-237.
LI Tao,DU Guozheng,ZHANG Zhengli,CAO Gang.cking Model[J].Packaging Engineering,2024,45(13):230-237. |
| 基于“货到人”拣选模式的自动化电缆堆场动态货位分配优化 |
| cking Model |
| 投稿时间：2023-11-23 |
| DOI：10.19554/j.cnki.1001-3563.2024.13.026 |
| 中文关键词: 自动化电缆堆场 “货到人”拣选 动态货位分配 自适应大邻域搜索 |
| 英文关键词: automated cable yard "goods-to-person" dynamic allocation adaptive large neighborhood search |
| 基金项目:国网山东省电力公司2023年科技项目(520603230002) |
|
| 摘要点击次数: |
| 全文下载次数: |
| 中文摘要: |
| 目的 优化基于“货到人”拣选模式自动化电缆堆场中货位分配，提高自动化电缆堆场作业效率。方法 针对堆场内电缆容器多层堆存造成调库搬运次数多的问题，建立以出入库行车总搬运次数最小为目标的动态货位分配数学模型，设计基于最大堆栈时序间隔的自适应大邻域搜索算法进行求解，得到货位分配优化方案。结果 基于最大堆栈时序间隔的自适应大邻域搜索算法的优化方案可以减少出入库行车搬运次数8.12%左右。结论 与现行货位分配规则相比，文中提出的货位分配策略能够有效提高系统作业效率。 |
| 英文摘要: |
| The work aims to optimize the allocation of space in automatic cable yards based on the "goods to person" picking mode to improve the operation efficiency of automated cable yards. Considering the repositioning caused by the multiple stacking of cable containers, a mathematical model on the dynamic allocation of space was established to minimize the total handling numbers of the inbound and outbound crane. An adaptive large neighborhood search algorithm based on the maximum stack timing interval was designed to solve the problem and obtain the optimization allocation scheme. The optimized solution obtained according to the adaptive large neighborhood search algorithm based on the maximum stack timing interval could reduce the average handling numbers of the inbound and outbound crane by about 8.12%. Compared with the current allocation method, the proposed allocation strategy can effectively improve the working efficiency of the system. |
|
查看全文
查看/发表评论 下载PDF阅读器 |
| 关闭 |
渝公网安备 50010702501716号