(3.238.98.214) 您好!臺灣時間:2021/05/08 12:28
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果

詳目顯示:::

我願授權國圖
: 
twitterline
研究生:侯偉芳
研究生(外文):Wei-Fang Hou
論文名稱:比較不同揀貨策略對揀貨時間的影響
論文名稱(外文):A comparative study of different picking, routing, and storage policies for a picker-to-part warehouse
指導教授:潘昭賢潘昭賢引用關係
指導教授(外文):Chao-Hsien Pan
學位類別:碩士
校院名稱:國立臺灣科技大學
系所名稱:工業管理系
學門:商業及管理學門
學類:其他商業及管理學類
論文種類:學術論文
論文出版年:2008
畢業學年度:96
語文別:英文
論文頁數:51
中文關鍵詞:揀貨作業儲位指派COIClass-based種子演算法
外文關鍵詞:order pickingstorage assignment policywarehouse managementCOI indexclass-based storageseed algorithms
相關次數:
  • 被引用被引用:0
  • 點閱點閱:253
  • 評分評分:系統版面圖檔系統版面圖檔系統版面圖檔系統版面圖檔系統版面圖檔
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
 本研究的主題是比較物流中心的揀貨策略。我們利用電腦模擬現實的物流中心揀貨作業,用不同的策略進行揀貨,以得到不同的操作時間。而操作時間越長代表該策略可以節省的成本越少,即該策略的效益越差;若操作時間越短代表該策略的效益越好,而且比較適合用在我們決定的倉儲環境中。
  我們考慮的揀貨策略包括批次的組合策略、路徑策略、儲位指派策略,每種策略有三至十種變化方式。每一次要執行揀取任務時,就從這三種策略中選擇要使用的作業方式。我們還會改變每次揀貨的批次數量,觀察不同批次數量是否會對選擇的策略造成影響。最後分析作業時間,找出最佳的組合策略。當批次數量比較小的時候,最適合用Class-based 儲存策略和Midpoint路徑策略;如果批次數量超過40,則比較適合用隨機儲存策略和Traversal路徑策略。
The subject of this study is a comparison of order picking, storage, and routing policies in manual order picking system. We simulate the real order picking process in warehouse by Flexsim software, and select different picking policies in order to get different picking time. We use picking time to calculate the cost reduction of used policies. If the picking time is larger, the cost reduction must be lower, and the performance of used policies is also worse. Oppositely, if the picking time is lower, and the performance of used policies must be better. Then the used policies are suitable for the warehouse.
The picking policies we used include batching, routing, and storage policies. The number of levels of these policies is from three to ten. Number of batch size is also a factor that may affect the picking time. Hence we change number of batch size and the three picking policies for finding the best combination. When number of batch size is small, Class-based storage policy and Midpoint routing policy perform lowest picking time. When number of batch size is larger than forty, Random storage policy and Traversal routing policy would be the best policies.
CONTENTS
ABSTRACT III
CONTENTS 4
TABLE INDEX 6
FIGURE INDEX 7
CHAPTER 1 8
CHAPTER 2 10
2.1. Order picking process 10
2.2. Storage assignment 12
2.2.1 COI-based storage 12
2.2.2. Class-based storage 14
2.3. Routing policies 15
2.4. Batching heuristics 16
2.4.1 Savings algorithms 18
2.4.2 EQUAL and SL algorithms 18
2.4.3 CWright 19
2.4.4. Seed algorithms 20
CHAPTER 3 22
3.1. Description of simulation model 23
3.2. Experiments 24
3.2.1. Batching policies 25
3.2.2. Storage policies 26
3.2.3. Routing policies 26
3.2.4. Summary of experimental design 27
CHAPTER 4 28
4.1. Basic analysis 28
4.1. Results of batching heuristics 30
4.1.1. Performance in travel time 30
4.1.2. Seed algorithms 32
4.2. Results of routing policies 34
4.2.1. Combinations of batching heuristics and routing policies 34
4.2.2. Combinations of storage and routing policies 36
4.3. Results of storage policies 39
4.3.1 Combinations of storage heuristics and batching policies 39
4.3.2 Combinations of storage heuristics and routing policies 39
4.3.2. Comparison between storage policies 43
4.4. How to select the suitable policies 44
CHAPTER 5 46
Reference 48
1.Brynzer, H., Johansson, M.I., 1995. Design and performance of kitting and order picking systems. InternationalJournal of Production Economics 41, 115–125.
2.Caron, F., Marchet, G., Perego, A., 1998. Routing policies and COI-based storage policies in picker-to-part systems. International Journal of Production Research 36 (3), 713–732.
3.Caron, F., Marchet, G., Perego, A., 2000. Optimall ayout in low-level picker-to-part systems. International Journal of Production Research 38 (1), 101–117.
4.Clarke, G., Wright, W., 1964. Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 12, 568–581.
5.Coyle, J.J., Bardi, E.J., Langley, C.J., 1996. The Management of Business Logistics, 6th Edition. West Publishing, St. Paul, MN.
6.Choe, K., Sharp, G.P., Serfozo, R.S., 1993. Aisle-based order pick systems with batching, zoning and sorting. Progress in Material Handling Research 1992, pp. 245–276.
7.De Koster, M.B.M., Van der Poort, E.S., Wolters, M., 1999. Efficient orderbatching methods in warehouses. International Journal of Production Research 37 (7), 1479–1504.
8.De Koster, Tho Le-Duc, Keefs Jan Roodbergen, 2006. Design and control of warehouse order picking: A literature review. European Journal of Operational Research 182 (2007) 481–501
9.Drury, J., 1988.Towards more efficient order picking. IMM Monograph No. 1, Report, The Institute of Materials Management, Cranfield, UK.
10.Elsayed, E.A., 1981. Algorithms for optimal material handling in automatic warehousing systems. International Journal of Production Research 19 (5), 525–535.
11.Elsayed, E.A., Unal, O.I., 1989. Order batching algorithms and travel-time estimation for automated storage/retrieval systems. International Journal of Production Research 27, 1097–1114.
12.Eynan, A., Rosenblatt, M.J., 1994. Establishing zones in single-command class-based rectangular AS/RS. IIE Transactions 26 (1), 38–46.
13.Gibson, D.R., Sharp, G.P., 1992. Order batching procedures. European Journal of Operational Research 58, 57–67.
14.Gray, A.E., Karmarkar, U.S., Seidmann, A., 1992. Design and operation of an order-consolidation warehouse: Models and application. European Journal of Operational Research 58, 3–13.
15.Graves, S.C., Hausman, W.H., Schwarz, L.B., 1977. Storage retrieval interleaving in automatic warehousing systems. Management Science 23, 935–945.
16.Goetschalckx, M., Ratliff, D.H., 1988. An efficient algorithm to cluster order picking items in a wide aisle. Engineering Costs and Production Economy 13, 263–271.
17.Goetschalckx, M., Ashayeri, J., 1989. Classification and design of order picking systems. Logistics World (June), 99–106.
18.Heskett, J.L., 1963. Cube-per-order index – A key to warehouse stock location. Transport and Distribution Management 3, 27–31.
19.Heskett, J.L., 1964. Putting the cube-per-order index to work in warehouse layout. Transport and Distribution Management 4, 23–30.
20.Hausman, W.H., Schwarz, L.B., Graves, S.C., 1976. Optimal storage assignment in automatic warehousing systems. Management Science 22 (6), 629–638.
21.Hwang, H., Baek, W., Lee, M., 1988. Cluster algorithms for order picking in an automated storage and retrieval system. International Journal of Production Research 26, 189–204.
22.Hwang H. and D. G. KIM, 2005. Department of Industrial Engineering, Korea Advanced Institute of Science and Technology 373-1, Guseong-dong, Yuseong-gu, Daejeon, Korea
23.Hwang, H.S., Cho, G.S. 2006. A performance evaluation model for order picking warehouse design. Computers and Industrial Engineering 51 (2), pp. 335-34
24.Hall, R.W., 1993. Distance approximation for routing manual pickers in a warehouse. IIE Transactions 25, 77–87.
25.Jarvis, J.M., McDowell, E.D., 1991. Optimal product layout in an order picking warehouse. IIE Transactions 23 (1), 93–102.
26.Le-Duc, T., De Koster, R., 2004. Travel distance estimation in a single-block ABC storage strategy warehouse. In: Fleischmann, B., Klose, B. (Eds.), Distribution Logistics: Advanced Solutions to Practical Problems. Springer, Berlin, pp. 185–202.
27.Le-Duc, T., De Koster, R., 2005. Layout optimization for class-based storage strategy warehouses. In: de Koster, R., Delfmann, W. (Eds.), Supply Chain Management – European Perspectives. CBS Press, Copenhagen, pp. 191–214.
28.Malmborg, C.J., Bhaskaran, K., 1987. On the optimality of the cube per order index for conventional warehouses with dual command cycles. Material Flow 4, 169–175.
29.Malmborg, C.J., Bhaskaran, K., 1989. Optimal storage assignment policies for multiaddress warehousing systems. IEEE Transactions on Systems, Man and Cybernetics 19 (1), 197– 204.
30.Malmborg, C.J., Bhaskaran, K., 1990. A revised proof of optimality for the cube-per-order index rule for stored item location. Applied Mathematical Modelling (14), 87–95.
31.Malmborg, C.J., 1995. Optimization of Cubic-per-Order Index layouts with zoning constraints. International Journal of Production Research 33 (2), 465–482.
32.Muppani, V.R., Adil, G.K. 2008. Efficient formation of storage classes for warehouse storage location assignment: A simulated annealing approach. Omega 36 (4), pp. 609-618
33.Pan, C.H., Liu, S.Y., 1995. A comparative study of order batching algorithms. Omega International Journal of Management Science 23 (6), 691–700.
34.Petersen, C.G., 1997. An evaluation of order picking routing policies. International Journal of Operations & Production Management 17 (1), 1096–1111.
35.Petersen, C.G., Schmenner, R.W., 1999. An evaluation of routing and volume-based storage policies in an order picking operation. Decision Sciences 30 (2), 481–501.
36.Petersen, C.G., 2000. An evaluation of order picking policies for mail order companies. Production and Operations Management 9 (4), 319–335.
37.Petersen, C.G., Aase, G., 2004. A comparison of picking, storage, and routing policies in manual order picking. International Journal of Production Economics 92, 11–19.
38.Ratliff, H.D., Rosenthal, A.S., 1983. Orderpicking in a rectangular warehouse: A solvable case of the traveling salesman problem. Operations Research 31 (3), 507–521.
39.Riccard Manzini., Mauro Gamberi., A. Persona, Alberto Regattieri, 2005, Design of a class based storage picker to product order picking system. International Journal Advantage Manuf Technol (2007) 32: 811-821
40.Roodbergen, K.J., Koster, R., 2001. Routing methods for warehouses with multiple cross aisles. International Journal of Production Research 39 (9), 1865–1883.
41.Rosenblatt, M.J., Roll, Y., 1984. Warehouse design with storage policy considerations. International Journal of Production Research 22 (5), 809–821.
42.Ruben, R.A., Jacobs, F.R., 1999. Batch construction heuristics and storage assignment strategies for walk/ride and pick systems. Management Science 45 (4), 575–596.
43.Tompkins, J.A., White, J.A., Bozer, Y.A., Frazelle, E.H., Tanchoco, J.M.A., 2003. Facilities Planning. John Wiley & Sons, NJ.
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top
無相關期刊
 
系統版面圖檔 系統版面圖檔