.png){kind=icon}
返回
Exact algorithms for the order picking problem
.png){kind=icon}
OA
AI
DOI：10.1016/j.cor.2018.07.002.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Order picking is the problem of collecting a set of products in a warehouse in a minimum amount of time. It is currently a major bottleneck in supply-chain because of its cost in time and labor force. This article presents two exact and effective algorithms for this problem. Firstly, a sparse formulation in mixed-integer programming is strengthened by preprocessing and valid inequalities. Secondly, a dynamic programming approach generalizing known algorithms for two or three cross-aisles is proposed and evaluated experimentally. Performances of these algorithms are reported and compared with the Traveling Salesman Problem (TSP) solver Concorde. (C) 2018 Elsevier Ltd. All rights reserved.
Keyword:
Integer programming
Order picking
Steiner TSP
TSP
Dynamic programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
A new mathematical programming formulation for the Single-Picker Routing Problem用于单选择器路由问题的新数学规划公式
PREAI
分享收藏Million city traveling salesman problem solution by divide and conquer clustering with adaptive resonance neural networks.png)
NEURAL NETWORKS
NEURAL NETWORKSIF6.3
PREAI
分享收藏
查看更多内容