Advanced Search
MyIDEAS: Login

Metaheuristics for the Order Batching Problem in Manual Order Picking Systems

Contents:

Author Info

  • Sebastian Henn

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

  • Sören Koch

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

  • Karl Doerner

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

  • Christine Strauss
  • Gerhard Wäscher

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

Registered author(s):

    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 effciently, 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 rst one is based on Iterated Local Search, the second one 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 for operating distribution warehouses signi cantly more effcient.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://www.ww.uni-magdeburg.de/fwwdeka/femm/a2009_Dateien/2009_20.pdf
    File Function: First version, 2009
    Download Restriction: no

    Bibliographic Info

    Paper provided by Otto-von-Guericke University Magdeburg, Faculty of Economics and Management in its series FEMM Working Papers with number 09020.

    as in new window
    Length: 28 pages
    Date of creation: Jun 2009
    Date of revision:
    Handle: RePEc:mag:wpaper:09020

    Contact details of provider:
    Postal: Universitätsplatz 2, Gebäude W und I, 39106 Magdeburg
    Phone: (0391) 67-18 584
    Fax: (0391) 67-12 120
    Web page: http://www.ww.uni-magdeburg.de
    More information through EDIRC

    Related research

    Keywords: Warehouse Management; Order Picking; Order Batching; Iterated Local Search; Ant Colony Optimization;

    References

    References listed on IDEAS
    Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
    as in new window
    1. Stutzle, Thomas, 2006. "Iterated local search for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1519-1539, November.
    2. 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)

    Citations

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:mag:wpaper:09020. 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).

    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 references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link 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 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.