Abstract
In manual order picking systems, order pickers walk or drive through a distribution warehouse in order to collect items which are requested by (internal or external) customers. In order to perform these operations efficiently, it is usually required that customer orders are combined into (more substantial) picking orders of limited size. The Order Batching Problem considered in this paper deals with the question of how a given set of customer orders should be combined such that the total length of all tours is minimized which are necessary to collect all items. The authors introduce two metaheuristic approaches for the solution of this problem: the first one is based on Iterated Local Search; the second on Ant Colony Optimization. In a series of extensive numerical experiments, the newly developed approaches are benchmarked against classic solution methods. It is demonstrated that the proposed methods are not only superior to existing methods but provide solutions which may allow distribution warehouses to be operated significantly more efficiently.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Bozer, Yavuz A. and Justin W. Kile (2008): Order Batching in Walk-and-Pick Order Picking Systems, International Journal of Production Research, 46 (7): 1887–1909.
Brucker, Peter, Johann Hurink, and Frank Werner (1996): Improving Local Search Heuristics for Some Scheduling Problems — I, Discrete Applied Mathematics, 65: 97–122.
Bullnheimer, Bernd, Richard F. Hartl, and Christine Strauss (1999): A New Rank Based Version of the Ant System — A Computational Study, Central European Journal of Operations Research, 7 (1): 25–38.
Caron, Franco, Gino Marchet, and Alessandro Perego (1998): Routing Policies and COI-Based Storage Policies in Picker-to-Part Systems, International Journal of Production Research, 36 (3): 713–732.
Chen, Mu-Chen and Hsiao-Pin Wu (2005): An Association-Based Clustering Approach to Order Batching Considering Customer Demand Patterns, Omega — International Journal of Management Science, 33 (4): 333–343.
Choe, Kyung and Gunter Sharp (1991): Small Parts Order Picking: Design and Operation, http://www.isye.gatech.edu/logisticstutorial/order/article.htm (Access date: 2010-03-30).
Clarke, G. and John W. Wright (1964): Scheduling of Vehicles from a Central Depot to a Number of Delivery Points, Operations Research, 12 (4): 568–581.
Colorni, Alberto, Marco Dorigo, and Vittorio Maniezzo (1991): Distributed Optimization by Ant Colonies, in: Francisco Varela and Paul Bourgine Varela (eds.): Proceedings of the First European Conference on Artificial Life, MIT Press: Cambridge, MA, 134–142.
Coyle, John J., Edward J. Bardi, and C. John Langley, Jr. (1996): The Management of Business Logistics, 6th ed., West Publishing Company: St. Paul.
de Koster, René, Kees Jan Roodbergen, and Ronald van Voorden (1999): Reduction of Walking Time in the Distribution Center of De Bijenkorf, in: M. Grazia Speranza and Paul Stähly (eds.): New Trends in Distribution Logistics, Springer: Berlin, 215–234.
de Koster, René, Edo van der Poort, and Matthijs Wolters (1999): Efficient Orderbatching Methods in Warehouses. International Journal of Production Research, 37 (7): 1479–1504.
Doerner, Karl, Manfred Gronalt, Richard F. Hartl, Marc Reimann, Christine Strauss, and Michael Stummer (2002): SavingsAnts for the Vehicle Routing Problem, in: Stefano Cagnoni, Jens Gottlieb, Emma Hart, Martin Middendorf, and Günther R. Raidl (eds.): Applications of Evolutionary Computing, Lecture Notes in Computer Science 2279, Springer: Berlin, 11–20.
Dorigo, Marco (1992): Optimization, Learning and Natural Algorithms, Ph. D. Thesis, Politecnico di Milano.
Dorigo, Marco, Vittorio Maniezzo, and Alberto Colorni (1991): Ant System: An Autocatalytic Optimizing Process, Technical Report No. 91-016, Dipartimento Elettronica e Informazione, Politecnico di Milano.
Dorigo, Marco and Thomas Stützle (2004): Ant Colony Optimization, MIT Press: Cambridge, MA.
Drury, Jolyon (1988): Towards More Efficient Order Picking, The Institute of Materials Management: Cranfield.
Elsayed, Elsayed A. (1981): Algorithms for Optimal Material Handling in Automatic Warehousing Systems, International Journal of Production Research, 19 (5): 525–535.
Elsayed, Elsayed A. and Richard G. Stern (1983): Computerized Algorithms for Order Processing in Automated Warehousing Systems, International Journal of Production Research, 21 (4): 579–586.
Elsayed, Elsayed A. and O.I. Unal (1989): Order Batching Algorithms and Travel-Time Estimation for Automated Storage/Retrieval Systems, International Journal of Production Research, 27 (7): 1097–1114.
European Logistics Association and A. T. Kearney (2004): Excellence in Logistics 2004, European Logistics Association, Brussels.
Frazelle, Edward (2002): World-Class Warehousing and Material Handling, McGraw-Hill: New York.
Gademann, Noud and Steef van de Velde (2005): Order Batching to Minimize Total Travel Time in a Parallel-Aisle Warehouse, IIE Transactions, 37 (1): 63–75.
Gibson, David R. and Gunter P. Sharp (1992): Order Batching Procedures, European Journal of Operational Research, 58 (1): 57–67.
Hall, Randolph W. (1993): Distance Approximations for Routing Manual Pickers in a Warehouse, IIE Transactions, 25 (4): 76–87.
Ho, Ying-Chin, Teng-Sheng Su, and Zhi-Bin Shi (2008): Order-Batching Methods for an Order-Picking Warehouse with two Cross Aisles, Computers & Industrial Engineering, 55 (2): 321–347.
Ho, Ying-Chin and Yu-Ying Tseng (2006): A Study on Order-Batching Methods of Order-Picking in a Distribution Center with two Cross Aisles, International Journal of Production Research, 44 (17): 3391–3417.
Hsu, Chih-Ming, Kai-Ying Chen, and Mu-Chen Chen (2005): Batching Orders in Warehouses by Minimizing Travel Distance with Genetic Algorithms, Computers in Industry, 56 (2): 169–178.
Jarvis, Jay M. and Edward D. McDowell (1991): Optimal Product Layout in an Order Picking Warehouse, IIE Transactions, 23 (1): 93–102.
Katayama, Kengo and Hiroyuki Narihisa (1999): Iterated Local Search Approach Using Genetic Transformation to the Traveling Salesman Problem, in: Wolfgang Banzhaf, Jason Daida, Agoston E. Eiben, Max H. Garzon, Vasant Honavar, Mark Jakiela, and Robert E. Smith (eds.): Proceedings of the Genetic and Evolutional Computation Conference 1, Morgan Kaufmann: San Fransisco, 321–328.
Lorenço, Helena R., Olivier C. Martin, and Thomas Stützle (2003): Iterated Local Search, in: Fred Glover and Gary A. Kochenberger (eds.): Handbook of Metaheuristics, Kluwer Academic Publishers: Norwell, 321–354.
Pan, Jason Chao-Hsien and S. Liu (1995): A Comparative Study of Order Batching Algorithms, Omega — International Journal of Management Science, 23 (6): 691–700.
Petersen, Charles G. and Roger W. Schmenner (1999): An Evaluation of Routing and Volume-based Storage Policies in an Order Picking Operation, Decision Sciences, 30 (2): 481–501.
Ratliff, H. Donald and Arnon S. Rosenthal (1983): Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem, Operations Research, 31 (3): 507–521.
Reimann, Marc, Karl Doerner, and Richard F. Hartl (2004): D-Ants: Savings Based Ants Divide and Conquer the Vehicle Routing Problem, Computers & Operations Research, 31 (4): 563–591.
Stützle, Thomas (2006): Iterated Local Search for the Quadratic Assignment Problem, European Journal of Operational Research, 174 (3): 1519–1539.
Stützle, Thomas and Holger H. Hoos (2000): Max-Min Ant System, Future Generation Computer Systems, 16 (8): 889–914.
Tompkins, James A., John A. White, Yavuz A. Bozer, Edward Frazelle, and J.M.A. Tanchoco (2003): Facilities Planning, 3rd ed., Wiley: New Jersey.
Tsai, Chieh-Yuan, James J.H. Liou, and Ting-Mei Huang (2008): Using a Multiple-GA Method to Solve the Batch Picking Problem: Considering Travel Distance and Order Due Time, International Journal of Production Research, 46 (22): 6533–6555.
Wäscher, Gerhard (2004): Order Picking: A Survey of Planning Problems and Methods, in: Harald Dyckhoff, Richard Lackes, and Joachim Reese (eds.): Supply Chain Management and Reverse Logistics, Springer: Berlin, 324–370.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (https://creativecommons.org/licenses/by/4.0), which permits use, duplication, adaptation, distribution, and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Henn, S., Koch, S., Doerner, K.F. et al. Metaheuristics for the Order Batching Problem in Manual Order Picking Systems. Bus Res 3, 82–105 (2010). https://doi.org/10.1007/BF03342717
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF03342717