DEPOLAMA SİSTEMLERİNDE SİPARİŞ TOPLAMA İŞLEMLERİNİN GENETİK ALGORİTMALARLA OPTİMİZASYONU

Öz

Depolama ve dağıtım merkezlerinde iş gücünün en yoğun olarak kullanıldığı operasyonlar olan sipariş toplama işlemleri; müşterilerin talepleri doğrultusunda siparişlerin depo içerisinde bulundukları noktalardan alınmalarını ifade etmektedir. Sipariş toplama problemi; operasyonel maliyeti düşürmek için, toplayıcıların kat ettiği mesafenin minimize edilmesini sağlamak amacıyla, siparişlerin uygun şekilde gruplanmasını ve sipariş toplayıcıların rotalarının tespit edilmesini ifade etmektedir. Bu çalışmada depolama operasyonlarının açıklanmasını takiben; sipariş toplayıcı seyahat mesafesinin azaltılması amacıyla, sipariş toplama probleminin çözümünde kullanılan teknikler irdelenmiştir. Özellikle çapraz geçit içeren, sırt sırta raf sistemlerine sahip depolar dikkate alınmıştır. Çalışma kapsamında önerilen gruba dayalı kodlamalı genetik algoritma (GA) yöntemi farklı parametreler kullanılarak, geleneksel bir gruplama ve rotalama metodu olan paralel Clarke-Wright (CW) sezgiseli ile karşılaştırılmıştır. Uygulamada kullanılan tüm veri setleri için GA yöntemi, paralel CW algoritmasına göre daha iyi sonuçlar ortaya koymuştur. Anahtar Sözcükler: Sipariş Toplama, Depolama, Genetik Algoritmalar.

Anahtar Kelimeler

• Sipariş Toplama, Depolama, Genetik Algoritmalar

Kaynakça

1. P. J. Van Den Berg, A Literature Survey on Planning and Control of Warehousing Systems. IEE Transactions, 31, 751-762 (1999).
2. H. E. Frazille, World Class Warehousing and Material Handling, Mc-Graw Hill, New York, 2001, p. 147.
3. M. Hompel, T. Schmidt, Warehouse Management- Organisation und Steuerung von Lager-und Kommissioniersystemen, Springer-Verlag Berlin Heidelberg, 2010, p. 48.
4. R. Manzini, M. Gamberi, A. Regattieri, Design and Control of A Flexible Order- Picking System. Journal of Manufacturing Technology Management, 16, 1, 18-35 (2005).
5. J. J. Bartholdi, T. S. Hackman, Warehouse & Distribution Science, The Supply Chain and Logistics Institute, USA, 2011, p. 25.
6. S. Emmett, Excellence in Warehouse Management, John Wiley & Sons Ltd., 2005, p. 97.
7. G. Q. Huang, P. K. Wrigt, S. T. Newman, Wireless Manufacturing: A Literature Review, Recent Developments and Case Studies. International Journal of Computer Integrated Manufacturing, 1, 1-16 (2008).
8. N. Gademann, J. Van den Berg, H. Van der Hoff, An Order Batching Algorithm For Wave Picking in A Parallel-Aisle Warehouse. IIE Transactions, 33, 385-398 (2001).

9. P. Toth, D. Vigo, Exact Solution Of The Vehicle Routing Problem. Fleet Management and Logistics, Kluwer Academic Publishers, Boston, 1-31, 1998.
10. Y. A. Bozer, J. W. Kile, Order Batching in Walk and Pick Order Picking Systems. International Journal of Production Research, 46, 7, 1887-1909 (2008).
11. A. R. Ruben, F. R. Jacobs, Batch Construction Heuristics and Storage Assignment Strategies for Walk/Ride and Pick Systems. Management Science, 45, 4, 575-596 (1999).
12. R. De Koster, S. E. Van Der Poort, M. Wolters, Efficient Orderbatching Method in Warehousesç. International Journal of Production Research, 37, 7, 1479-1504 (1999).
13. R. D. Gibson, G. P. Sharp, Order Batching Procedures. European Journal of Operational Research, 58, 1, 57-67 (1992).
14. C. H. Pan, S. Y. Liu, A Comparative Study Of Order Batching Algorithms. Omega- International Journal of Management Science, 23, 6, 691-700 (1995).
15. M. B. Rosenwein, A Comparison of Heuristics for The Problem of Batching Ordersfor Warehouse Selection. International Journal of Production Research, 34,3, 657-664 (1996).
16. G. Dukic, C. Oluic, Order-picking Methods: Improving Order-Picking Efficiency. International Journal of Logistics Systems and Management, 3, 4, 451-460 (2007).
17. M. Eryavuz, C. Gencer, Araç Rotalama Problemine Ait Bir Uygulama. Süleyman Demirel Üniversitesi BF Dergisi, 6, 1, 139-155 (2001).
18. G. Zapfel, R. Braune, M. Bögl, Metaheuristic Search Concepts, Springer-Verlag Berlin Heidelberg, Germany, 2010, p. 281-290.
19. G. Laporte, F. Semet, Classical Heuristics For The Capacitated VRP, The Vehicle Routing Problem-SIAM Monographs on Discrete Mathematics and Applications, SIAM Publishing, Philadelphia, USA, p. 109-128, 2001.
20. K. Altınel, T. Öncan, A New Enhancement of The Clarke And Wright Savings Heuristic For The Capacitated Vehicle Routing Problem. Journal of the Operational Research Society, 56, 954-961 (2005).
21. M. Chen, H. Wu, An Association-Based Clustering Approach To Order Batching Considering Customer Demand Patterns. Omega-International Journal of Management Science, 33, 4, 333-343 (2005).
22. Y. Ho, Y. Y. Tseng, A Study On Order-Batching Methods Of Order-Picking in A Distribution Centre With Two Cross-Aisles. International Journal of Production Research, 44, 17, 3391-3417 (2006).
23. Y. Ho, T. Su, Z. Shi, Order-batching Methods for an Order-picking Warehouse with Two Cross Aisles. Computers & Industrial Engineering, 55, 321-347 (2008).
24. S. Henn, G. Wascher, Tabu Search Heuristics for the Order Batching Problem in Manual Order Picking Systems. University Magdeburg-Faculty of Economics and Management Working Paper Series, 1-31 (2010).
25. G. Laporte, The Vehicle Routing Problem: An Overview Of Exact And Approximate Algorithms. European Journal of Operational Research, 59, 345-358 (1992).
26. S. Çetinkaya, H. Üster, G. Easwaran, B. B. Keskin, An Integrated Outbound Logistics Model for Frito-Lay: Coordinating Aggregate Level Production and Distribution Decisions. Interfaces, 39, 5, 460-475 (2009).
27. G. K. Rand, The Life And Times Of The Savings Method For Vehicle Routing Problems. Orion, 25, 2, 125-145 (2009).
28. B. Molnar, G. Lipovszki, Multi-Objective Routing And Scheduling Of Order Pickers in A Warehouse. International Journal of Simulation, 6, 5, 22-32 (2005).
29. R. L. Daniels, J. R. Rummel, R. Schantz, A Model for Warehouse Order Picking. European Journal of Operational Research, 105, 1-17 (1998).
30. D. H. Ratliff, S. A. Rosenthal, Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem. Operations Research, 31, 3, 507- 521 (1983).
31. R. W. Hall, Distance Approximations for Routing Manual Pickers in a Warehouse. IEE Transactions, 25, 4, 76-87 (1993).
32. G. C. Petersen, An Evaluation Order-Picking Routeing Policies. International Journal of Operations & Production Management, 17, 11, 1098-1111 (1997).
33. R. De Koster, S. E. Van Der Poort, Routing Orderpickers in A Warehouse: A Comparison Between Optimal and Heuristic Solutions. IIE Transactions, 30, 469- 480 (1998).
34. G. C. Petersen, W. R. Schmenner, An Evaluation of Routing and Volume-based Storage Policies in an Order Picking Operation, Decision Sciences, 30, 2, 481-501 (1999).
35. T. S. Vaughan, C. G. Petersen, The Effect Of Warehouse Cross Aisles On Order Picking Efficiency. International Journal of Production Research, 37, 4, 881-897 (1999).
36. C. G. Petersen, The Impact Of Routing And Storage Policies On Warehouse Efficiency. International Journal of Operations & Production Management, 19, 10, 1053-1064 (1999).
37. K. J. Roodbergen, R. De Koster, Routing Methods for Warehouses With Multiple Cross Aisles. International Journal of Production Research, 39, 9, 1865-1883 (2001).
38. K. J. Roodbergen, R. De Koster, Routing Order Pickers in A Warehouse with a Middle Aisle, European Journal of Operational Research, 133, 32-43 (2001).
39. H. Hwang, Y. H. Oh, Y. K. Lee, An Evaluation of Routing Policies for Order- Picking Operations in Low-Level Picker-To-Part System. International Journal of Production Research, 42, 18, 3873-3889 (2004).
40. L. Hsieh, C. Huang, C. Huang, Applying Particle Swarm Optimization to Schedule Order Picking Routes in a Distribution Center, Asian Journal of Management and Humanity Sciences, 1, 4, 558-576 (2007).
41. I. V. Nieuwenhuyse, R. De Koster, Evaluating Order Throughput Time in 2-Block Warehouses With Time Window Batching. International Journal Production Economics, 121, 654-664 (2009).
42. N. Guofang, L. Minqiang, K. Jisong, Design and Analysis of Multi-level Genetic Algorithm with its Application to the Construction of Clock Binary Tree. International Journal of Computer Science and Network Security, 6, 2A, 75-82 (2006).
43. Y. Wu, P. Ji, T. Wang, An Empirical Study of a Pure Genetic Algorithm to Solve The Capacitated Vehicle Routing Problem. ICIC Express Letters, 2, 1, 41-45 (2008).
44. Y. Honglin, Y. Jijun, An Improved Genetic Algorithm for the Vehicle Routing Problem.www.seiofbluemountain.com/upload/product/201002/1265019140yksr0x2. pdf (Son Eri im Tarihi: 10.05.2010), 418-423 (2010).