×

zbMATH — the first resource for mathematics

Necessity and complexity of order picking routing optimisation based on pallet loading features. (English) Zbl 1387.90020
Summary: Order picking is the most labour-intensive and costly activity of warehouses. The main challenges of its improvement are the synchronisation of warehouse layout, storage assignment policy, routing, zoning, and batching. Furthermore, the competitiveness of the warehouse depends on how it adapts to the unique customer demands and product parameters and the changes. The operators usually have to manage the picking sequence based on best practices taking into consideration the product stacking factors and minimising the lead time. It is usually necessary to support the operators by making effective decisions. Researchers of the pallet loading problem, bin packing problem, and order picking optimisation provide a wide horizon of solutions but their results are rarely synchronised.
MSC:
90B05 Inventory, storage, reservoirs
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] R. Alvarez-Valdes, F. Parren̅o, J. M. Tamarit, A tabu search algorithm for the pallet loading problem, OR Spectrum, 27, (2005) 43-61. ⇒164 · Zbl 1176.90478
[2] J. Ashayeri, M. Goetschalckx, Classification and design of order picking, Logistics Inf Manage, 2, 2 (1989) 99-106. ⇒163
[3] E.E. Bischoff, Three-dimensional packing of items with limited load bearing strength, European Journal of Operational Research, 168, 3 (2006) 952-966. ⇒ 164 · Zbl 1083.90033
[4] T. Bódis and J. Botzheim, Modelling Order Picking Sequencing Variations of Pallet Setup Clusters, Proc. of The International Conference on Logistics and Sustainable Transport 2015, Celje, Slovenia, 2015, pp. 86-94. ⇒165, 169, 170, 171, 172, 174
[5] T. Bódis, J. Botzheim, P. Földesi A Simple Case of Pallet Setup Features Based Order Picking Routing Optimization, Acta Technica Jaurinensis, 9(3), (2016) 204-215. ⇒165, 170, 171, 172, 173
[6] A. Bortfeldt, G. Wäscher, Constraints in container loading A state-of-the-art review, European Journal of Operational Research, 229, 1 (2013) 1-20. ⇒164 · Zbl 1317.90172
[7] W. Chang and A. E. Ellinger and J. Blackhurst, A contextual approach to supply chain risk mitigation, The International Journal of Logistics Management, 26, 3 (2015) 642-656. ⇒192
[8] F. T. Chan and H. Chan, 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, (2011) 2686-2700. ⇒164
[9] Tzu-Li Chen and Chen-Yang Cheng and Yin-Yann Chen and Li-Kai Chan, An efficient hybrid algorithm for integrated order batching, sequencing and routing problem, International Journal of Production Economics, 159, (2015) 158-167. ⇒164, 190
[10] K. L. Choy and H. Y. Lam and L. Canhong and C. K. H. Lee, A Hybrid Decision Support System for Storage Location Assignment in the Fast-Fashion Industry, Technology Management in the IT-Driven Services (PICMET), 2013 Proceedings of PICMET ’13, San Jose, California, USA, 2013, pp. 468-473. ⇒163
[11] Yi-Ping Cui and Yaodong Cui and Tianbing Tang, Sequential heuristic for the two-dimensional bin-packing problem, European Journal of Operational Re- search, 240, 1 (2015) 43-53. ⇒164 · Zbl 1339.90278
[12] R. de Koster and T. Le-Duc and K. J. Roodbergen, Design and control of warehouse order picking: A literature review, European Journal of Operational Re- search, 182, (2007) 481-501. ⇒163 · Zbl 1121.90385
[13] Péter Földesi and János Botzheim and László T. Kóczy, Eugenic bacterial memetic algorithm for fuzzy road transport traveling salesman problem, International Journal of Innovative Computing, Information and Control , 7, 5b (2011) 2775-2798. ⇒190
[14] R. Gamberini, B. Rimini, M. Dell’Amico, F. Lolli, M. Bianchi, Design and Optimization of Picking in the Case of Multi-Item Multi-Location Multi-Pallet Customer Orders, Warehousing in the Global Supply Chain, Springer London, 2012, 397-424. ⇒163
[15] U. Jüttner, Supply chain risk management: Understanding the business requirements from a practitioner perspective, The International Journal of Logistics Management, 16, 1 (2005) 120-141. ⇒192
[16] S. Kirkpatrick and C. D. Gelatt and M. P. Vecchi, Optimization by Simulated Annealing, Science, 220, 4598 (1983) 671-680. ⇒186 · Zbl 1225.90162
[17] H.C.W. Lau and T.M. Chan and W.T. Tsui and G.T.S. Ho and K.L. Choy, An AI approach for optimizing multi-pallet loading operations, Expert Systems with Applications, 36, 3 (2009) 4296-4312. ⇒164
[18] G. H. A. Martins and R. F. Dell, Solving the pallet loading problem, European Journal of Operational Research, 184, 2 (2008) 429-440. ⇒164 · Zbl 1149.90394
[19] K. Moeller, Increasing warehouse order picking performance by sequence optimization, Procedia Social and Behavioral Sciences, 20, (2011) 177-185. ⇒164
[20] B. Molnár and Gy. Lipovszki, Multi-objective routing and scheduling of order pickers in a warehouse, International Journal of SIMULATION, 6, 5 (2005) 22-33. ⇒165
[21] R. Saraiva, A layer-building algorithm for the three-dimensional multiple bin packing problem: a case study in an automotive company, IFAC-PapersOnLine, 48, 3 (2015) 490-495. ⇒164
[22] J. Y. Shiau and M. C. Lee, A warehouse management system with sequential picking for multi-container deliveries, Computers and Industrial Engineering, 58, (2010) 382-392. ⇒165
[23] C. Theys and O. Bräysy and W. Dullaert and B. Raa, Using a TSP heuristic for routing order pickers in warehouses, European Journal of Operational Research, 200, 3 (2010) 755-763. ⇒164, 190 · Zbl 1177.90044
[24] S. Webster and R. A. Ruben and Kum-Khiong Yang, Impact of Storage Assignment Decisions on a Bucket Brigade Order Picking Line, Production and Operations Management , 21, 2 (2012) 276-290. ⇒164
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.