By Topic

Research on the schedule algorithm of the order picking optimization problem in bend aisle warehouse

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yu Zhang ; Comput. Sch., Beijing Inf. Sci. & Technol. Univ., Beijing, China ; Yangsen Zhang

With the technical requirements for automated stereoscopic warehouse increasingly, the application of bend aisle stereoscopic warehouse is more and more extensive. Through taking the stereoscopic automated warehouse in Qinhuangdao as a research object, This paper describes the order picking path optimization and scheduling algorithm for bend aisle, solves the problem of a stacker's order picking in two-tunnel.

Published in:

Fuzzy Systems and Knowledge Discovery (FSKD), 2010 Seventh International Conference on  (Volume:1 )

Date of Conference:

10-12 Aug. 2010