臺灣博碩士論文加值系統

隨著電子商務的形成與顧客消費型態的改變，商品在市場上的需求已轉變成少量多樣性，使得物流中心變得比以往更繁忙，突顯物流中心之重要性，而物流成本中又以揀貨作業成本最爲重要，因此縮短揀貨作業時間與提高效率為本研究之目的。從文獻探討得知，揀貨路徑、儲區佈置之交叉走道設計是影響其揀貨作業效率主要因素，其中探討單一揀貨員情境居多，而多個揀貨員同時進行較少文獻探討。本研究以螞蟻演算法解決物流中心同時多個揀貨員之揀貨路徑問題，並與個案公司現有使用穿越策略方式作比較，結合系統模擬軟體ARENA設計各種不同交叉走道場景佈置組合，進行比較分析。本研究模式共有24種交叉組合，其揀貨路徑規劃方式有2種；揀貨員人數狀況有3種；交叉走道數狀況有4種 。
根據研究結果得知，當單一揀貨員時，揀貨路徑規劃使用ACO與3條交叉走道效果最好；當兩位揀貨員時，揀貨路徑規劃使用ACO與無交叉走道效果最好；當三位揀貨員時，揀貨路徑規劃使用ACO與無交叉走道效果最好。隨著交叉走道數量增加，可以降低揀貨行走時間，但影響總訂單完成時間並不顯著，並不能有效降低多個揀貨員同時揀貨所需的總訂單完成時間。

As Electronic commerce come into being and customer’s consuming modality changes, the demand of commodity in the market has turn into diversity of few, and it makes the distribution center busier than ever and highlight the importance of the distribution center, and the costs of order picking operating is the most important part of the logistics costs, so this research aims to reduce the order picking operating time and increase efficiency. It is indicated in literatures that Order Picking Routing and Cross Aisle design of ambry layout are the main elements that will affect order picking operating efficiency, and most situations discussed in literatures are about single picker and few discussed about several pickers. This research solves the Order Picking Routing problem when there are several pickers in the distribution center by ACO, and compared with Traversal Strategy used by company in individual cases, combining with system simulation software ARENA to design all kinds of different Cross Aisle scene setting combination to compare and analyze. There are twenty four kinds of cross combination models in this research, and in it there are two kinds of Order Picking Routing Planning model, three kinds of picker amount status, and four kinds of Cross Aisle quantity status. It is known from the research results that when there is single picker, Order Picking Routing Planning using ACO and three Cross Aisle has the best effect; when there are two pickers, Order Picking Routing Planning using ACO without Cross Aisle has the best effect; when there are three pickers, Order Picking Routing Planning using ACO without Cross Aisle has the best effect. As Aisle quantity increase, it can reduce the order picking operating time but has no obvious effect on Total Time because it can’t reduce the Total Time need by several pickers.

誌謝 I
摘要 II
ABSTRACT III
目錄 IV
圖目錄 VI
表目錄 VIII
第一章 緒論 1
1.1研究背景 1
1.2研究動機 3
1.3研究目的 5
1.4論文流程 5
第二章 文獻探討 8
2.1物流 8
2.1.1物流定義 8
2.1.2物流中心 9
2.2揀貨儲區佈置 12
2.3.1揀貨出入點 12
2.3.2交叉走道設計 12
2.3儲位策略 13
2.4儲位指派策略 15
2.5訂單揀取策略 16
2.6揀貨路徑規劃 17
2.7銷售員旅行問題 22
2.8螞蟻演算法 23
2.9系統模擬 26
第三章 研究問題與方法27
3.1個案公司問題描述 27
3.2問題假設 28
3.3研究環境 30
3.4研究架構 32
3.5路徑規劃策略 34
3.5.1穿越策略 34
3.5.2螞蟻演算法 39
3.6ARENA系統模擬 46
3.6.1模擬架構 46
3.6.2ARENA模擬模式 48
3.6.3ARENA符號定義 49
3.6.4ARENA公式 51
3.6.5ARENA參數設定 51
3.7績效指標 56
第四章 實驗結果與分析58
4.1模擬實驗設計 58
4.2實驗數據比較分析 60
4.2.1揀貨路徑規劃 60
4.3實驗結果 68
4.3.1揀貨路徑規劃 68
4.3.2ARENA模擬 71
4.4實驗結果 80
第五章 結論與未來研究83
5.1研究結論 83
5.2未來研究建議 85
參考文獻 86

沈武賢 (2000)。物流中心儲區通道佈置之規劃。國立雲林科技大學工業工程與管理研究所碩士論文。
美國SOLE國際物流協會台灣分會、台灣全球運籌發展協會 (2010)。物流與運籌管理(二版)。台北市：美國SOLE國際物流協會臺灣分會出版 。頁22-135。
孫海蛟、董福慶 (1995)。物流中心儲位管理 (初版)。台北市：經濟部商業自動化系列叢書。頁55-62。
張福榮 (2006)。物流業經營管理 (三版)。台北市：五南出版。頁278。
郭麗華 (2004)。具兩條之上橫向走道的揀貨倉庫之訂單批次化問題探討。國立中央大學工業管理研究所碩士論文。
陳建良、杜志挺、饒忻、王木坤、姜世川 (1996)。物流中心揀貨路徑之研究。中華民國工業工程學會八十五年年會論文集(二) 。頁448-454。
陳慧娟 (1995) 。物流中心作業系統 (初版)。台北市 ：經濟部商業自動化系列叢書。頁12。
曾麗潔 (2006) 。多樓層揀貨系統規劃。國立雲林科技大學工業工程與管理研究所碩士論文。
經濟部商業司 (2004) 。台灣物流年鑑 (初版)。台北市：經濟部。
董福慶 (1995) 。物流中心揀貨作業 (初版)。台北市：經濟部商業自動化系列叢書。頁15-37。
羅國書(2001) 。電子零售商的最佳化貨品揀取。國立中央大學工業管理研究所碩士論文。
蘇隆德 (1997) 。現代化物流對商業流通發展之影響。中華民國商業流通研討會論文集。頁19。
Ashayeri, J. & Goetschalckx, M. (1989). Classification and design of order picking. Logistic World, 99-106.
Ballou, R. H. (1992). Business Logistics Management. New York: Prentice-Hall.
Bodin, L., Golden, B., Assad, A., & Ball, M. (1992). Routing and scheduling of vehicle and crews. Computers and Operations Research, 10, 63-211.
Bozer, Y. A. & White, J. A. (1984). Travel-time models for automated storage/ retrieval systems. IIE Transactions, 16(4), 329-338.
Brynzer, H. & Johansson, M. I (1996). Storage location assignment: Using the product structure to reduce order picking times. International Journal of Production Economics, 46-47, 595-603.
Cortes, P., Larraneta, J., & Onieva, L. (2004). Genetic algorithm for controllers in elevator groups: analysis and simulation during lunchpeak traffic. Applied Soft Computing, 4, 159-174.
De Koster, R., Le-Duc, T., & Roodbergen, K.J. (2007). Design and control of warehouse order picking: a literature review. European Journal of Operational Research, 182(2), 481-501.
Dorigo, M. & Gambardella, L.M. (1997). Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE T EVOLUT COMPUT, 1(1), 53- 66.
Dorigo, M. (1992). Optimization, learning and natural algorithms. PhD Thesis, Dipartimento di Elettronica, Politecnico di Milano, Italy.
Dorigo, M., Maniezzo, V., & Colorni, A. (1996). The ant system: Optimization by a colony of cooperating agents. IEEE T SYST MAN CY B, 26(2), 29- 41.
Hani, Y., Amodeo, L., Yalaoui, F., & Chen H. (2008). Simulation based optimization of a train maintenance facility. Journal of Intelligent Manufacturing, 19(3), 293-300.
Hwang, H. & Lee, M. K. (1988). Order batching algorithms for a man-on-board automated storage and retrieval system. Engineering Costs and Production Economics, 13(1), 285-294.
Jewkes, E., Lee, C., & Vickson, R. (2004). Product location, allocation and server home base location for an order picking line with multiple servers. Computers & Operations Research, 31, 623-626.
Johnson, J., Roberts, T. L., Verplank, W., Smith, D. C., Irby, C. H., Beard, M., & Mackey, K. (1989). The Xerox Star: A retrospective. IEEE Computer, 22(9), 11-29.
Kelton, D.W., Sadowski, P.R., & Sturrock, T.D. (2008). Simulation with Arena (4th ed.). New York: McGraw-Hill.
Koster, R. D. & Poort, E. V. D. (1998). Routing orderpickers in a warehouse: a comparison between optimal and heuristic solution. IIE Transactions, 30(5), 469-480.
Lawler, E. L., Lenstra, J. K., Kan, A. H. G. R., & Shmoys, D. B. (1985). The traveling salesman problem: a guided tour of combinatorial optimization. New York: John Wiley and Sons.
Linn, R. J. & Wysk, R. A. (1987). An analysis of control strategies for an automated storage/retrieval system. Inf. Systems Opl Res., 25(1), 66-83.
Pan, J. C.H. & Wu, M. H. (2008). Throughput analysis for order picking system with multiple pickers and aisle congestion considerations. Submitted to Computers & Operations Research.
Petersen, C. G. & Aase, G. (2004). A comparison of picking, storage, and routing policies in manual order picking. International Journal of Production Economic, 92, 11-19.
Petersen, C. G. (1997). An evaluation of order picking routeing policies. International Journal of Operations & Production Management, 17(11), 1098-1111.
Ratliff, H. D. & Rosenthal, A. S. (1983). Order-picking in a rectangular warehouse: a solvable case of the traveling salesman problem. Operations Research, 31(3), 507-521.
Roodbergen, K. J. & Koster, R. D. (2001a). Routing order pickers in a warehouse with a middle aisle. European Journal of Operational Research, 133, 32-43.
Roodbergen, K. J. & Koster, R. D. (2001b). Routing methods for warehouse with multiple cross aisles. International Journal of Production Research, 39, 1865-1883.
Rosenblatt, M. J. & Eynan, A. (1989). Deriving the optimal bounders for class-based automatic storage/retrieval systems. Management Science, 35(12), 1519-1524.
Sharp, G. & Krueger, K.W. (2000). A simulation software tool for orderpicking in a person-aboard storage/retrieval system.
Takakuwa, S., Hiroki, T., Kumiko, I., & Shinichiro, H. (2000). Simulation and analysis of non-automated distribution warehouses. Proceedings of the 2000 Winter Simulation Conference.
Vaughan, T. S. & Petersen, C. G. (1999). The effect of warehouse cross aisles in order picking efficiency. International Journal of Production Research, 37(4), 881-897.