IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v61y2010i6d10.1057_jors.2009.39.html
   My bibliography  Save this article

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

Author

Listed:
  • 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)

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.

Suggested Citation

  • J Gu & M Goetschalckx & L F McGinnis, 2010. "Solving the forward-reserve allocation problem in warehouse order picking systems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(6), pages 1013-1021, June.
    • Handle: RePEc:pal:jorsoc:v:61:y:2010:i:6:d:10.1057_jors.2009.39
    DOI: 10.1057/jors.2009.39
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/jors.2009.39
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/jors.2009.39?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.

    References listed on IDEAS

    as
    1. AGHEZZAF, El-Houssaine, 2005. "Capacity planning and warehouse location in supply chains with uncertain demands," LIDAM Reprints CORE 1808, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    2. Ahmet B. Keha & Ismael R. de Farias & George L. Nemhauser, 2006. "A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization," Operations Research, INFORMS, vol. 54(5), pages 847-858, October.
    3. E Aghezzaf, 2005. "Capacity planning and warehouse location in supply chains with uncertain demands," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(4), pages 453-462, April.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Leung, Eric K.H. & Lee, Carmen Kar Hang & Ouyang, Zhiyuan, 2022. "From traditional warehouses to Physical Internet hubs: A digital twin-based inbound synchronization framework for PI-order management," International Journal of Production Economics, Elsevier, vol. 244(C).
    2. Walter, Rico & Boysen, Nils & Scholl, Armin, 2013. "The discrete forward–reserve problem – Allocating space, selecting products, and area sizing in forward order picking," European Journal of Operational Research, Elsevier, vol. 229(3), pages 585-594.
    3. Jiang, Min & Huang, George Q., 2022. "Intralogistics synchronization in robotic forward-reserve warehouses for e-commerce last-mile delivery," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
    4. Lam, H.Y. & Ho, G.T.S. & Mo, Daniel Y. & Tang, Valerie, 2023. "Responsive pick face replenishment strategy for stock allocation to fulfil e-commerce order," International Journal of Production Economics, Elsevier, vol. 264(C).
    5. Boysen, Nils & Emde, Simon & Hoeck, Michael & Kauderer, Markus, 2015. "Part logistics in the automotive industry: Decision problems, literature review and research agenda," European Journal of Operational Research, Elsevier, vol. 242(1), pages 107-120.
    6. de Vries, Harwin & Carrasco-Gallego, Ruth & Farenhorst-Yuan, Taoying & Dekker, Rommert, 2014. "Prioritizing replenishments of the piece picking area," European Journal of Operational Research, Elsevier, vol. 236(1), pages 126-134.
    7. AERTS, Babiche & CORNELISSENS, Trijntje & SÖRENSEN, Kenneth, 2022. "The internal warehouse replenishment problem: the importance of storage and replenishment policies," Working Papers 2022007, University of Antwerp, Faculty of Business and Economics.
    8. Çelik, Melih & Archetti, Claudia & Süral, Haldun, 2022. "Inventory routing in a warehouse: The storage replenishment routing problem," European Journal of Operational Research, Elsevier, vol. 301(3), pages 1117-1132.
    9. Dragan Djurdjević & Nenad Bjelić & Dražen Popović & Milan Andrejić, 2022. "A Combined Dynamic Programming and Simulation Approach to the Sizing of the Low-Level Order-Picking Area," Mathematics, MDPI, vol. 10(20), pages 1-23, October.
    10. Simon Emde, 2017. "Scheduling the replenishment of just-in-time supermarkets in assembly plants," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(1), pages 321-345, January.
    11. Zheng Wang & Jiuh‐Biing Sheu & Chung‐Piaw Teo & Guiqin Xue, 2022. "Robot Scheduling for Mobile‐Rack Warehouses: Human–Robot Coordinated Order Picking Systems," Production and Operations Management, Production and Operations Management Society, vol. 31(1), pages 98-116, January.
    12. Jiang, Min & Leung, K.H. & Lyu, Zhongyuan & Huang, George Q., 2020. "Picking-replenishment synchronization for robotic forward-reserve warehouses," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 144(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. M. Fattahi & M. Mahootchi & S. M. Moattar Husseini, 2016. "Integrated strategic and tactical supply chain planning with price-sensitive demands," Annals of Operations Research, Springer, vol. 242(2), pages 423-456, July.
    2. Zhizhu Lai & Qun Yue & Zheng Wang & Dongmei Ge & Yulong Chen & Zhihong Zhou, 2022. "The min-p robust optimization approach for facility location problem under uncertainty," Journal of Combinatorial Optimization, Springer, vol. 44(2), pages 1134-1160, September.
    3. De Rosa, Vincenzo & Gebhard, Marina & Hartmann, Evi & Wollenweber, Jens, 2013. "Robust sustainable bi-directional logistics network design under uncertainty," International Journal of Production Economics, Elsevier, vol. 145(1), pages 184-198.
    4. Gilani, Hani & Sahebi, Hadi, 2022. "A data-driven robust optimization model by cutting hyperplanes on vaccine access uncertainty in COVID-19 vaccine supply chain," Omega, Elsevier, vol. 110(C).
    5. Sahling, Florian & Kayser, Ariane, 2016. "Strategic supply network planning with vendor selection under consideration of risk and demand uncertainty," Omega, Elsevier, vol. 59(PB), pages 201-214.
    6. Renato Matta, 2019. "Product costing in the strategic formation of a supply chain," Annals of Operations Research, Springer, vol. 272(1), pages 389-427, January.
    7. Kiya, Farhad & Davoudpour, Hamid, 2012. "Stochastic programming approach to re-designing a warehouse network under uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(5), pages 919-936.
    8. Corberán, Ángel & Landete, Mercedes & Peiró, Juanjo & Saldanha-da-Gama, Francisco, 2020. "The facility location problem with capacity transfers," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 138(C).
    9. Hahn, G.J. & Kuhn, H., 2012. "Simultaneous investment, operations, and financial planning in supply chains: A value-based optimization approach," International Journal of Production Economics, Elsevier, vol. 140(2), pages 559-569.
    10. Govindan, Kannan & Fattahi, Mohammad, 2017. "Investigating risk and robustness measures for supply chain network design under demand uncertainty: A case study of glass supply chain," International Journal of Production Economics, Elsevier, vol. 183(PC), pages 680-699.
    11. Faugère, Louis & Klibi, Walid & White, Chelsea & Montreuil, Benoit, 2022. "Dynamic pooled capacity deployment for urban parcel logistics," European Journal of Operational Research, Elsevier, vol. 303(2), pages 650-667.
    12. Melo, M.T. & Nickel, S. & Saldanha-da-Gama, F., 2009. "Facility location and supply chain management - A review," European Journal of Operational Research, Elsevier, vol. 196(2), pages 401-412, July.
    13. Marković, Nikola & Ryzhov, Ilya O. & Schonfeld, Paul, 2017. "Evasive flow capture: A multi-period stochastic facility location problem with independent demand," European Journal of Operational Research, Elsevier, vol. 257(2), pages 687-703.
    14. Gong, Hailei & Zhang, Zhi-Hai, 2022. "Benders decomposition for the distributionally robust optimization of pricing and reverse logistics network design in remanufacturing systems," European Journal of Operational Research, Elsevier, vol. 297(2), pages 496-510.
    15. Correia, Isabel & Melo, Teresa, 2019. "Dynamic facility location problem with modular capacity adjustments under uncertainty," Technical Reports on Logistics of the Saarland Business School 17, Saarland University of Applied Sciences (htw saar), Saarland Business School.
    16. Ariane Kayser & Florian Sahling, 2023. "Relocatable modular capacities in risk aware strategic supply network planning under demand uncertainty," Schmalenbach Journal of Business Research, Springer, vol. 75(1), pages 1-35, March.
    17. Fattahi, Mohammad & Govindan, Kannan & Keyvanshokooh, Esmaeil, 2017. "Responsive and resilient supply chain network design under operational and disruption risks with delivery lead-time sensitive customers," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 101(C), pages 176-200.
    18. Correia, Isabel & Nickel, Stefan & Saldanha-da-Gama, Francisco, 2018. "A stochastic multi-period capacitated multiple allocation hub location problem: Formulation and inequalities," Omega, Elsevier, vol. 74(C), pages 122-134.
    19. Aghezzaf, El-Houssaine, 2007. "Production planning and warehouse management in supply networks with inter-facility mold transfers," European Journal of Operational Research, Elsevier, vol. 182(3), pages 1122-1139, November.
    20. Huang, Edward & Goetschalckx, Marc, 2014. "Strategic robust supply chain design based on the Pareto-optimal tradeoff between efficiency and risk," European Journal of Operational Research, Elsevier, vol. 237(2), pages 508-518.

    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:pal:jorsoc:v:61:y:2010:i:6:d:10.1057_jors.2009.39. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc 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 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    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.