.png){kind=icon}
Return
Clustering-based order-picking sequence algorithm for an automated warehouse
.png){kind=icon}
PRE
AI
DOI：10.1080/0020754031000120005.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper addresses the order picking sequence problem in an automated warehouse where parts of an order picker's travelling tour are fixed, the length of the layout is significantly longer than the width, and the picker can hold only one item at a given time. The problem is to find an optimal sequence with given vertical paths and so it is a special type of travelling salesman problem. A simple sorting-based heuristic and an efficient clustering-based algorithm are developed for this problem. In order to use the gantry robots more efficiently, a flexible drop buffer assignment is considered and the proposed algorithms are modified for the new operating condition. Experimental results indicate the efficiency of the proposed algorithms.
Keywords:
TRAVELING SALESMAN PROBLEM
RETRIEVAL-SYSTEM
STORAGE
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.3
Papers:
1.1W
Citations:
3.7W
Organization
No organization information available
Cited Papers
ShareSave
Quercetin-3-O-β-d-glucuronopyranoside (QGC)-induced HO-1 expression through ERK and PI3K activation in cultured feline esophageal epithelial cells.png)
Fitoterapia
FitoterapiaIF0
PREAI
ShareSave
View more