.png){kind=icon}
返回
Clustering-based order-picking sequence algorithm for an automated warehouse
.png){kind=icon}
PRE
AI
DOI：10.1080/0020754031000120005.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
TRAVELING SALESMAN PROBLEM
RETRIEVAL-SYSTEM
STORAGE
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.3
论文数:
1.1W
被引数:
3.7W
机构
暂无机构信息
引用论文
分享收藏
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
分享收藏
查看更多内容