透過您的圖書館登入
IP:3.138.200.66
  • 學位論文

粒子群演算法應用於物流中心批次人工揀貨之研究

Applying Particle Swarm Algorithm to the Batch Order Policies in Manual Picking System of Distribution Center

指導教授 : 胡黃德
若您是本文的作者,可授權文章由華藝線上圖書館中協助推廣。

摘要


在物流中心內部所涵蓋的作業範圍裡,揀貨作業是其中一項重要且繁雜的工作。揀貨作業時間佔整個物流中心作業時間比為30~40%,因此若能妥善規劃揀貨作業將能有效降低物流中心之營運成本。本研究主要在探討人工揀貨作業在物流中心之最佳化。本研究利用隨機批量法及最少走道批量法兩種方法搭配穿越策略及最大間隙策略兩種揀貨路徑法產生初始解。為了決定較佳之揀貨策略,本研究利用粒子群演算法進行改善,以找尋揀貨路徑之最佳解。本研究使用 MINITAB軟體分析不同的初始解方法、揀貨策略及載重限制其對物流中心批次人工揀貨之影響。實驗分析結果顯示,不同之初始解方法對於揀貨距離並無顯著影響。而不同之揀貨策略與載重限制在本研究中對於揀貨距離則都有顯著之影響。其中在不同之揀貨策略中,以最大間隙策略所得之揀貨距離最短。

並列摘要


The order picking is one of the important and complex operations in the distribution center. The order picking time accounts for 30%~40% of total operation time in distribution center. Hence, a well planned order picking strategy can reduce the operating cost of the distribution center effectively. In this study, the optimal order picking strategies were evaluated. We used two order batching methods (Random Batching and Least Aisle Batching) combined with two route planning methods (Traversal Strategy and Largest Gap Strategy) to determine the initial solutions. Then, we used Particle Swarm Optimization (PSO) to improve the initial solution and then tried to achieve the optimum solution. Finally, we utilized the MINITAB statistical software to test t the relationships among initial solutions, order picking strategies and the load limit of the picking cart. The results showed that the initial solutions had no statistical significance on the order picking distance. While order picking strategies and load limit had more influence on the order picking distance. We also found that the largest gap strategy had best performance in these simulation test problems.

參考文獻


周士俊,「塔布搜尋法應用於物流中心人工揀貨區揀貨問題」,元智大學工業工程與管理研究所,碩士論文,2000。
吳舲雨,「應用模擬退火法於批次訂單揀取環境下之物流中心人工揀貨系統」,元智大學工業工程與管理研究所,碩士論文,2008。
Elsayed, E. A. and Stern, R. G., “Computerized algorithms for order processing in automated warehousing systems,” International Journal of Production Research, 21 (4), pp. 579-586, 1983.
Gademann, N., Van de Velde, S., “Order Batching to Minimize Total Travel Time in a Parallel-Aisle Warehouse,” IIE Transactions, 37 (1), pp. 63–75, 2005.
Hall, R.W., “Distance Approximation for Routing Manual Pickers in a Warehouse,” IIE Transactions, 25 (4), pp. 77–87, 1993.

被引用紀錄


黃建興(2011)。應用和弦搜尋演算法求解多橫向通道之批次人工揀貨問題〔碩士論文,元智大學〕。華藝線上圖書館。https://doi.org/10.6838/YZU.2011.00361
林詠傑(2011)。運用一種有效率的方法於啟發式粒子群演算法找尋最佳專案排程〔碩士論文,元智大學〕。華藝線上圖書館。https://doi.org/10.6838/YZU.2011.00133

延伸閱讀