.png){kind=icon}
Return
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}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Integer programming
Order picking
Steiner TSP
TSP
Dynamic programming
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W
Organization
Cited Papers
Million city traveling salesman problem solution by divide and conquer clustering with adaptive resonance neural networks.png)
NEURAL NETWORKS
NEURAL NETWORKSIF6.3
PREAI
ShareSave
View more