IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v60y2022i19p5892-5911.html
   My bibliography  Save this article

An evaluation of several combinations of routing and storage location assignment policies for the order batching problem

Author

Listed:
  • Ufuk Bahçeci
  • Temel Öncan

Abstract

In this work, we address the Order Batching Problem (OBP) and we devise tailor-made Mixed Integer Linear Programming (MILP) formulations of the OBP considering composite, largest gap and optimum routing policies, for the first time. We also introduce a novel picker routing policy named as mixed policy which combines the properties of both midpoint and return routing policies. Then, we perform extensive computational experiments with MILP formulations of the OBP considering several combinations of routing and storage policies under different operating conditions on randomly generated test instances. Finally, we present several managerial insights based on the computational results.

Suggested Citation

  • Ufuk Bahçeci & Temel Öncan, 2022. "An evaluation of several combinations of routing and storage location assignment policies for the order batching problem," International Journal of Production Research, Taylor & Francis Journals, vol. 60(19), pages 5892-5911, October.
    • Handle: RePEc:taf:tprsxx:v:60:y:2022:i:19:p:5892-5911
    DOI: 10.1080/00207543.2021.1973684
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2021.1973684
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2021.1973684?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    More about this item

    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:taf:tprsxx:v:60:y:2022:i:19:p:5892-5911. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.