logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

Clustering-based order-picking sequence algorithm for an automated warehouse

delete2010-08-06
delete31
PRE
AI
B
Byung‐In Kim
S
Sunderesh S. Heragu *
R
Robert J. Graves
A
A. St. Onge
DOI：10.1080/0020754031000120005delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

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

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

International Journal of Production Research cover
International Journal of Production Research
IF:
7.3
Papers:
1.1W
Citations:
3.7W

Organization

No organization information available