IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v129y2011i1p147-156.html
   My bibliography  Save this article

A tabu search algorithm for the relocation problem in a warehousing system

Author

Listed:
  • Chen, Lu
  • Langevin, André
  • Riopel, Diane

Abstract

Relocation of items in a warehousing system is usually used when the handling machines become the bottleneck. This paper addresses the optimization problem of relocation in a warehouse with dynamic operating policy. An integer linear programming formulation is proposed. A two-stage heuristic method is developed to generate an initial solution. A tabu search algorithm is proposed to improve the solution. Two relocation policies are studied and their performances are compared.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:proeco:v:129:y:2011:i:1:p:147-156
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925-5273(10)00350-6
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. 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.
    2. Stephen C. Graves & Warren H. Hausman & Leroy B. Schwarz, 1977. "Storage-Retrieval Interleaving in Automatic Warehousing Systems," Management Science, INFORMS, vol. 23(9), pages 935-945, May.
    3. Berg, J. P. van den & Zijm, W. H. M., 1999. "Models for warehouse management: Classification and examples," International Journal of Production Economics, Elsevier, vol. 59(1-3), pages 519-528, March.
    4. Fred Glover, 1989. "Tabu Search---Part I," INFORMS Journal on Computing, INFORMS, vol. 1(3), pages 190-206, August.
    5. Marc Goetschalckx & H. Donald Ratliff, 1990. "Shared Storage Policies Based on the Duration Stay of Unit Loads," Management Science, INFORMS, vol. 36(9), pages 1120-1132, September.
    6. 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.
    7. 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.
    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. 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. Niraj Ramesh Dayama & Andreas Ernst & Mohan Krishnamoorthy & Vishnu Narayanan & Narayan Rangaraj, 2017. "New models and algorithms for the container stack rearrangement problem by yard cranes in maritime ports," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(4), pages 307-348, December.
    4. 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).
    5. Jonas F. Leon & Yuda Li & Mohammad Peyman & Laura Calvet & Angel A. Juan, 2023. "A Discrete-Event Simheuristic for Solving a Realistic Storage Location Assignment Problem," Mathematics, MDPI, vol. 11(7), pages 1-24, March.
    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. Hsieh, Ling-Feng & Huang, Yi-Chen, 2011. "New batch construction heuristics to optimise the performance of order picking systems," International Journal of Production Economics, Elsevier, vol. 131(2), pages 618-630, June.
    8. Xuan Zhang & Tiantian Mo & Yougong Zhang, 2023. "Optimization of Storage Location Assignment for Non-Traditional Layout Warehouses Based on the Firework Algorithm," Sustainability, MDPI, vol. 15(13), pages 1-21, June.
    9. Derhami, Shahab & Smith, Jeffrey S. & Gue, Kevin R., 2020. "A simulation-based optimization approach to design optimal layouts for block stacking warehouses," International Journal of Production Economics, Elsevier, vol. 223(C).
    10. 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).

    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. 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.
    2. 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.
    3. Ang, Marcus & Lim, Yun Fong, 2019. "How to optimize storage classes in a unit-load warehouse," European Journal of Operational Research, Elsevier, vol. 278(1), pages 186-201.
    4. Gu, Jinxiang & Goetschalckx, Marc & McGinnis, Leon F., 2010. "Research on warehouse design and performance evaluation: A comprehensive review," European Journal of Operational Research, Elsevier, vol. 203(3), pages 539-549, June.
    5. Muppani (Muppant), Venkata Reddy & Adil, Gajendra Kumar, 2008. "Efficient formation of storage classes for warehouse storage location assignment: A simulated annealing approach," Omega, Elsevier, vol. 36(4), pages 609-618, August.
    6. 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.
    7. Zhuxi Chen & Xiaoping Li & Jatinder N.D. Gupta, 2016. "Sequencing the storages and retrievals for flow-rack automated storage and retrieval systems with duration-of-stay storage policy," International Journal of Production Research, Taylor & Francis Journals, vol. 54(4), pages 984-998, February.
    8. 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).
    9. 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.
    10. 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.
    11. Muppani (Muppant), Venkata Reddy & Adil, Gajendra Kumar, 2008. "A branch and bound algorithm for class based storage location assignment," European Journal of Operational Research, Elsevier, vol. 189(2), pages 492-507, September.
    12. Gianluca Nastasi & Valentina Colla & Silvia Cateni & Simone Campigli, 2018. "Implementation and comparison of algorithms for multi-objective optimization based on genetic algorithms applied to the management of an automated warehouse," Journal of Intelligent Manufacturing, Springer, vol. 29(7), pages 1545-1557, October.
    13. 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.
    14. 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.
    15. 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.
    16. Robert A. Ruben & F. Robert Jacobs, 1999. "Batch Construction Heuristics and Storage Assignment Strategies for Walk/Ride and Pick Systems," Management Science, INFORMS, vol. 45(4), pages 575-596, April.
    17. 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.
    18. 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.
    19. Çağla Cergibozan & A. Serdar Tasan, 2019. "Order batching operations: an overview of classification, solution techniques, and future research," Journal of Intelligent Manufacturing, Springer, vol. 30(1), pages 335-349, January.
    20. 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).

    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:proeco:v:129:y:2011:i:1:p:147-156. 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/locate/ijpe .

    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.