後續研究與建議

本研究之結果提供物流業者一整合規劃之研究，包括儲存策略、訂單批 量與揀貨路徑規劃，仍有其他議題未能探討，且本研究經模擬實驗與結果分 析後，亦發現本研究中尚有其他可能之發展性，於此，將條列出以下數點，

以供後續學者深入探討。

一、本研究成功應用粒子群最佳化演算法於揀貨路徑規劃中，未來可利用粒 子群最佳化演算法之特性，應用規劃其他影響物流中心之因子，如儲位 指派與訂單批量。

二、本研究僅考慮儲位於同一平面之倉儲佈置環境，未考慮垂直儲位存取之 問題，故未來可考慮於有垂直儲料架時，儲存策略、儲位指派與揀貨路 徑規劃之問題。

三、本研究僅考慮單一揀貨員之揀貨情形，未考慮到實際物流中心裡多位揀 貨員同時進行揀貨之情形，因此未來可考慮多位揀貨員同時執行揀貨作 業，並尋找出最佳人力需求數量，且於多揀貨員之倉儲系統下，可能發 生走道壅塞問題，所以未來可以一併考慮之。

四、未來可合併考慮不同的倉儲佈置形式，如不同 I/O 點位置、不同長寬比 之倉儲大小、多交叉走道…等，進行模擬分析比較，使得對倉儲系統中 各影響因子更加了解。

五、未來可考慮將本研究架構應用於特定產業或特定倉儲環境，以驗證本研 究所提出之方法應用於實務上的可行性與績效表現，如此能提供物流中 心業者更直接的建議與幫助。

參考文獻

1. 林嘉慶(2004)，「運用關聯法則技術於倉儲系統儲位指派與揀貨策略配置 模型之研究」，中華大學科技管理研究所碩士論文。

2. 孫海皎、董福慶(1995)，「物流中心儲位管理」，經濟部商業自動化系列叢 書。

3. 郭麗華(2004)，「具兩條以上橫向走道的揀貨倉庫之訂單批次化問題探 討」，中央大學工業管理研究所碩士論文。

4. 曾裕茵(2003)，「物流中心之訂單批次化與揀貨路徑問題探討」，中央大 學工業管理研究所碩士論文。

5. 蘇騰昇(2002)，「物流中心之最佳化揀貨策略」，國立中央大學工業管理研 究所碩士論文。

6. Agrawal, R., T. Imielinski, and Swami, A. (1993), “Mining Association Rules between Sets of Items in Large Data Bases,”In Proceedings of the ACM SIGMOD Conference in Management of Data, Washington, DC, USA, pp.

207-216.

7. Al-Awami, A. T., Y. L. Abdel-Magid, and Abido, M. A. (2007), “A Particle-Swarm-Based Approach of Power System Stability Enhancement with Unified Power Flow Controller,”InternationalJournalofElectricalPowerand Energy Systems, Vol. 29, No. 3, pp. 251-259.

8. Ben-Mahmud, Y. (1987),“TheEffect of Warehouse Layout on Order Picking efficiency,”Unpublished M.S. thesis, Oregon State University, Corvallis, OR.

9. Caron, F., G. Marchet, and Perego, A. (2000), “Layout Design in Manual Picking Systems: a Simulation Approach,”Integrated Manufacturing Systems, Vol. 11, No. 2, pp. 94-104.

10. Choe, K. and Sharp, G. P. (1991),“SmallParts Order Picking: Design and Operation,” Vailable on-line at:

http://www.isye.gatech.edu/logisticstutorial/order/article.htm (accessed May 2005).

11. Coyle, J. J., E. J. Bardi, and Langley, C. J. (1996), “The Management of Business Logistics,”StPaul,MN:West.

12. De Koster, M. B. M., E. S. Van Der Poort, and Wolters, M., (1999), “Efficient

Orderbatching Methods in Warehouses,”International Journal of Production Research, Vol. 37, No. 7, pp. 1479-1504.

13. De Koster, R., T. Le-Duc, and Roodbergen, K. J. (2007), “Design and Control of Warehouse Order Picking: a Literature Review,”European Journal of Operational Research Vol. 182, No. 2, pp. 481-501.

14. Dorigo, M. (1992), “Optimization,Learning and NaturalAlgorithms,”Ph.D.

Thesis. Politecnico di Milano, Italy, EU.

15. Dorigo, M. and Caro, G. D. (1999), “Ant Colony Optimization：a New Meta-Heuristic,” Proceedings of the 1999 Congress on Evolutionary Computation, IEEE Press, Washington D.C., USA, Vol. 2, pp.1470-1477.

16. Dorigo, M. and Gambardella, L. M. (1997), “AntColonies for the Traveling Salesman Problem,”Biosystem,Vol.43, No. 2, pp.73-81.

17. Dorigo, M. and Gambardella, L. M. (1997), “Ant Colony System ： a Cooperative Learning Approach to the Traveling Salesman Problem,”IEEE Transactions on Evolutionary Computation, Vol. 1, No. 1, pp. 53-66.

18. Dorigo, M., V. Maniezzo, and Colorni, A. (1996),“AntSystem:Optimization by a Colony of Cooperating Agents,”IEEE Transactionson System,Man,and Cybernetics-Part B, Vol. 26, No. 1. pp. 29-41.

19. Eberhart, R. and Kennedy, J. (1995), “A New Optimizer Using Particle Swarm Theory,”Proceedingsofthe1995 Sixth InternationalSymposium on Micro Machine and Human Science, pp. 39-43.

20. Eberhart, R.C. and Shi, Y. (2001), “Particle Swarm Optimization:

Developments, Applications and Resources,” Proceedings Congress on Evolutionary Computation, COEX, Seoul, Korea, Vol. 1, pp. 81-86.

21. Elsayed, E. A. and Stern, R. G. (1983),“Computerized Algorithms for Order Processing in Automated Warehousing Systems,” International Journal of Production Research, Vol. 21, No. 4, pp. 579-586.

22. Frazelle, E. A. and Sharp, G. P. “Correlated Assignment Strategy Can Improve Any Order Picking Operation,”Industrial Engineering, pp.33-37.

23. Gambardella, L. M. and Dorigo, M. (1995), “Ant-Q ： a Reinforcement Learning Approach to the Traveling Salesman Problem,”Proceedingsofthe 12th International Conference on Machine Learning, ML-95, Morgan Kaufmann, Palo Alto, CA, pp. 252-260.

24. Gibson, D. R. and Sharp, G. P. (1992), “Order Batching Procedures,” European Journal of Operational Research, Vol. 58, No. 1, pp. 57-67.

25. Hall, R. W. (1993), “Distance Approximations for Routing Manual Pickers in a Warehouse. IIE Transactions, Vol. 25. No. 4. 76-87

26. Han, J. and Kamber, M. (2000),“Data Mining: Concepts and Techniques,”

Morgan Kaufmann Publishers, San Franscisco.

27. Hausman, W. H., L. B. Schwarz, and Graves, S. C. (1976), “OptimalStorage Assignment in Automatic Warehousing Systems,”Management Science, Vol.

22, No. 6, pp. 629-638.

28. Heskett, J. L. (1963), “Cube-Per-Order Index a Key to Warehouse Stock Location,” Transportion and Distribution Management, Vol. 9, No.1, pp.

27-31.

29. Ho, Y. C. and Su, T. S. (2002), “A Study onOptimizing Order-Picking Operations in Distribution Centers,”TheFourth Asia-Pacific Conference on Industrial Engineering and Management Systems, Taipei Taiwan, pp. 18-20.

30. Holland, J. (1975), “Adaptation in Naturaland ArtificialSystems,”Univcrsity of Michigan Press Ann Arbor.

31. Hsieh, L. F. and Lin, C. C. (2005), “Compatibility Study between Storage Assignment and Order Picking Strategy in Distribution Centers,”submitto Production Planning and Control.

32. Hu, X., R.C. Eberhart, and Shi, Y. (2003), “Swarm Intelligence for Permutation Optimization: a Case Study of N-Queens Problem”, Swarm Intelligence Symposium, The Proceedings of the 2003 on IEEE (SIS '03), pp.243-246.

33. Jarvis Jay, M. and McDowell Edward, D. (1991),“OptimalProductLayoutin an Order Picking Warehouse,”IIE Transactions,Vol.23, No. 1, pp.93-102.

34. Kao, Y. T., E. Zahara, and Kao, I. W. (2007), “A Hybridized Approach to Data Clustering,” Expert Systems with Applications,In Press, Corrected Proof, Available online 7 February

35. Kennedy, J. (1997),“TheParticleSwarm:SocialAdaptation ofKnowledge,” Proceedings of IEEE International Conference on Evolutionary Computation, Indianapolis, Indiana, pp. 303-308.

Proceedings IEEE International Conference on Neural Networks, Perth, WA, Australia, Vol. 4, pp.1942-1948.

37. Kennedy, J., R. C. Eberhart, and Shi, Yuhui. (2001), “Swarm Intelligence,” San Francisco: Morgan Kaufmann.

38. Liao, C. J., C. T. Tseng, and Luarn, P. ( 2007), “Facing Classification Problems with Particle Swarm Optimization,”Computers and Operations Research, Vol.

34, No. 10, pp. 3099-3111.

39. Megiddo, N. and Srikant, R. (1998), “Discovering Predictive Association Rules,”American Association for Artificial Intelligence.

40. Petersen II, C. G. and Schmenner, R. W. (1999),“An Evaluation ofRouting and Volume-Based StoragePoliciesin an OrderPicking Operation,”Decision Sciences, Vol. 30, No. 2, pp.481-501.

41. Petersen II, C. G. (2000), “An Evaluation of Order Picking Policies for Mail Order Companies,”Production and Operations Management, Vol. 9, No. 4, pp.

319-35.

42. Petersen, C. G. (1997), “An Evaluation of Order Picking Routing Policies,”

International Journal of Operations and Production Management, Vol. 17, No.

11, pp.1098-1111.

43. Ratliff, H. D. and Rosenthal, S. (1983), “Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem,”Operations Research, Vol. 31, No. 3, pp.507-521.

44. Roodbergen, K. J. and De Koster, R. (2001),“Routing Method forWarehouse with Multiple Aisles,”InternationalJournalofProduction Research,Vol.39, No. 9, pp.1865-1883.

45. Rosenwein, M. B. (1994), “An Application of Cluster to the Problem of Locating Items Within a Warehouse,”IIE Transactions, Vol. 26, No. 1, pp.101-103.

46. Rosenwein, M. B. (1996),“A Comparison of Heuristics for the Problem of Batching Orders for Warehouse Selection,” International Journal of Production Research, Vol. 34, No. 6, pp. 657-664.

47. Ruben, R. A. and Jacobs, I. R. (1999), “Batch Construction Heuristics and Storage Assignment Strategies for Walk/Ride and Pick Systems,”

Management Science, Vol. 45, No. 4, pp.575-594.