Depo Operasyonlarının Planlanması İçin Genetik Algoritma Esaslı Modeller

Yıl 2013, Cilt: 5 Sayı: 3, 141 - 153, 01.09.2013

Yusuf Şahin Osman Kulak

Öz

Nowadays one of the most important aims of the companies is to manage warehouse operations effectively. During the management of warehouse operations two types of problems are experienced densely. First one is to define order batches and second one is to determine a suitable vehicle route for batched orders. In order to prepare effective and economic distribution plans, these problems should be solved by companies simultaneously. In this study, novel cluster-based genetic algorithm approaches namely Genetic AlgorithmNearest Neighbor (GANN) and Genetic Algorithm-Saving (GAS) are proposed to solve order batching and vehicle routing of relevant batch for cross aisle warehouse systems especially. To evaluate the performances of the proposed methods, various problem instances including the number of order, weight and picking coordinates are generated randomly and tested. 1.

Anahtar Kelimeler

-

Depo Operasyonlarının Planlanması İçin Genetik Algoritma Esaslı Modeller

Öz

Günümüzde depo operasyonlarının etkin olarak yönetilmesi firmalarının en önemli hedeflerinden birisidir. Operasyonların yönetilmesi sırasında yoğun olarak iki tip problemle karşılaşılmaktadır. Bunlardan birincisi sipariş hazırlıklarına yönelik siparişlerin gruplandırılması, ikincisi ise gruplanan siparişlere ait toplama aracı rotasının belirlenmesidir. Firmalarının etkin ve ekonomik sipariş toplama planlarını oluşturabilmeleri içi n bu problemlerin eş zamanlı olarak çözmeleri gerekmektedir. Bu çalışmada, özellikle çapraz geçitli depo sistemleri için sipariş gruplarını ve ilgili gruplara ait araç rotalarını birlikte çözen kümeleme esaslı Genetik AlgoritmaEn Yakın Komşu ve Genetik Algoritma - Kazanç isimli genetik algoritma esaslı yeni yöntemler önerilmektedir. Yöntemlerin etkinliğini belirlemek için farklı sipariş sayısı, ağırlık ve toplama koordinatlarını içeren deney problemleri rastsal olarak oluşturulmuş ve test edilmiştir.

Anahtar Kelimeler

Sipariş Toplama, Sipariş Gruplama, Genetik Algoritma

Kaynakça

• AKSU, A.A, KÖKSAL, C.D. (2005). “Perceptions and Attitudes of Tourism Students in Turkey”, International Journal of Contemporary Hospitality Management, 17 (4/5): 436-447.
• BOZER, Y. A., KILE, J. W. (2008). “Order Batching in walk-and-pick order picking systems”, International Journal of Production Research, 46 (7): 1887-1909.
• BOTTANI, E., CECCONI, M., VIGNALI, GIUSEPPE, V., MONTANARI, R. (2012). “Optimization of storage allocation in order picking operations through a genetic algorithm”, International Journal of Logistics Research and Applications: A Leading Journal of Supply Chain Management, 15 (2): 127-146.
• BUKCHIN, Y., KHMELNITSKY, E., YKUEL, P. (2012). “Optimizing a dynamic order picking process”, European Journal of Operational Research, 219: 335-346.
• CHEW E.P., TANG L.C. (1997). “Travel time analysis for general item location assignment in a rectangular warehouse”, European Journal of Operational Research, 112: 582-597.
• COYLE, JHON J., EDWARD, J. B., LANGLEY, J. (1996). The management of business logistics. 6th edition, West Publishing Company: St. Paul.
• DE KOSTER, M., VAN DER POORT, E., WOLTERS, M. (1999). “Efficient Order batching Methods in Warehouses”, International Journal of Production Research 37 (7): 1479-1504.
• DRURY, J. (1998). Towards more efficient order picking. The Institute of Materials Management, Cranfield.
• GADEMANN, A. J. R. M., VAN DEN BERG, J. P., VAN DER HOFF, H. H. (2001). “An order batching algorithm for wave picking in a parallel-aisle warehouse”, IIE Transactions, 33: 385-398.
• GEN, M. & CHENG, R. (2000). Genetic Algorithms and Engineering Design. Willey, New York.
• GOLDBERG, D. E. (1989). Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Boston.
• GOETSCHALCKX, M. AND ASHAYERI J. (1989). “Classification and design of order picking systems”, Logistics World, June : 99
• HENN, S., KOCH, S., DOERNER, K. F., STRAUSS, C., WASCHER, G. (2010). “Metaheuristics fort the Order Batching Problem in Manuel Order Picking Systems”, Business Research, Official Open Access Journal of VHB, 3 (1): 82-105.
• HENN, S., WÄSCHER, G. (2012). “Tabu search heuristics for the order batching problem in manual order picking systems”, European Journal of Operational Research, 222 : 484–494.
• HSIEH L., TSAI L. (2006). “The optimum design of a warehouse system on order picking efficiency”, International Journal of Advanced Manufacturing Technology, 28 (5-6): 626–637.
• HSIEH, L. F., HUANG, Y. C. (2011). “New batch construction heuristics to optimise the performance of order picking systems”, Int. J. Production Economics, 131: 618–630.
• HSU, C.M., CHEN, K.Y., CHEN, M.C. (2005). “Batching Orders in warehouse by minimizing travel distance with genetic algorithms”, Computers in Industry, 56: 169-178.
• LIN C.H., LU I.Y. (1999). “The procedure of determining the order picking strategies in distribution center”, International Journal of Production Economics, 60-61 (1): 301-307.
• MILLER, A. (2004). Order Picking for the 21st Century: Voice vs. Scan Technology. http://www.logisticsit.com/absolutenm/articlefiles/688-voice_vs_scanning.pdf (10.10.2008).
• NIEUWENHUYSE, I. V., DE KOSTER, R. B. M. (2009). “Evaluating order throughput time in 2-block warehouses with time window batching”, Int. J. Production Economics, 121 (2): 654–664.
• PAN, J. C. H., SHIH, P.S., WUNG, M, H. (2012). “Storage assignment problem with travel distance and blocking considerations for a picker-to-part order picking system”, Computers & Industrial Engineering, 62 (2): 527–535.
• PAN, L., HUANG, J. Z., CHU, S. C. K. (2011). “Order Batching and Picking in a Synchronized Zone Order Picking System”, IEEE International Conference on Industrial Engineering and Engineering Management, 7-10 December 2011, Macau, Singapore. PETERSEN, C. G., AASE, G. (2004). “A Comparison of picking, storage, and routing policies in manual order picking”, International Journal of Production Economics, 92 (1): 11-19.
• ROODBERGEN, K. J., VIS I. F. A. (2006). A model for warehouse layout. IIE Transactions, 38 (10): 799-811.
• ROODBERGEN, K.J., DE KOSTER R. (2001a). “Routing order pickers in a warehouse with a middle aisle”, International Journal of Production Research, 133 (1): 32-43.
• ROODBERGEN, K.J., DE KOSTER R. (2001b). “Routing methods for warehouses with multiple cross aisles”, International Journal of Production Research, 39 (9): 1865-1883.
• RUBEN, R. A., JACOBS F. R. (1999). “Batch Construction Heuristic and Storage Assignment Strategies for Walk/Ride and Pick Systems”, Management Science, 45 (4): 575-596.
• TSAI, C.-Y., LIOU, J.J.H., HUANG, T.-M. (2007). “Using a multiple-GA method to solve the batch picking problem: considering travel distance and order due time”, International Journal of Production Research, 99999 (1): 1-23.
• VAN DEN BERG, J.P. (1999). “A literature survey on planning and control of warehousing systems”, IIE Transactions, 31 (8): 751-762. YU, M., DE KOSTER, R. (2008). “Performance approximation and design of pick-and-pass order picking systems”, IIE Transactions, 40 (11): 1054-1069.
• WON J., OLAFSSON S. (2005). “Joint order batching and order picking in warehouse operations”, International Journal Of Production Research, 43 (7): 1427-1442.