Depolarda Sıralı Sipariş Toplama İşlemi için Yenilikçi Koridor Tasarımları

Loading...
Publication Logo

Date

2017

Authors

OMER OZTURKOGLU

Journal Title

Journal ISSN

Volume Title

Publisher

Open Access Color

OpenAIRE Downloads

OpenAIRE Views

Research Projects

Journal Issue

Abstract

Sıralı sipariş toplama işlemi özellikle işgücü yoğunluklu depolarda en maliyetli işlemdir. Bu işlemin de en maliyetli ve sipariş tepki hızına en çok etki eden parçası lokasyonlar arasında seyahattir. Bu nedenle bu proje depolarda seyahat mesafesini azaltabilecek yenilikçi fikirler sunan dört problem önermektedir. Bu problemler Kesikli Ana Koridorlu (KAK) Çok Tünelli (ÇT) Tasarım X ve Tasarım Y olarak adlandırılmıştır. Her bir problemin çözümü için ağ tabanlı depo yerleşim düzeni modeli geliştirilmiştir. Daha sonra ortalama seyahat mesafesini azaltacak her bir problemdeki tasarım değişkenlerin optimal değerlerini araştırmak için meta-sezgisel algoritmalar kullanılmıştır. KAK probleminde toplama koridoru üzerinde sadece bir tünele izin verilen bir depo için optimal tur uzunluğunu polinomyal zamanda hesaplayan bir algoritma geliştirilmiştir. Değişkenlerin optimal değerlerinin araştırılması için Harmony Arama optimizasyon algoritması kullanılmıştır. Geliştirilen KAK tasarımları depo ve sipariş büyüklüğüne bağlı olarak %7?ye yakın tur uzunluğunda iyileştirme önermektedir. ÇT problemde tur uzunluğun hesaplanması için aç gözlü bir algoritma geliştirilmiştir. Değişkenlerin optimizasyonu için genetik algoritma kullanılmıştır. Sonuç olarak bazı ÇT tasarımların %3?e kadar tur uzunluğunda kısalma sunduğu gösterilmiştir. X ve Y tasarım problemlerinde sipariş toplama rota uzunluğu için Karınca Koloni Algoritması esas alınarak etkin bir algoritma geliştirlmiştir. Ayrıca tasarım değişkenlerinin optimal değerlerini araştırmak için Diferansiyel Evrim algoritması kullanılmıştır. Elde edilen X tasarımları iyileştirme sunmamasına rağmen bazı Y tasarımları %3?e kadar tur uzunluğunda tasarruf sunmaktadır. Son olarak sonuçlar göstermiştir ki iki-bloklu geleneksel tasarım bir çok depo koşulu altında gürbüz bir tasarımdır.

Description

Keywords

Bilgisayar Bilimleri- Yazılım Mühendisliği-Endüstri Mühendisliği

Fields of Science

Citation

Afaq H. Saini S. 2012. “ A novel approach to solve Graph based Travelling Salesman\r\nProblem using Particle Swarm Optimization technique In Computational Intelligence &\r\nComputing Research (ICCIC)” 2012 IEEE International Conference on Coimbatore\r\nIndia pp:1-4.Bartholdi J. J. Hackman S. T. (2005) “Warehouse & distribution science”\r\nhttp://www.tli.gatech.edu/whscience/ book/wh-sci.pdf.\r\nSon erişim tarihi: 15 Ağustos 2017Bartholdi J.J. Hackman S.T.(2011) “ Warehouse and Distribution Science Release:\r\n0.95 Supply Chain and Logistics Institute”. Georgia Institute of Technology Atlanta\r\nUSA Pp:25. http://www.warehouse-science.com\r\nSon erişim tarihi: 20Ağustos 2017Berglund P. Batta R. 2012. “Optimal placement of warehouse cross-aisles in a\r\npicker-to-part warehouse with class-based storage” IIE Transactions 44(2) 107-120.Berry J.R. 1968. “Elements of warehouse layout” International Journal of Production\r\nResearch 7(2) 105–121Caron F. Marchet G. Perego A. 1998. “ Routing policies and COI-based storage\r\npolicies in picker-to-part systems” International Journal of Production Research 36(3)\r\n713-732.Çelik M. & Sural H. 2012.“The order picking problem in fishbone aisle\r\nwarehouse” Research Thesis.Daniels R.L. Rummel J.L. Schantz R. 1998 “A model for warehouse order\r\npicking” European Journal of Operational Research 105(1) 1-17.De Koster R. Van Der Poort E. 1998. “Routing orderpickers in a warehouse: a\r\ncomparison between optimal and heuristic solutions” IIE transactions 30(5) 469-480.De Koster R. Le-Duc T. Roodbergen K. J. 2007. “Design and control of warehouse\r\norder picking: A literature review” European Journal of Operational Research 182(2)\r\n481-501.Dong G. Guo W.W. Tickle K. 2012 “Solving the traveling salesman problem using\r\ncooperative genetic ant systems” Expert Systems with Applications 39(5) 5006-5011.Dukic G. Opetuk T. Analysis of order-picking in warehouses with fishbone layout.\r\nIn Proceeding of International Conference on Industrial Logistics 2008 Tel Aviv Israel\r\n(2008). pp: 197-205.Gálvez O.D. Ting C.J. 2012. “Analysis of Unit-load Warehouses with Nontraditional\r\nAisles and Multiple P&D Points” Proceedings of the Asia Pacific Industrial Engineering\r\n& Management Systems Conference 2012 ed: V. Kachitvichyanukul H.T. Luong and\r\nR. Pitakaso. Patong Beach Phuket Thailand pp: 2011 - 2021.Geem Z.W. Kim J.H. & Loganathan G.V. 2001. “A new Heuristic Optimization\r\nAlgorithm: Harmony Search” Simulation 60-68.Gelders L. Heeremans D. 1994.”Het traveling salesman probleem toegepast op\r\norderpicking” Tijdschrift voor Economie en Management 19 381-388.Girsang A.S. Tsai C.W. Yang C.S. 2014. “A Hybrid Ant-Bee Colony Optimization for\r\nSolving Traveling Salesman Problem with Competitive Agents In Mobile Ubiquitous\r\nand Intelligent Computing” Springer Berlin Heidelberg Pp: 643-648.Gu J. Goetschalckx M. & McGinnis L. F. 2007. “Research on warehouse operation:\r\nA comprehensive review” European journal of operational research 177(1) 1-21.Gue K.R. Meller R.D. 2009. “Aisle configurations for unit-load warehouses” IIE\r\nTransactions 41(3) 171-182.Gue K.R. Ivanović G. Meller R.D. 2012. “A unit-load warehouse with multiple pickup\r\nand deposit points and non-traditional aisles” Transportation Research Part E:\r\nLogistics and Transportation Review 48(4) 795-806.Hall R.W. 1993. “Distance approximations for routing manual pickers in a\r\nwarehouse” IIE transactions 25(4) 76-87.Held M. KARP R.M. 1970. “The traveling salesman problem and minimum spanning\r\ntrees” Operations Research 18 1138–1162.Held M. KARP R.M. 1971 “The traveling-salesman problem and minimum spanning\r\ntrees: Part II” Mathematical Programming 1 6–25.Henn S. Koch S. Gerking H. Wäscher G. 2013. “A U-shaped layout for manual\r\norder-picking systems” Logistics Research 1-17 DOI:10.1007/s12159-013-0104-6.Henn S. Koch S. Wäscher G. 2012. “Order Batching In Order Picking Warehouses:\r\nA Survey Of Solution Approaches” Springer London Pp: 105-137.Hsu C. Chen K. Chen M. Mu-Chen. 2005. “Batching Orders in Warehouse by\r\nMinimizing Travel Distance With Genetic Algorithms” Computers in Industry 56 169-\r\n178.Hwang H. Oh Y.H. Lee Y.K. 2004. “An evaluation of routing policies for order-\r\npicking operations in low-level picker-to-part system” International Journal of\r\nProduction Research 42(18) 3873-3889.İmrak E. & Gerdemeli İ. (2006). ”Endüstriyel depolama teknikleri”. Transport Tekniği\r\nDers Notları. http://transport. itu. edu. tr/PDF/mak419/MAK419-3. Pdf\r\nSon erişim tarihi: 24 Ağustos 2017Jarvis J.M. McDowell E.D. 1991 “Optimal product layout in an order picking\r\nwarehouse” IIE transactions 23(1) 93-102.Jitkongchuen D. & Thammano A. 2014. “A self-adaptive differential evolution\r\nalgorithm for continuous optimization problem” Artificial Life and Robotics 19(2) 201-\r\n208.Kitayama S. Arakawa M. & Yamazaki K. 2011. “Differential evolution as the global\r\noptimization technique and its application to structural optimization” Applied Soft\r\nComputing 11(4) 3792-3803.Kunder R. Gudehus T. 1975. “Mittlere Wegzeiten beim eindimensionalen\r\nKommissionaren” Zeitschrift fur Operazions Research 19:B3-B72.Le-Duc T. De Koster R.M.B. 2005a. “Travel distance estimation and storage zone\r\noptimization in a 2-block class-based storage strategy warehouse” International\r\nJournal of Production Research 43(17) 3561-3581.Le-Duc T. De Koster R.. 2005b. “Travel Distance Estimation in Single-Block ABC-\r\nStorage Strategy Warehouses. In Distribution Logistics” Springer Berlin Heidelberg\r\nPp. 185-200.Little J.D.C. Murty K.G. Sweeney D.W. Karel C. 1963. “An algorithm for the\r\ntraveling salesman problem” Operations Research 11 972-989.Lıao Y.F. Yau D.H. Chen C.L. 2012. “Evolutionary algorithm to traveling salesman\r\nproblems” Computers & Mathematics with Applications 64(5) 788-797.Mahdavi M. Fesanghary M. Damangir E. 2007. “An improved harmony search\r\nalgorithm for solving optimization problems”. Applied Mathematics and Computation\r\n188 1567–1579.Makris P.A. Giakoumakis I.G. 2003. “k-Interchange heuristic as an optimization\r\nprocedure for material handling applications” Applied Mathematical Modelling 27(5)\r\n345-358.Mallipeddi R. Suganthan P. N. Pan Q. K. & Tasgetiren M. F. 2011. “Differential\r\nevolution algorithm with ensemble of parameters and mutation strategies” Applied Soft\r\nComputing 11(2) 1679-1696.Nguyen H.D. Yoshihara I. Yamamori K. Yasunaga M. 2007. “Implementation of an\r\neffective hybrid GA for large scale traveling salesman problems Systems Man and\r\nCybernetics” Part B: Cybernetics IEEE Transactions on 37(1):92–99.Omran M.G.H. Mahdavi M. 2008. “Global-Best harmony search” Applied\r\nMathematics and Computation 198 643–656.Öztürkoğlu Ö. 2011. “New Warehouse Designs: Angled Aisles And Their Effects On\r\nTravel Distance” (Doktora Tezi) Auburn University Auburn AL.Öztürkoğlu Ö. Gue K.R. Meller R.D. 2012. “Optimal unit-load warehouse designs for\r\nsingle-command operations” IIE Transactions 44(6) 459-475.Öztürkoğlu Ö. Pallet depolamada yeni koridor tasarımlarının karşılaştırılması 12.\r\nÜretim Araştırmaları Sempozyumu Gediz Üniversitesi İzmir Türkiye (2012a) pp:69-\r\n76.Öztürkoğlu Ö. An innovative design for warehouses considering a different material\r\nflow pattern ICOVACS 2012: International Conference on Value Chain Sustainability\r\nIzmir University of Economics Izmir Turkey (2012b) pp: 94-101.Öztürkoğlu Ö. Gue K.R. Meller R.D. 2013. “A Constructive Aisle Design Model for\r\nUnit-Load Warehouses with Multiple Pickup & Deposit Points” European Journal of\r\nOperational Research under second revision.Öztürkoğlu Ö. Gue K. R. Meller R. D. 2014. “A constructive aisle design model for\r\nunit-load warehouses with multiple pickup and deposit points” European Journal of\r\nOperational Research 236(1) 382-394.Petersen II C.G. 1999. “The impact of routing and storage policies on warehouse\r\nefficiency” International Journal of Operations & Production Management 19(10)\r\n1053-1064.Petersen C.G. Schmenner R.W. 1999. “An Evaluation of Routing and Volume‐based\r\nStorage Policies in an Order Picking Operation” Decision Sciences 30(2) 481-501.Petersen C.G. 2002. “Considerations in order picking zone configuration International\r\nJournal of Operations & Production Management” 22(7) 793-805.Petersen C.G. Aase G. 2004. “A comparison of picking storage and routing policies\r\nin manual order picking” International Journal of Production Economics 92(1) 11-19.Pohl L. M. Meller R. D. & Gue K. R. 2009a. “An analysis of dual-command\r\noperations in common warehouse designs”. Transportation Research Part E: Logistics\r\nand Transportation Review 45(3) 367-379.Pohl L. M. Meller R. D. & Gue K. R. 2009b. “Optimizing fishbone aisles for dual‐\r\ncommand operations in a warehouse” Naval Research Logistics (NRL) 56(5) 389-\r\n403.Pohl L. M. Meller R. D. & Gue K. R. 2011. “Turnover-based storage in non-\r\ntraditional unit-load warehouse designs”. IIE Transactions 43(10) 703-720Ratliff H.D. Rosenthal A.S. 1983. “ Order-picking in a rectangular warehouse: a\r\nsolvable case of the traveling salesman problem” Operations Research 31(3) 507-\r\n521.Roodbergen K.J. Koster R. 2001a. “Routing methods for warehouses with multiple\r\ncross aisles” International Journal of Production Research 39(9) 1865-1883.Roodbergen K.J. De Koster R.. 2001b. “Routing order pickers in a warehouse with a\r\nmiddle aisle” European Journal of Operational Research133(1) 32-43.Roodbergen K.J. Sharp G.P. & Vis I.F. 2008. “ Designing the layout structure of\r\nmanual order picking areas in warehouses” IIE Transactions40(11) 1032-1045.Roodbergen K. J. Vis I. F. 2009. “A survey of literature on automated storage and\r\nretrieval systems” European Journal of Operational Research 194(2) 343-362.Storn R. & Price K. 1997. “Differential evolution–a simple and efficient heuristic for\r\nglobal optimization over continuous spaces” Journal of global optimization 11(4) 341-\r\n359.Theys C. Bräysy O. Dullaert W. Raa B. 2010. “Using a TSP heuristic for routing\r\norder pickers in warehouses” European Journal of Operational Research 200(3) 755-\r\n763.Tompkins J. A. White J. A. Bozer Y. A. Frazelle E. H. Tanchoco J. M. A. 2003.\r\n“Facilities Planning” NJ: John Wiley and Sons.Vaughan T.S. 1999. “The effect of warehouse cross aisles on order picking\r\nefficiency” International Journal of Production Research 37(4) 881-897.White J.A. 1972. “Optimum design of warehouses having radial aisles” AIIE\r\nTransactions 4(4) 333–336.

WoS Q

Scopus Q

Source

Volume

Issue

Start Page

End Page

Google Scholar Logo
Google Scholar™

Sustainable Development Goals