Skip to main content
SpringerLink
Log in

Joint order batching and picker routing in single and multiple-cross-aisle warehouses using cluster-based tabu search algorithms

  • Published:
Flexible Services and Manufacturing Journal Aims and scope Submit manuscript

Abstract

The organization of order picking operations is one of the most critical issues in warehouse management. In this paper, novel tabu search (TS) algorithms integrated with a novel clustering algorithm are proposed to solve the order batching and picker routing problems jointly for multiple-cross-aisle warehouse systems. A clustering algorithm that generates an initial solution for the TS algorithms is developed to provide fast and effective solutions to the order-batching problem. Unlike most common picker routing heuristics, we model the routing problem of pickers as a classical TSP and propose efficient Nearest Neighbor+Or-opt and Savings+2-Opt heuristics to meet the specific features for the problem. Various problem instances including the number of orders, weight of items, and picking coordinates are generated randomly, and detailed numerical experiments are carried out to evaluate the performances of the proposed methods. In conclusion, the TS algorithms come out to be the most efficient methods in terms of solution quality and computational efficiency.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

  • Bozer YA, Kile JW (2008) Order batching in walk-and-pick order picking systems. Int J Prod Res 46:1887–1909

    Article  MATH  Google Scholar 

  • Chisman JA (1975) The clustered traveling salesman problem. Comput Oper Res 2:115–119

    Article  Google Scholar 

  • Clarke G, Wright W (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12:568–581

    Article  Google Scholar 

  • Cornuéjols G, Fonlupt J, Naddef D (1985) The traveling salesman problem on a graph and some related integer polyhedra. Math Program 33:1–27

    Article  MATH  Google Scholar 

  • Coyle JJ, Bardi EJ, Langley CJ (1996) The management of business logistics. West, St. Paul MN

    Google Scholar 

  • Croes GA (1958) A method for solving traveling salesman problems. Oper Res 6:791–812

    Article  MathSciNet  Google Scholar 

  • de Koster R, Le-Duc T, Roodbergen KJ (2007) Design and control of warehouse order picking: a literature review. Eur J Oper Res 182:481–501

    Article  MATH  Google Scholar 

  • de Koster R, Van der Poort ES, Wolters M (1999) Efficient order batching methods in warehouses. Int J Prod Res 37:1479–1504

    Article  MATH  Google Scholar 

  • Elsayed EA (1981) Algorithms for optimal material handling in automatic warehousing systems. Int J Prod Res 19:525–535

    Article  Google Scholar 

  • Elsayed EA, Stern RG (1983) Computerized algorithms for order processing in automated warehousing systems. Int J Prod Res 21:579–586

    Article  Google Scholar 

  • Elsayed EA, Lee MK, Kim S, Scherer E (1993) Sequencing and batching procedures for minimizing earliness and tardiness penalty of order retrievals. Int J Prod Res 31:727–738

    Article  Google Scholar 

  • Elsayed EA, Lee MK (1996) Order processing in automated storage/retrieval systems with due dates. IIE Trans 28:567–577

    Google Scholar 

  • Gen M, Cheng R (1997) Genetic algorithms and engineering design. Willey, New York

    Google Scholar 

  • Gipson DR, Sharp GP (1992) Order batching procedures. Eur J Oper Res 58:57–67

    Article  Google Scholar 

  • Goldberg DE (1989) Genetic algorithms in search, optimization and machine learning. Addison-Wesley

  • Glover F (1989) Tabu search part-I. ORSA J Comput 3:190–206

    MathSciNet  Google Scholar 

  • Grunow M, Günther HO, Schleusener M, Yilmaz IO (2004) Operations planning for collect-and-place machines in PCB assembly. Comput Ind Eng 47:409–429

    Article  Google Scholar 

  • Gu J, Goetschalckx M, McGinnis LF (2007) Research on warehouse operation: a comprehensive review. Eur J Oper Res 177:1–21

    Article  MATH  Google Scholar 

  • Hall RW (1993) Distance approximations for routing manual pickers in a warehouse. IIE Trans 25:76–87

    Article  Google Scholar 

  • Ho YC, Tseng YY (2006) A study on order-batching methods of order-picking in a distribution centre with two cross-aisles. Int J Prod Res 44:3391–3417

    Article  MATH  Google Scholar 

  • Ho YC, Su T-S, Shi Z-S (2008) Order-batching methods for an order-picking warehouse with two cross aisles. Comput Ind Eng 55:321–347

    Article  Google Scholar 

  • Hsu CM, Chen KY, Chen MC (2005) Batching orders in warehouse by minimizing travel distance with genetic algorithms. Comput Ind 56:169–178

    Article  Google Scholar 

  • Hwang H, Lee MK (1988) Order batching algorithms for a man-on-board automated storage and retrieval system. Eng Costs Prod Econ 13:285–294

    Article  Google Scholar 

  • Hwang H, Kim DG (2005) Order-batching heuristics based on cluster analysis in a low-level picker-to-part warehousing system. Int J Prod Res 43:3657–3670

    Article  MATH  Google Scholar 

  • Kulak O, Yilmaz IO, Günther HO (2008) A GA-based solution approach for balancing printed circuit board assembly lines. OR Spectr 30:469–491

    Article  MATH  Google Scholar 

  • Kulak O, Yilmaz IO, Günther HO (2007) PCB assembly scheduling for collect-and-place machines using genetic algorithms. Int J Prod Res 45:3949–3969

    Article  MATH  Google Scholar 

  • Kusiak A, Vannelli A, Kumar RK (1986) Clustering analysis: models and algorithms. Cybernetics 15:139–154

    MathSciNet  MATH  Google Scholar 

  • Laporte G (1992) The vehicle routing problem: an overview of exact and approximate algorithms. Eur J Oper Res 59:345–358

    Article  MATH  Google Scholar 

  • Le-Duc T, De Koster R (2007) Travel time estimation and order batching in a 2-block warehouse. Eur J Oper Res 176:374–388

    Article  MATH  Google Scholar 

  • Makris PA, Giakoumakis IG (2003) k-interchange heuristic as an optimization procedure for material handling applications. Appl Math Model 27:345–358

    Article  MATH  Google Scholar 

  • Or I (1976) Traveling salesman-type combinatorial problems and their relation to the logistics of blood banking. Dissertation, North Western University

  • Petersen CG (1995) Routeing and storage policy interaction in order picking operations. Decis Sci Inst Proc 3:1614–1616

    Google Scholar 

  • Petersen CG (1997) An evaluation of order picking routing policies. Int J Oper Prod Manag 17:1096–1111

    Google Scholar 

  • Ratliff HD, Rosenthal AS (1983) Orderpicking in a rectangular warehouse: a solvable case of the traveling salesman problem. Oper Res 31:507–521

    Article  MATH  Google Scholar 

  • Roodbergen KJ, de Koster R (2001) Routing methods for warehouses with multiple cross aisles. Int J Prod Res 39:1865–1883

    Article  MATH  Google Scholar 

  • Rosenwein MB (1996) A comparison of heuristics for the problem of batching orders for warehouse selection. Int J Prod Res 34:657–664

    Article  MATH  Google Scholar 

  • Tang LC, Chew EK (1997) Order picking systems: batching and storage assignment strategies. Comput Ind Eng 33:817–820

    Article  Google Scholar 

  • Theys C, Bräysy O, Dullaert W, Raa B (2010) Using a TSP heuristic for routing order pickers in warehouses. Eur J Oper Res 200:755–763

    Article  MATH  Google Scholar 

  • Tsai CY, Liou JJH, Huang TM (2007) Using a multiple-GA method to solve the batch picking problem: considering travel distance and order due time. Int J Prod Res 99:1–23

    Google Scholar 

  • Van Nieuwenhuys I, de Koster R (2009) Evaluating order throughput time in 2-block warehouses with time window batching. Int J Prod Econ 121:654–664

    Article  Google Scholar 

  • Vaughan TS, Petersen CG (1999) The effect of warehouse cross aisles on picking efficiency. Int J Prod Res 37:881–897

    Article  MATH  Google Scholar 

  • Vinod H (1969) Integer programming and the theory of grouping. J Am Stat Assoc 64:506–517

    Article  MATH  Google Scholar 

  • Yu M, De Koster RBM (2009) The impact of order batching and picking area zoning on order picking system performance. Eur J Oper Res 198:480–490

    Article  MATH  Google Scholar 

  • Won J, Olafsson S (2005) Joint order batching and order picking in warehouse operations. Eur J Oper Res 43:1427–1442

    MATH  Google Scholar 

Download references

Acknowledgments

This work was completely supported by The Scientific and Technology Research Council of Turkey (TUBITAK) under the project number 108M421. The authors are grateful to the anonymous reviewers and especially the editor, Prof. Dr. Hans-Otto Guenther, for constructive comments and suggestions that improved the quality and exposition of this study.

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Pamukkale University, Denizli, Turkey

    Osman Kulak, Yusuf Sahin & Mustafa Egemen Taner

Authors
  1. Osman Kulak
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yusuf Sahin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mustafa Egemen Taner
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Osman Kulak.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kulak, O., Sahin, Y. & Taner, M.E. Joint order batching and picker routing in single and multiple-cross-aisle warehouses using cluster-based tabu search algorithms. Flex Serv Manuf J 24, 52–80 (2012). https://doi.org/10.1007/s10696-011-9101-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10696-011-9101-8

Keywords

Search

Navigation