1 A PERFORMANCE ANALYSIS MODEL OF ORDER PICKING WAREHOUSE DESIGN for TRANSPORTERS Kainan University 黃 興 錫 (Heung Suk Hwang) Department of Business Management,

Slides:



Advertisements
Similar presentations
Warehouse Management Luis Felipe Cardona.
Advertisements

Design of the fast-pick area Based on Bartholdi & Hackman, Chpt. 7.
Design of the fast-pick area
Exponential Distribution. = mean interval between consequent events = rate = mean number of counts in the unit interval > 0 X = distance between events.
Fast Algorithms For Hierarchical Range Histogram Constructions
Yaochen Kuo KAINAN University . SLIDES . BY.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.
Computer Integrated Manufacturing CIM
CHAPTER 8 A NNEALING- T YPE A LGORITHMS Organization of chapter in ISSO –Introduction to simulated annealing –Simulated annealing algorithm Basic algorithm.
Silberschatz, Galvin and Gagne  2002 Modified for CSCI 399, Royden, Operating System Concepts Operating Systems Lecture 19 Scheduling IV.
Continuous Probability Distributions
Final Exam Tuesday, December 9 2:30 – 4:20 pm 121 Raitt Hall Open book
Dynamic Tuning of the IEEE Protocol to Achieve a Theoretical Throughput Limit Frederico Calì, Marco Conti, and Enrico Gregori IEEE/ACM TRANSACTIONS.
ACM GIS An Interactive Framework for Raster Data Spatial Joins Wan Bae (Computer Science, University of Denver) Petr Vojtěchovský (Mathematics,
MODELING AND ANALYSIS OF MANUFACTURING SYSTEMS Session 14 WAREHOUSING E. Gutierrez-Miravete Spring 2001.
Decision Support Systems for Supply Chain Management Chap 10 王仁宏 助理教授 國立中正大學企業管理學系 ©Copyright 2001 製商整合科技中心.
Dynamic Pedestrian and Vehicular Modelling n J. MacGregor Smith & M. Blakey Smith Department of Mechanical and Industrial Engineering & Facilities PlanningDepartment.
CHAPTER 6 Statistical Analysis of Experimental Data
511 Friday Feb Math/Stat 511 R. Sharpley Lecture #15: Computer Simulations of Probabilistic Models.
Inferences About Process Quality
Basic Business Statistics, 10e © 2006 Prentice-Hall, Inc.. Chap 6-1 Chapter 6 The Normal Distribution and Other Continuous Distributions Basic Business.
Nonlinear Stochastic Programming by the Monte-Carlo method Lecture 4 Leonidas Sakalauskas Institute of Mathematics and Informatics Vilnius, Lithuania EURO.
1 Chapter 2 Basic Models for the Location Problem.
Slide Slide 1 Chapter 6 Normal Probability Distributions 6-1 Overview 6-2 The Standard Normal Distribution 6-3 Applications of Normal Distributions 6-4.
Copyright © Cengage Learning. All rights reserved. 13 Linear Correlation and Regression Analysis.
Using Network Simulation Heung - Suk Hwang, Gyu-Sung Cho
CA200 Quantitative Analysis for Business Decisions.
Design of double- and triple-sampling X-bar control charts using genetic algorithms 指導教授: 童超塵 作者: D. HE, A. GRIGORYAN and M. SIGH 主講人:張怡笳.
Groups of models Intra-Enterprise Planning Enterprise Planning itself Single Facility Location Models Multiple Facility Location Models.
Probability Quantitative Methods in HPELS HPELS 6210.
Container Freight Station 유재동 김정환 정철호 유재동 김정환 정철호.
The Logistic Network: Design and Planning
1 Introduction to Hypothesis Testing. 2 What is a Hypothesis? A hypothesis is a claim A hypothesis is a claim (assumption) about a population parameter:
FACILITY LAYOUT PROBLEM
New Modeling Techniques for the Global Routing Problem Anthony Vannelli Department of Electrical and Computer Engineering University of Waterloo Waterloo,
Traffic Engineering Studies (Travel Time & Delay Studies)
1 A Decision Analysis Model for Supplier Selection Using Fuzzy-AHP IMS 2005, Kunming, China July 1-10, 2005 Prof. Heung Suk Hwang, Department of Business.
The design of storage and handling facilities
Statistical Applications Binominal and Poisson’s Probability distributions E ( x ) =  =  xf ( x )
On Optimizing the Backoff Interval for Random Access Scheme Zygmunt J. Hass and Jing Deng IEEE Transactions on Communications, Dec 2003.
8/24/04 Paul A. Jensen Operations Research Models and Methods Copyright All rights reserved Material Movement The movement of material through the.
Performance Evaluation of Warehousing Units. Some general remarks In general, a difficult problem due the –large number of operational issues that must.
Chapter 7 Sampling Distributions Statistics for Business (Env) 1.
Machine interference problem: introduction
CHAPTER SEVEN ESTIMATION. 7.1 A Point Estimate: A point estimate of some population parameter is a single value of a statistic (parameter space). For.
Continuous Probability Distributions. A continuous random variable can assume any value in an interval on the real line or in a collection of intervals.
國立雲林科技大學工業工程與管理所 Graduate school of Industrial Engineering & Management, National Yunlin University of Science & Technology 系統可靠度實驗室 System Reliability.
Stochastic Optimization
Berlin, December 11 th 2012 Faculty of Mechanical Engineering · Chair of Logistics Engineering Network Optimization prior to Dynamic Simulation of AMHS.
Sampling Theory and Some Important Sampling Distributions.
Normal Normal Distributions  Family of distributions, all with the same general shape.  Symmetric about the mean  The y-coordinate (height) specified.
Robustness of the EWMA control chart to non-normality Connie M Borror; Douglas C Montgomery; George C Runger Journal of Quality Technology; Jul 1999; 31,
THREE DIMENSIONAL-PALLET LOADING PROBLEM BY ABDULRHMAN AL-OTAIBI.
Introduction A probability distribution is obtained when probability values are assigned to all possible numerical values of a random variable. It may.
Groundwater Systems D Nagesh Kumar, IISc Water Resources Planning and Management: M8L3 Water Resources System Modeling.
Chapter 8 Estimation ©. Estimator and Estimate estimator estimate An estimator of a population parameter is a random variable that depends on the sample.
AGENDA: QUIZ # minutes30 minutes Work Day PW Lesson #11:CLT Begin Unit 1 Lesson #12 UNIT 1 TEST 1 Thursday DG9 Fri.
Describing a Score’s Position within a Distribution Lesson 5.
FACILITIES PLANNING ISE310L SESSION 25 Warehouses, November 17, 2015 Geza P. Bottlik Page 1 OUTLINE Questions? Any supply chain or facilities stories or.
© 2010 Pearson Prentice Hall. All rights reserved Chapter Hypothesis Tests Regarding a Parameter 10.
Decision Support Systems for Supply Chain Management
胡政宏 國立成功大學工業與資訊管理學系 Cheng-Hung Hu
Computer Integrated Manufacturing CIM
Models of Traffic Flow 1.
AS/RS (Automated Storage/Retrieval System)
   Storage Space Allocation at Marine Container Terminals Using Ant-based Control by Omor Sharif and Nathan Huynh Session 677: Innovations in intermodal.
Chapter 7: Introduction to Sampling Distributions
Location models for airline hubs behaving as M/D/c queues
Presentation transcript:

1 A PERFORMANCE ANALYSIS MODEL OF ORDER PICKING WAREHOUSE DESIGN for TRANSPORTERS Kainan University 黃 興 錫 (Heung Suk Hwang) Department of Business Management, Kainan University, Taiwan ’ 倉儲系統與物料搬運研討會 逢甲大學工業工程與系統管理學系

2 Contents 1. INTRODUCTION 2. ORDER PICKING WAREHOUSE SYSTEM 3. SIMULATION MODEL FOR ORDER PICKING WAREHOUSE SYSTEM ANALYIS 4. SUMMARY AND CONCLUSIONS ☞ Demonstrate a Hyundai W-Car Problem Kainan University

3 1. Introduction ☞ Developed a performance evaluation model for order picking warehouse in supply center(SC) by reducing the travel distance of transporters ☞ We developed a two-step approach : - a mathematical model - a simulation model using AutoMod simulator ☞ Also we developed computer program and demonstrated the pro posed methods, ☞ Then we carryout numerical studies to compare the system performance improvement over the number of transporter in order picking warehouse. Kainan University

4 ☞ The major functions of the freight terminal system are : 1) Pickup and arrival, 2) Auto-sensing the freight information, 3) Auto-sorting, and 4) Delivery. Kainan University

5 Figure 1. Operating Cost Ratio of. General Warehouse Kainan University

6 Figure 2. Two-Step Approach of Order Picking Warehouse System Kainan University

7 2. Order Picking Warehouse System Figure 1. Freight Flow in Freight Terminal Kainan University

8

9 Figure 4. General Layout of Picking Warehouse Kainan University

Probabilistic Picking in Warehouse -We assumed that an item found in the i th aisle has the probability, This is proportional to the average of the turn over rate of all items found in a aisle or the number or racks for an item. Notations used : M : number of freight of an item, : number of item stored in the ware house : probability of picking item m : number of item stored in the ware house = number of item 1 n : number of picking of order or : number of picking of each items per an order picking, Kainan University

11 Prob ( picking n items in the warehouse where stored k items) = ( 1) where, means the probability of picking item in a picking. All the cases of picking of item k when a transporter repeats n times of picking with the probability, is given by, ( 2) Kainan University

12 The expected number of picking by a transporter : (3) -By the assuming that the probability that a pick comes from a randomly selected zone is 1/p where p is number of transporters or number of zones. -Thus the expected number of picks in pf a transporter or zone during a particular time period can be approximated using the binomial distribution -The upper limit of picking UL(the number of items retrieved by a transporter) can be determined by using the normal distribution to approximate the binomial distribution. as following The binomial distribution B(n, p) can be approximate as N(np, np(1-p)) Kainan University

13 Thus, = Kainan University

Optimal Size of Unit Rack Notations : AW : width of unit aisle(ft) AL : length of unit aisle(ft) LW : width of unit rack(ft) LL : length of unit aisle(ft) LH : width of unit aisle(ft) WM : number of aisle R : required through put( unit/hr or day) C : total length of rack(ft) TA : available space of system, VHV: horizontal speed of transporter(ft/hr) VVV : vertical speed of transporter(ft/hr) T : scale parameter of unit rack T: LL/VHV= LH/VVV

15 We formulate this problem as following : Min. WM St 2·LW·LH·WM = C (1) (AW + AL) ·((LW + LL) · WM + 1) = TA where, TU is given by following Eq. (2) (2) By Eq. 1 and 2, (3) and by Eq, 2 and 3, where, Kainan University

16 The algorithm to find WM is given by following 5 steps : step 1 : step 2 : if, go to step -4 Otherwise, go to step-3 step-3 :, go to step-2 step-4 : stop, WM = minimum number of aisle, Kainan University

17 We could find optimal size of aisle and the system performance as following : - number of aisle : WM - height of rack : - length of rack : - expected travel time(min) : - system utilization rate(%): utilization rate Kainan University

18 Numerical example to find WM and system utilization rate : S =, R = 294 picks n = 5 picks/trip, p = 0.25 Min/pick hv = 150 m/min, vv = 30 m/min k = 1.25 min/trip Number of aisle = 3 Height of rack = 4.1m Length of rack = 20.6m Expected Travel Time = 2.83 System Performance = 92.52% Kainan University

Travel Time Analysis Assumptions : - one picker in each zone, - each type of item in stored in one location, - sufficient supply of items in at each location, - items are picked along one side of an aisle at a time, - there are two sides to each aisle, - transporters travels through all the aisles, - items are randomly assigned to storage location within a facility, The total processing time : 1) The picking time is given by following equation : where, TN : number of transporter, : time for a transporter to pickup an item : number of all the items picked up by transporter, Kainan University

20 2) Traveling time : 3) Stop time for picking : Total process time per travel of transporter) = (picking time) + (traveling time) + (Stop time for each SHU Kainan University

21 4) Determining of the optimal number of transporters - dependent on total process time, number of aisle, its length and number of required amount to be retrieved. - It is very complicated problem Thus, we used a simulation method based on AutoMod simulator. Kainan University

22 3.Simulation Model for Order Picking Warehouse System Analysis - We modeled the same order picking warehouse system using AutoMod simulator. -We have run the simulation for 1000hours with following design parameters : Number of aisle = 3, height of rack = 4.1m, length of rack = 20.6m, C = 539 m 2, R = 294 picks, n = 5 picks/trip, p = 0.25 Min/pick, vhv = 150 m/min, vvv = 30 m/min, k = 1.25 min/trip Kainan University

23 Case 1 : Number Transporter = 1 Kainan University

24 Case 2 : Number Transporter = 2 Kainan University

25 Alter. of Trans DeliveringRetrieving Parking Per. of Total time Trips Made Averag e time sec/trip Per. of total time Trips made Av. time /trip Per. of Total time 150.0% % % % % % % % % % % % Table 1. Transporter Performance

26 Table 2. Material handling flows(Amount of throughput) Kainan University Alter. of Transporter (No. of Transporter) Total ThroughputWarehouse Utilization (%)

27 Figure 4. Total Throughput per Alternative of Transporter Kainan University

28 Sample problem of order picking systems - The picking utilization obtained from mathematical model is a little greater than that from simulation (92.52 > 61.3) - the optimal number of transporter : 3 - total throughput : There should be a minimum two line spaces between tables and - text. Kainan University

29 4. Conclusion - In this paper, we have presented an analysis for order picking systems by two-step approaches in this paper, mathematical and simulation model using AutoMod. - An algorithm for end-of-aisle is developed. - We have developed a computer program for the analytical method. - Computational results are presented on the relative performance of each type of methods. - These approaches have been compared with each other in terms of utilization of pickers, total throughput and handling time. Kainan University

30 Kainan University, Taiwan Prof. Heung-Suk Hwnag Thank You Kainan University