Solving the forward-reserve allocation problem in warehouse order picking systems

J Gu, M Goetschalckx and L F McGinnis
Additional contact information
J Gu: Nestle USA
M Goetschalckx: School of Industrial and Systems Engineering, Georgia Institute of Technology
L F McGinnis: School of Industrial and Systems Engineering, Georgia Institute of Technology

Journal of the Operational Research Society, 2010, vol. 61, issue 6, 1013-1021

Abstract: Abstract Many warehouses store at least some goods in two areas, a reserve area that is efficient for storage and a forward area that is efficient for order picking. The forward-reserve allocation problem determines the set of Stock-Keeping Units and their space allocations in the forward area to maximize the forward area's benefit by trading off the relevant costs of order picking and internal replenishment. The mathematical model of this decision resembles the classical knapsack problem with the additional complexity that it has a discontinuous nonlinear cost function. A simple greedy heuristic has been proposed in the literature to solve this problem. This paper proposes an alternative branch-and-bound algorithm that can quickly solve the problem to optimality. Heuristic and optimal solutions are numerically compared using problem instances based on real warehouse data. Results suggest that the heuristic solutions are very close to the optimal ones in terms of both the objective value and the forward assignment.

Keywords: warehousing; forward-reserve warehouse; order picking; branch-and-bound algorithm (search for similar items in EconPapers)
Date: 2010
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (12)

Downloads: (external link)
http://link.springer.com/10.1057/jors.2009.39 Abstract (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:pal:jorsoc:v:61:y:2010:i:6:d:10.1057_jors.2009.39

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274

DOI: 10.1057/jors.2009.39

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald and Jonathan Crook

More articles in Journal of the Operational Research Society from Palgrave Macmillan, The OR Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().