IDEAS home Printed from https://ideas.repec.org/p/mag/wpaper/110026.html
   My bibliography  Save this paper

A Grouping Genetic Algorithm for the Order Batching Problem in Distribution Warehouses

Author

Listed:
  • Sören Koch

    () (Faculty of Economics and Management, Otto-von-Guericke University Magdeburg)

  • Gerhard Wäscher

    () (Faculty of Economics and Management, Otto-von-Guericke University Magdeburg)

Abstract

Order picking is a warehouse function that deals with the retrieval of articles from their storage locations in order to satisfy certain customer demands. Combining several single customer orders into one (more substantial) picking order can increase the efficiency of warehouse operations. The Order Batching Problem considered in this paper deals with the question of how different customer orders should be grouped into picking orders, such that the total length of all tours through the warehouse is minimized, which are necessary to collect all requested articles. For the solution of this problem, the authors introduce a Grouping Genetic Algorithm. This genetic algorithm is combined with a local search procedure which results in a highly competitive hybrid algorithm. In a series of extensive numerical experiments, the algorithm is benchmarked against a genetic algorithm with a standard item-oriented encoding scheme. The results show that the new genetic algorithm based on the group-oriented encoding scheme is preferable for the Order Batching Problem, and that the algorithm provides high quality solutions in reasonable computing times.

Suggested Citation

  • 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.
  • Handle: RePEc:mag:wpaper:110026
    as

    Download full text from publisher

    File URL: http://www.fww.ovgu.de/fww_media/femm/femm_2011/2011_26.pdf
    File Function: First version, 2011
    Download Restriction: no

    References listed on IDEAS

    as
    1. 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.
    2. Van Nieuwenhuyse, Inneke & de Koster, René B.M., 2009. "Evaluating order throughput time in 2-block warehouses with time window batching," International Journal of Production Economics, Elsevier, vol. 121(2), pages 654-664, October.
    3. Gibson, David R. & Sharp, Gunter P., 1992. "Order batching procedures," European Journal of Operational Research, Elsevier, vol. 58(1), pages 57-67, April.
    4. Goncalves, Jose Fernando, 2007. "A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1212-1229, December.
    5. Petersen, Charles G. & Aase, Gerald, 2004. "A comparison of picking, storage, and routing policies in manual order picking," International Journal of Production Economics, Elsevier, vol. 92(1), pages 11-19, November.
    Full references (including those not matched with items on IDEAS)

    More about this item

    Keywords

    Warehouse Management; Order Picking; Order Batching; Genetic Algorithms;

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    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:mag:wpaper:110026. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guido Henkel). General contact details of provider: http://edirc.repec.org/data/fwmagde.html .

    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 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.