IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v284y2020i2d10.1007_s10479-019-03274-3.html
   My bibliography  Save this article

A Benders decomposition approach to product location in carousel storage systems

Author

Listed:
  • Raymond G. Vickson

    (University of Waterloo)

  • Elkafi Hassini

    (McMaster University)

  • Nader Azad

    (University of Ontario Institute of Technology)

Abstract

In this paper we discuss the problem of locating items within carousel bins in order to minimize the average carousel rotational distance per retrieval. We consider two cases: (1) a single two-dimensional carousel and (2) a group of two one-dimensional carousels. The corresponding problems are formulated as mixed-integer programs. In the second problem we apply concepts from Markovian performance evaluation methods to write the objective functions in a simple linear form. We also define a set of uniqueness constraints that significantly reduces the size of the solution feasibility space. We then apply Benders decomposition algorithm to solve both problems. We develop a closed form solution for the dual subprobem and present numerical results to show the efficiency of the proposed solution methodology.

Suggested Citation

  • Raymond G. Vickson & Elkafi Hassini & Nader Azad, 2020. "A Benders decomposition approach to product location in carousel storage systems," Annals of Operations Research, Springer, vol. 284(2), pages 623-643, January.
    • Handle: RePEc:spr:annopr:v:284:y:2020:i:2:d:10.1007_s10479-019-03274-3
    DOI: 10.1007/s10479-019-03274-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-019-03274-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-019-03274-3?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. Mokhtar S. Bazaraa & Hanif D. Sherali, 1980. "Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 27(1), pages 29-41, March.
    2. Kaufman, L. & Broeckx, F., 1978. "An algorithm for the quadratic assignment problem using Bender's decomposition," European Journal of Operational Research, Elsevier, vol. 2(3), pages 207-211, May.
    3. Guenov, Marin & Raeside, Robert, 1992. "Zone shapes in class based storage and multicommand order picking when storage/retrieval machines are used," European Journal of Operational Research, Elsevier, vol. 58(1), pages 37-47, April.
    Full references (including those not matched with items on IDEAS)

    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. Abdelaziz, Fouad Ben & Maddah, Bacel & Flamand, Tülay & Azar, Jimmy, 2024. "Store-Wide space planning balancing impulse and convenience," European Journal of Operational Research, Elsevier, vol. 312(1), pages 211-226.
    2. Mohammad Javad Feizollahi & Igor Averbakh, 2014. "The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows," INFORMS Journal on Computing, INFORMS, vol. 26(2), pages 321-335, May.
    3. Matteo Fischetti & Michele Monaci & Domenico Salvagnin, 2012. "Three Ideas for the Quadratic Assignment Problem," Operations Research, INFORMS, vol. 60(4), pages 954-964, August.
    4. Kim, J. -Y. & Kim, Y. -D., 1995. "Graph theoretic heuristics for unequal-sized facility layout problems," Omega, Elsevier, vol. 23(4), pages 391-401, August.
    5. Hanif Sherali, 2007. "RLT: A unified approach for discrete and continuous nonconvex optimization," Annals of Operations Research, Springer, vol. 149(1), pages 185-193, February.
    6. Yang Wang & Wei Yang & Abraham P. Punnen & Jingbo Tian & Aihua Yin & Zhipeng Lü, 2021. "The Rank-One Quadratic Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 979-996, July.
    7. Huizhen Zhang & Cesar Beltran-Royo & Liang Ma, 2013. "Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers," Annals of Operations Research, Springer, vol. 207(1), pages 261-278, August.
    8. Sven Boge & Sigrid Knust, 2023. "The blocks relocation problem with item families minimizing the number of reshuffles," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 45(2), pages 395-435, June.
    9. Ketan Date & Rakesh Nagi, 2019. "Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters," INFORMS Journal on Computing, INFORMS, vol. 31(4), pages 771-789, October.
    10. Ravi Kumar, K. & Hadjinicola, George C. & Lin, Ting-li, 1995. "A heuristic procedure for the single-row facility layout problem," European Journal of Operational Research, Elsevier, vol. 87(1), pages 65-73, November.
    11. Ebery, Jamie, 2001. "Solving large single allocation p-hub problems with two or three hubs," European Journal of Operational Research, Elsevier, vol. 128(2), pages 447-458, January.
    12. Ball, Michael O. & Kaku, Bharat K. & Vakhutinsky, Andrew, 1998. "Network-based formulations of the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 104(1), pages 241-249, January.
    13. Feizollahi, Mohammad Javad & Feyzollahi, Hadi, 2015. "Robust quadratic assignment problem with budgeted uncertain flows," Operations Research Perspectives, Elsevier, vol. 2(C), pages 114-123.
    14. Jane, Chin-Chia & Laih, Yih-Wenn, 2005. "A clustering algorithm for item assignment in a synchronized zone order picking system," European Journal of Operational Research, Elsevier, vol. 166(2), pages 489-496, October.
    15. de Koster, M.B.M. & Le-Duc, T. & Roodbergen, K.J., 2006. "Design and Control of Warehouse Order Picking: a literature review," ERIM Report Series Research in Management ERS-2006-005-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    16. Roodbergen, Kees Jan & Vis, Iris F.A., 2009. "A survey of literature on automated storage and retrieval systems," European Journal of Operational Research, Elsevier, vol. 194(2), pages 343-362, April.
    17. Fernando Stefanello & Vaneet Aggarwal & Luciana S. Buriol & Mauricio G. C. Resende, 2019. "Hybrid algorithms for placement of virtual machines across geo-separated data centers," Journal of Combinatorial Optimization, Springer, vol. 38(3), pages 748-793, October.
    18. de Koster, Rene & Le-Duc, Tho & Roodbergen, Kees Jan, 2007. "Design and control of warehouse order picking: A literature review," European Journal of Operational Research, Elsevier, vol. 182(2), pages 481-501, October.
    19. Russ J. Vander Wiel & Nikolaos V. Sahinidis, 1996. "An exact solution approach for the time‐dependent traveling‐salesman problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(6), pages 797-820, September.
    20. Nyberg, Axel & Westerlund, Tapio, 2012. "A new exact discrete linear reformulation of the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 220(2), pages 314-319.

    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:spr:annopr:v:284:y:2020:i:2:d:10.1007_s10479-019-03274-3. 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.springer.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.