IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v33y2005i4p333-343.html
   My bibliography  Save this article

An association-based clustering approach to order batching considering customer demand patterns

Author

Listed:
  • Chen, Mu-Chen
  • Wu, Hsiao-Pin

Abstract

Research on warehousing systems has gained interest since the 1980s, reflecting the fact that supply chain management has pursued a demand-driven organization with high product variety, small order sizes, and reliable short response times throughout the supply chain. This market trend has affected warehouse management and operations tremendously. Order batching in a warehouse attempts to achieve high-volume order processing operations by consolidating small orders into batches. Order batching is an essential operation of order processing in which several orders are grouped into batches. This paper describes the development of an order batching approach based on data mining and integer programming. It is valuable to discover the important associations between orders such that the occurrence of some orders in a batch will cause the occurrence of other orders in the same batch. An order-clustering model based on 0-1 integer programming can be formulated to maximize the associations between orders within each batch. From the results of several test problems, the proposed approach shows its ability to find quality solutions of order batching problems.

Suggested Citation

  • Chen, Mu-Chen & Wu, Hsiao-Pin, 2005. "An association-based clustering approach to order batching considering customer demand patterns," Omega, Elsevier, vol. 33(4), pages 333-343, August.
    • Handle: RePEc:eee:jomega:v:33:y:2005:i:4:p:333-343
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305-0483(04)00088-X
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. John M. Mulvey & Harlan P. Crowder, 1979. "Cluster Analysis: An Application of Lagrangian Relaxation," Management Science, INFORMS, vol. 25(4), pages 329-340, April.
    2. Hwang, Hark & Lee, Moon-Kyu, 1988. "Order batching algorithms for a man-on-board automated storage and retrieval system," Engineering Costs and Production Economics, Elsevier, vol. 13(4), pages 285-294, April.
    3. Pan, C-H. & Liu, S-Y., 1995. "A comparative study of order batching algorithms," Omega, Elsevier, vol. 23(6), pages 691-700, December.
    4. Gibson, David R. & Sharp, Gunter P., 1992. "Order batching procedures," European Journal of Operational Research, Elsevier, vol. 58(1), pages 57-67, April.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. de Koster, M.B.M. & Le-Duc, T. & Roodbergen, K.J., 2006. "Design and Control of Warehouse Order Picking: a literature review," ERIM Report Series Research in Management ERS-2006-005-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    2. de Koster, Rene & Le-Duc, Tho & Roodbergen, Kees Jan, 2007. "Design and control of warehouse order picking: A literature review," European Journal of Operational Research, Elsevier, vol. 182(2), pages 481-501, October.
    3. Rouwenhorst, B. & Reuter, B. & Stockrahm, V. & van Houtum, G. J. & Mantel, R. J. & Zijm, W. H. M., 2000. "Warehouse design and control: Framework and literature review," European Journal of Operational Research, Elsevier, vol. 122(3), pages 515-533, May.
    4. Gu, Jinxiang & Goetschalckx, Marc & McGinnis, Leon F., 2007. "Research on warehouse operation: A comprehensive review," European Journal of Operational Research, Elsevier, vol. 177(1), pages 1-21, February.
    5. Sören Koch & Gerhard Wäscher, 2016. "A grouping genetic algorithm for the Order Batching Problem in distribution warehouses," Journal of Business Economics, Springer, vol. 86(1), pages 131-153, January.
    6. Sören Koch & Gerhard Wäscher, 2011. "A Grouping Genetic Algorithm for the Order Batching Problem in Distribution Warehouses," FEMM Working Papers 110026, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    7. Yu, M. & de Koster, M.B.M., 2007. "Performance Approximation and Design of Pick-and-Pass Order Picking Systems," ERIM Report Series Research in Management ERS-2007-082-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    8. Roodbergen, Kees Jan & Vis, Iris F.A., 2009. "A survey of literature on automated storage and retrieval systems," European Journal of Operational Research, Elsevier, vol. 194(2), pages 343-362, April.
    9. Çağla Cergibozan & A. Serdar Tasan, 2019. "Order batching operations: an overview of classification, solution techniques, and future research," Journal of Intelligent Manufacturing, Springer, vol. 30(1), pages 335-349, January.
    10. Sebastian Henn & Gerhard Wäscher, 2010. "Tabu Search Heuristics for the Order Batching Problem in Manual Order Picking Systems," FEMM Working Papers 100007, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    11. Pan, C-H. & Liu, S-Y., 1995. "A comparative study of order batching algorithms," Omega, Elsevier, vol. 23(6), pages 691-700, December.
    12. Sebastian Henn & Sören Koch & Karl Doerner & Christine Strauss & Gerhard Wäscher, 2009. "Metaheuristics for the Order Batching Problem in Manual Order Picking Systems," FEMM Working Papers 09020, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    13. Sergio Gil-Borrás & Eduardo G. Pardo & Antonio Alonso-Ayuso & Abraham Duarte, 2020. "GRASP with Variable Neighborhood Descent for the online order batching problem," Journal of Global Optimization, Springer, vol. 78(2), pages 295-325, October.
    14. Le-Duc, T. & de Koster, M.B.M., 2004. "Travel Time Estimation and Order Barching in a 2-Block Warehouse," ERIM Report Series Research in Management ERS-2004-098-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    15. A. Scholz & G. Wäscher, 2017. "Order Batching and Picker Routing in manual order picking systems: the benefits of integrated routing," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 25(2), pages 491-520, June.
    16. Kulkarni, Girish & Fathi, Yahya, 2007. "Integer programming models for the q-mode problem," European Journal of Operational Research, Elsevier, vol. 182(2), pages 612-625, October.
    17. Chen, Ja-Shen & Heragu, Sunderesh S., 1999. "Stepwise decomposition approaches for large scale cell formation problems," European Journal of Operational Research, Elsevier, vol. 113(1), pages 64-79, February.
    18. Gambella, Claudio & Ghaddar, Bissan & Naoum-Sawaya, Joe, 2021. "Optimization problems for machine learning: A survey," European Journal of Operational Research, Elsevier, vol. 290(3), pages 807-828.
    19. Pan, Jason Chao-Hsien & Shih, Po-Hsun & Wu, Ming-Hung, 2015. "Order batching in a pick-and-pass warehousing system with group genetic algorithm," Omega, Elsevier, vol. 57(PB), pages 238-248.
    20. Maniezzo, Vittorio & Boschetti, Marco A. & Gutjahr, Walter J., 2021. "Stochastic premarshalling of block stacking warehouses," Omega, Elsevier, vol. 102(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:jomega:v:33:y:2005:i:4:p:333-343. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.