Conceptual Warehouse Design Algorithm Using a Network Flow Model

Currently, third-party logistics (3PL) services are growing rapidly. In the current business climate, the goal of each 3PL firm is to reduce the time required for warehouse design. In this paper, a warehouse design problem is discussed. The problem is to determine the number of machines used in a warehouse and the product flow among the devices. In the conventional design process, such a problem would be solved with experimental and intuitional approaches. However, conventional approaches require large amounts of time. In addition, the design outcome is dependent on the skill of the designer. In order to provide theoretical guidelines for the design itself and shorten the design process, we propose a new design method using an extended network flow model. The network flows are expressed as the combination of the flow in the preparation time and that in the lead time. The mathematical model is constructed and solved as a threshold optimization algorithm including the mixed integer linear programming problem. We then evaluated the feasibility of the proposed model and method using real data, and confirmed the effect of the proposed method with regard to time reduction and the obtained design results.

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

[2]  Jun Ota,et al.  Development of design algorithm for logistics networks , 2004, 2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) (IEEE Cat. No.04CH37566).

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

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

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

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

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

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

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

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

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

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

[13]  Jun Ota,et al.  Scheduling multiple agents for picking products in a warehouse , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

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

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