Analytic Flow Design Method for an Automated Distribution Center with Multiple Shipping Areas

Abstract An analytic flow design algorithm for an automated distribution center with multiple shipping areas is presented. The main elements of the analytic flow design are the number of devices and the volumes of product flow between the devices. In the design of an automated distribution center, it is necessary to satisfy the demand throughput while minimizing construction costs. In the conventional design process, system engineers utilize experimental and intuitional approaches. However, conventional approaches are time-consuming and the design outcome is dependent on the skill of the designer. Therefore, a theoretical design algorithm is needed. We propose an analytic flow design algorithm using a dynamic network flow model and considering time-variable flow volumes according to shipment and storage schedules. To verify the feasibility of the proposed method, we perform analytic flow design using real data and confirm that the proposed method can yield a feasible analytic flow design in several minutes.

[1]  Byung Chun Park,et al.  An optimal dwell point policy for automated storage/retrieval systems with uniformly distributed, rectangular racks , 2001 .

[2]  Uday S. Karmarkar,et al.  Design and operation of an order-consolidation warehouse: Models and application , 1992 .

[3]  Maria Grazia Scutellà,et al.  Distribution network design: New problems and related models , 2005, Eur. J. Oper. Res..

[4]  Jeroen P. van den Berg,et al.  Simulation study of an automated storage/retrieval system , 2000 .

[5]  Ailsa H. Land,et al.  An Automatic Method of Solving Discrete Programming Problems , 1960 .

[6]  Jun Ota,et al.  Metaheuristic scheduling of multiple picking agents for warehouse management , 2008, Ind. Robot.

[7]  Russell D. Meller,et al.  Cost and Throughput Modeling of Manual and Automated Order Fulfillment Systems , 2003 .

[8]  W. H. M. Zijm,et al.  Warehouse design and control: Framework and literature review , 2000, Eur. J. Oper. Res..

[9]  A.J.R.M. Gademann,et al.  An order batching algorithm for wave picking in a parallel-aisle warehouse , 1996 .

[10]  P. C. Schuur,et al.  Mathematical model for warehouse design and product allocation , 2005 .

[11]  Ali Amiri,et al.  Production , Manufacturing and Logistics Designing a distribution network in a supply chain system : Formulation and efficient solution procedure , 2005 .

[12]  A. Land,et al.  An Automatic Method for Solving Discrete Programming Problems , 1960, 50 Years of Integer Programming.

[13]  Pascal Van Hentenryck,et al.  A simple tabu search for warehouse location , 2004, Eur. J. Oper. Res..

[14]  Rommert Dekker,et al.  Improving Order-Picking Response Time at Ankor's Warehouse , 2004, Interfaces.

[15]  Jun Ota,et al.  Conceptual Warehouse Design Algorithm Using a Network Flow Model , 2009, Adv. Robotics.

[16]  Mats I. Johansson,et al.  Storage Location Assignment: Using the Product Structure to Reduce Order Picking Times , 1996 .

[17]  J. Beasley Lagrangean heuristics for location problems , 1993 .

[18]  Marc Goetschalckx,et al.  A Framework for Systematic Warehousing Design 18-May-2001 , 2001 .