IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v169y2023ics1366554522003714.html
   My bibliography  Save this article

The warehouse reshuffling problem with swap moves

Author

Listed:
  • Buckow, Jan-Niklas
  • Knust, Sigrid

Abstract

The warehouse reshuffling problem deals with rearranging pallets in a storage from their initial to desired locations as fast as possible. In most studies involving the rearrangement of pallets, only relocation moves have been considered where a pallet is always relocated to an empty storage location. In this paper, we consider a warehouse with a twin shuttle stacker crane, which is designed to perform swap moves where the pallet at a storage location is swapped with that currently loaded on the stacker crane. We analyze and evaluate the warehouse reshuffling problem with swap moves, both analytically and experimentally, and examine differences to the problem variant with relocation moves. We propose heuristic algorithms as well as a transformation to the traveling salesman problem, which is applied to calculate optimal solutions using exact algorithms. Finally, we present computational results for randomly generated data based on a real-world company setting.

Suggested Citation

  • Buckow, Jan-Niklas & Knust, Sigrid, 2023. "The warehouse reshuffling problem with swap moves," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 169(C).
    • Handle: RePEc:eee:transe:v:169:y:2023:i:c:s1366554522003714
    DOI: 10.1016/j.tre.2022.102994
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554522003714
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.tre.2022.102994?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. Warren H. Hausman & Leroy B. Schwarz & Stephen C. Graves, 1976. "Optimal Storage Assignment in Automatic Warehousing Systems," Management Science, INFORMS, vol. 22(6), pages 629-638, February.
    2. Boysen, Nils & Stephan, Konrad, 2016. "A survey on single crane scheduling in automated storage/retrieval systems," European Journal of Operational Research, Elsevier, vol. 254(3), pages 691-704.
    3. Chen, Gang & Feng, Haolin & Luo, Kaiyi & Tang, Yanli, 2021. "Retrieval-oriented storage relocation optimization of an automated storage and retrieval system," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 155(C).
    4. G. Dantzig & R. Fulkerson & S. Johnson, 1954. "Solution of a Large-Scale Traveling-Salesman Problem," Operations Research, INFORMS, vol. 2(4), pages 393-410, November.
    5. Chen, Lu & Langevin, André & Riopel, Diane, 2011. "A tabu search algorithm for the relocation problem in a warehousing system," International Journal of Production Economics, Elsevier, vol. 129(1), pages 147-156, January.
    6. Nicos Christofides & I. Colloff, 1973. "The Rearrangement of Items in a Warehouse," Operations Research, INFORMS, vol. 21(2), pages 577-589, April.
    7. Pazour, Jennifer A. & Carlo, Héctor J., 2015. "Warehouse reshuffling: Insights and optimization," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 73(C), pages 207-226.
    8. Renaud, Jacques & Boctor, Fayez F., 1998. "An efficient composite heuristic for the symmetric generalized traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 108(3), pages 571-584, August.
    9. Dong, Wenquan & Jin, Mingzhou, 2021. "Travel time models for tier-to-tier SBS/RS with different storage assignment policies and shuttle dispatching rules," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 155(C).
    10. Matteo Fischetti & Juan José Salazar González & Paolo Toth, 1997. "A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem," Operations Research, INFORMS, vol. 45(3), pages 378-394, June.
    11. 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.
    12. Gu, Jinxiang & Goetschalckx, Marc & McGinnis, Leon F., 2007. "Research on warehouse operation: A comprehensive review," European Journal of Operational Research, Elsevier, vol. 177(1), pages 1-21, February.
    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. Chen, Gang & Feng, Haolin & Luo, Kaiyi & Tang, Yanli, 2021. "Retrieval-oriented storage relocation optimization of an automated storage and retrieval system," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 155(C).
    2. Pazour, Jennifer A. & Carlo, Héctor J., 2015. "Warehouse reshuffling: Insights and optimization," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 73(C), pages 207-226.
    3. Silva, Allyson & Coelho, Leandro C. & Darvish, Maryam & Renaud, Jacques, 2020. "Integrating storage location and order picking problems in warehouse planning," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 140(C).
    4. Chen, Ran & Yang, Jingjing & Yu, Yugang & Guo, Xiaolong, 2023. "Retrieval request scheduling in a shuttle-based storage and retrieval system with two lifts," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 174(C).
    5. Boysen, Nils & Schwerdfeger, Stefan & Stephan, Konrad, 2023. "A review of synchronization problems in parts-to-picker warehouses," European Journal of Operational Research, Elsevier, vol. 307(3), pages 1374-1390.
    6. David Winkelmann & Frederik Tolkmitt & Matthias Ulrich & Michael Romer, 2022. "Integrated storage assignment for an e-grocery fulfilment centre: Accounting for day-of-week demand patterns," Papers 2209.03998, arXiv.org, revised May 2023.
    7. Guo, Xiaolong & Chen, Ran & Du, Shaofu & Yu, Yugang, 2021. "Storage assignment for newly arrived items in forward picking areas with limited open locations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 151(C).
    8. Gharehgozli, Amir & Zaerpour, Nima, 2020. "Robot scheduling for pod retrieval in a robotic mobile fulfillment system," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
    9. Mohammed Alnahhal & Bashir Salah & Rafiq Ahmad, 2022. "Increasing Throughput in Warehouses: The Effect of Storage Reallocation and the Location of Input/Output Station," Sustainability, MDPI, vol. 14(8), pages 1-16, April.
    10. Chen, Lu & Langevin, André & Riopel, Diane, 2011. "A tabu search algorithm for the relocation problem in a warehousing system," International Journal of Production Economics, Elsevier, vol. 129(1), pages 147-156, January.
    11. Bortolini, Marco & Faccio, Maurizio & Ferrari, Emilio & Gamberi, Mauro & Pilati, Francesco, 2017. "Time and energy optimal unit-load assignment for automatic S/R warehouses," International Journal of Production Economics, Elsevier, vol. 190(C), pages 133-145.
    12. Zhuang, Yanling & Zhou, Yun & Hassini, Elkafi & Yuan, Yufei & Hu, Xiangpei, 2024. "Improving order picking efficiency through storage assignment optimization in robotic mobile fulfillment systems," European Journal of Operational Research, Elsevier, vol. 316(2), pages 718-732.
    13. Michele Barbato & Alberto Ceselli & Giovanni Righini, 2024. "A polynomial-time dynamic programming algorithm for an optimal picking problem in automated warehouses," Journal of Scheduling, Springer, vol. 27(4), pages 393-407, August.
    14. Marcus Ang & Yun Fong Lim & Melvyn Sim, 2012. "Robust Storage Assignment in Unit-Load Warehouses," Management Science, INFORMS, vol. 58(11), pages 2114-2130, November.
    15. Yu, Y. & de Koster, M.B.M., 2009. "On the Suboptimality of Full Turnover-Based Storage," ERIM Report Series Research in Management ERS-2009-051-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. Boysen, Nils & de Koster, René & Weidinger, Felix, 2019. "Warehousing in the e-commerce era: A survey," European Journal of Operational Research, Elsevier, vol. 277(2), pages 396-411.
    17. Nils Boysen & Konrad Stephan & Felix Weidinger, 2019. "Manual order consolidation with put walls: the batched order bin sequencing problem," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(2), pages 169-193, June.
    18. Tian Liu & Xianhao Xu & Hu Qin & Andrew Lim, 2016. "Travel time analysis of the dual command cycle in the split-platform AS/RS with I/O dwell point policy," Flexible Services and Manufacturing Journal, Springer, vol. 28(3), pages 442-460, September.
    19. Gharehgozli, Amir & Yu, Yugang & de Koster, René & Du, Shaofu, 2019. "Sequencing storage and retrieval requests in a container block with multiple open locations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 125(C), pages 261-284.
    20. Lerher, Tone & Potrc, Iztok & Sraml, Matjaz & Tollazzi, Tomaz, 2010. "Travel time models for automated warehouses with aisle transferring storage and retrieval machine," European Journal of Operational Research, Elsevier, vol. 205(3), pages 571-583, September.

    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:eee:transe:v:169:y:2023:i:c:s1366554522003714. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description .

    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.