JOURNAL OF SHANDONG UNIVERSITY (ENGINEERING SCIENCE) ›› 2012, Vol. 42 ›› Issue (1): 66-71.

• Articles • Previous Articles     Next Articles

Compressible dynamic virtual window algorithm based on sequential picking strategy

WU Ying-ying, WU Yao-hua*, SHEN Chang-peng   

  1. School of Control Science & Engineering, Shandong University, Jinan 250061, China
  • Received:2011-07-14 Online:2012-02-20 Published:2011-07-14

Abstract:

 To shorten the length of the virtual window and reduce the order picking time, the picking device was improved and a compressible dynamic virtual window algorithm was proposed. A gravity buffer and a flashboard were added to each dispenser. The items were launched to the gravity buffer in which the gap between each other was at fiost compressed, and then merged to the conveyor from the gravity buffer. Therefore the items were close to each other on the conveyor and the length of the virtual window was shortened. A model of the compressible dynamic virtual window algorithm was built based on the sequential picking strategy. The simulation with 3 sets of data collected from a tobacco distribution center showed that the picking time could be reduced by 87.45%~87.77%, and the picking time was decreased when the launching time of the dispenser and the merging time of the gravity buffer increased.

Key words: virtual window, compressible dynamic virtual window algorithm, sequential picking, automated picking, picking time

No related articles found!
Viewed
Full text
298
HTML PDF
Just accepted Online first Issue Just accepted Online first Issue
0 0 0 0 0 298

  From Others local
  Times 51 247
  Rate 17% 83%

Abstract
858
Just accepted Online first Issue
0 0 858
  From Others local
  Times 856 2
  Rate 100% 0%

Cited

Web of Science  Crossref   ScienceDirect  Search for Citations in Google Scholar >>
 
This page requires you have already subscribed to WoS.
  Shared   
  Discussed   
No Suggested Reading articles found!