Order picking in parallel-aisle warehouses with multiple blocks: complexity and a graph theory-based heuristic

Melih Çelik and Haldun Süral

International Journal of Production Research, 2019, vol. 57, issue 3, 888-906

Abstract: In this paper, we consider the order picking problem (OPP), which constitutes one of the special cases of the Steiner travelling salesperson problem and addresses the costliest operation in a warehouse. Given a list of items to be picked and their locations in the warehouse layout, the OPP aims to find the shortest route that starts from a depot point, picks all the items in the list, and returns to the depot. This paper fills two important gaps regarding the OPP. First, to the best of our knowledge, we present the first complexity results on the problem. Second, we propose a heuristic approach that makes use of its graph-theoretic properties. Computational experiments on randomly generated instances show that the heuristic not only outperforms its state-of-the-art counterparts in the literature, but it is also robust in terms of changing problem parameters.

Date: 2019
References: Add references at CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://hdl.handle.net/10.1080/00207543.2018.1489154 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:tprsxx:v:57:y:2019:i:3:p:888-906

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/TPRS20

DOI: 10.1080/00207543.2018.1489154

Access Statistics for this article

International Journal of Production Research is currently edited by Professor A. Dolgui

More articles in International Journal of Production Research from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().