IDEAS home Printed from https://ideas.repec.org/a/wsi/ijitdm/v14y2015i05ns0219622015500169.html
   My bibliography  Save this article

A Pseudo-Polynomial Time Algorithm for a Special Multiobjective Order Picking Problem

Author

Listed:
  • Özgür Özpeynirci

    (Department of Logistics Management, Izmir University of Economics, Sakarya Cad. No: 156, Balçova, Izmir, Turkey)

  • Cansu Kandemir

    (Department of Engineering Management and Systems Engineering, Old Dominion University, 5115 Hampton Boulevard, Norfolk, VA, USA)

Abstract

In this study, we work on the order picking problem (OPP) in a specially designed warehouse with a single picker. Ratliff and Rosenthal [Operations Research31(3) (1983) 507–521] show that the special design of the warehouse and use of one picker lead to a polynomially solvable case. We address the multiobjective version of this special case and investigate the properties of the nondominated points. We develop an exact algorithm that finds any nondominated point and present an illustrative example. Finally we conduct a computational test and report the results.

Suggested Citation

  • Özgür Özpeynirci & Cansu Kandemir, 2015. "A Pseudo-Polynomial Time Algorithm for a Special Multiobjective Order Picking Problem," International Journal of Information Technology & Decision Making (IJITDM), World Scientific Publishing Co. Pte. Ltd., vol. 14(05), pages 1111-1128.
    • Handle: RePEc:wsi:ijitdm:v:14:y:2015:i:05:n:s0219622015500169
    DOI: 10.1142/S0219622015500169
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0219622015500169
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0219622015500169?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Yang, Peng & Zhao, Zhijie & Guo, Huijie, 2020. "Order batch picking optimization under different storage scenarios for e-commerce warehouses," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 136(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:wsi:ijitdm:v:14:y:2015:i:05:n:s0219622015500169. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/ijitdm/ijitdm.shtml .

    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.