利用蟻群最佳化解決儲位重整問題

Ant Colony Optimization For Storage Recombination Problems

鄭佳惠(Chia-Hui Cheng)

指導教授 ： 皮世明

中原大學/商學院/資訊管理研究所/碩士(2018年)

https://doi.org/10.6840/cycu201800204

摘要

倉儲佔公司營運實體成本20%，其中揀貨作業又佔倉儲成本50%。透過儲位重整可將有限的倉儲空間重新再利用，進而影響後續出貨作業倉庫人員揀貨作業時間。本研究以儲位重整之儲位空間經過有效的重新排列後，整理出最佳化的空間應用，藉由建構問題之數學規劃模式，再利用螞蟻演算法解決儲位重整路徑問題，在可接受的成本範圍下內，發展一套有系統之求解方法，應用儲位重整搬移之距離數學模型，以「最小化搬移距離」為求解目的，找出最佳路徑，首先提出方法第一階段從既有儲位相關資料，加以計算各儲位已使用比率及儲位間距離，根據推算比對後產生儲位重整資訊，使得調整儲區各儲位全空狀態之儲位數增加；第二階段再將需儲位重整的儲位以蟻群最佳化加以求解最短路徑，經模擬結果發現，此方法與現有儲位重整模式比較，經過演算法精算後發現，(1)採行本方法可增加儲位空儲位數且(2)儲位重整移動距離較短，研究結果可提供倉庫人員之儲位重整參考資訊。

關鍵字

蟻群最佳化 ； 儲位重整 ； 路徑規劃

並列摘要

In a company, warehousing accounts for 20% of the operating costs, and picking operations account for 50% of storage costs. Therefore, storage through the reorganization can be effectively reused these spaces, thereby affecting the follow-up operation of the warehouse staff picking operation time. In this study, after the rearrangement of storage spaces, the optimal spatial applications are sorted out. By constructing the mathematical programming model of problems and using the ant algorithm to solve the storage and the reconstruction path problem. Within a reasonable range of costs, a systematic solution method is developed to solve the "minimizing the moving distance" and find the optimal path by applying the mathematical model of the distance of storage and reorganization moving. There are two stages in this study, the first phase is based on the existing data, to calculate the ratio and the distance of the storage space, according to the calculation and reconstruction of storage after the reorganization of data to make adjustment of the storage area of all storage status of the empty state of storage increased in the second stage, the storage location that needs to be stored and rebuilt is solved by the ant colony optimization to find the shortest path. The simulation results suggest that this method is compared with the existing storage location reorganization mode. After the algorithm is actuated to (1) The method can increase the number of storage spaces and (2) the storage and reconstruction of the shorter moving distance, and the results of this study can provide some reference for the warehouse staff.

並列關鍵字

Ant Colony Optimization ； Storage Recombination Problem ； Path Planning

參考文獻

1. Bullnheimer, B., Hartl, R. F., & Strauss, C. (1999). An improved ant System algorithm for thevehicle Routing Problem. Annals of operations research, 89, 319-328.

2. Chan, F. T., & Chan, H. K. (2011). Improving the productivity of order picking of a manual-pick and multi-level rack distribution warehouse through the implementation of class-based storage. Expert Systems with Applications, 38(3), 2686-2700.

3. Dorigo, M., & Gambardella, L. M. (1997). Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Transactions on evolutionary computation, 1(1), 53-66.

4. Eldemir, F., Graves, R., & Malmborg, C. (2004). New cycle time and space estimation models for automated storage and retrieval system conceptualization. International Journal of Production Research, 42(22), 4767-4783.

5. Frazelle, E. (2002). World-class warehousing and material handling (Vol. 1): McGraw-Hill New York.