IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v245y2015i2p415-422.html
   My bibliography  Save this article

An improved mathematical formulation for the blocks relocation problem

Author

Listed:
  • Zehendner, Elisabeth
  • Caserta, Marco
  • Feillet, Dominique
  • Schwarze, Silvia
  • Voß, Stefan

Abstract

This paper deals with the blocks relocation problem (also called container relocation problem). First, it corrects the binary linear programming model BRP-II presented in Caserta et al. (2012). Second, it improves the initial model formulation by removing superfluous variables, tightening some constraints, introducing a new upper bound and applying a pre-processing step to fix several variables. Computational results show the efficiency of the improved model for small and medium sized instances.

Suggested Citation

  • Zehendner, Elisabeth & Caserta, Marco & Feillet, Dominique & Schwarze, Silvia & Voß, Stefan, 2015. "An improved mathematical formulation for the blocks relocation problem," European Journal of Operational Research, Elsevier, vol. 245(2), pages 415-422.
    • Handle: RePEc:eee:ejores:v:245:y:2015:i:2:p:415-422
    DOI: 10.1016/j.ejor.2015.03.032
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221715002398
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2015.03.032?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. Jin, Bo & Zhu, Wenbin & Lim, Andrew, 2015. "Solving the container relocation problem by an improved greedy look-ahead heuristic," European Journal of Operational Research, Elsevier, vol. 240(3), pages 837-847.
    2. Petering, Matthew E.H. & Hussein, Mazen I., 2013. "A new mixed integer program and extended look-ahead heuristic algorithm for the block relocation problem," European Journal of Operational Research, Elsevier, vol. 231(1), pages 120-130.
    3. Lehnfeld, Jana & Knust, Sigrid, 2014. "Loading, unloading and premarshalling of stacks in storage areas: Survey and classification," European Journal of Operational Research, Elsevier, vol. 239(2), pages 297-312.
    4. Caserta, Marco & Schwarze, Silvia & Voß, Stefan, 2012. "A mathematical formulation and complexity considerations for the blocks relocation problem," European Journal of Operational Research, Elsevier, vol. 219(1), pages 96-104.
    5. Bortfeldt, Andreas & Forster, Florian, 2012. "A tree search procedure for the container pre-marshalling problem," European Journal of Operational Research, Elsevier, vol. 217(3), pages 531-540.
    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. Jin, Bo & Tanaka, Shunji, 2023. "An exact algorithm for the unrestricted container relocation problem with new lower bounds and dominance rules," European Journal of Operational Research, Elsevier, vol. 304(2), pages 494-514.
    2. Feng, Yuanjun & Song, Dong-Ping & Li, Dong & Zeng, Qingcheng, 2020. "The stochastic container relocation problem with flexible service policies," Transportation Research Part B: Methodological, Elsevier, vol. 141(C), pages 116-163.
    3. Galle, Virgile & Barnhart, Cynthia & Jaillet, Patrick, 2018. "A new binary formulation of the restricted Container Relocation Problem based on a binary encoding of configurations," European Journal of Operational Research, Elsevier, vol. 267(2), pages 467-477.
    4. Azab, Ahmed & Morita, Hiroshi, 2022. "Coordinating truck appointments with container relocations and retrievals in container terminals under partial appointments information," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 160(C).
    5. Azab, Ahmed & Morita, Hiroshi, 2022. "The block relocation problem with appointment scheduling," European Journal of Operational Research, Elsevier, vol. 297(2), pages 680-694.
    6. Tanaka, Shunji & Voß, Stefan, 2019. "An exact algorithm for the block relocation problem with a stowage plan," European Journal of Operational Research, Elsevier, vol. 279(3), pages 767-781.
    7. Galle, Virgile & Barnhart, Cynthia & Jaillet, Patrick, 2018. "Yard Crane Scheduling for container storage, retrieval, and relocation," European Journal of Operational Research, Elsevier, vol. 271(1), pages 288-316.
    8. Zweers, Bernard G. & Bhulai, Sandjai & van der Mei, Rob D., 2020. "Optimizing pre-processing and relocation moves in the Stochastic Container Relocation Problem," European Journal of Operational Research, Elsevier, vol. 283(3), pages 954-971.
    9. Andresson Silva Firmino & Ricardo Martins Abreu Silva & Valéria Cesário Times, 2019. "A reactive GRASP metaheuristic for the container retrieval problem to reduce crane’s working time," Journal of Heuristics, Springer, vol. 25(2), pages 141-173, April.
    10. Huiling Zhu, 2022. "Integrated Containership Stowage Planning: A Methodology for Coordinating Containership Stowage Plan and Terminal Yard Operations," Sustainability, MDPI, vol. 14(20), pages 1-18, October.
    11. Boge, Sven & Goerigk, Marc & Knust, Sigrid, 2020. "Robust optimization for premarshalling with uncertain priority classes," European Journal of Operational Research, Elsevier, vol. 287(1), pages 191-210.
    12. Gharehgozli, Amir & Zaerpour, Nima, 2018. "Stacking outbound barge containers in an automated deep-sea terminal," European Journal of Operational Research, Elsevier, vol. 267(3), pages 977-995.
    13. V. Galle & V. H. Manshadi & S. Borjian Boroujeni & C. Barnhart & P. Jaillet, 2018. "The Stochastic Container Relocation Problem," Transportation Science, INFORMS, vol. 52(5), pages 1035-1058, October.
    14. de Melo da Silva, Marcos & Toulouse, Sophie & Wolfler Calvo, Roberto, 2018. "A new effective unified model for solving the Pre-marshalling and Block Relocation Problems," European Journal of Operational Research, Elsevier, vol. 271(1), pages 40-56.
    15. Bacci, Tiziano & Mattia, Sara & Ventura, Paolo, 2020. "A branch-and-cut algorithm for the restricted Block Relocation Problem," European Journal of Operational Research, Elsevier, vol. 287(2), pages 452-459.
    16. Raka Jovanovic & Shunji Tanaka & Tatsushi Nishi & Stefan Voß, 2019. "A GRASP approach for solving the Blocks Relocation Problem with Stowage Plan," Flexible Services and Manufacturing Journal, Springer, vol. 31(3), pages 702-729, September.
    17. Jovanovic, Raka & Tuba, Milan & Voß, Stefan, 2019. "An efficient ant colony optimization algorithm for the blocks relocation problem," European Journal of Operational Research, Elsevier, vol. 274(1), pages 78-90.
    18. Feng, Yuanjun & Song, Dong-Ping & Li, Dong & Xie, Ying, 2022. "Service fairness and value of customer information for the stochastic container relocation problem under flexible service policy," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 167(C).
    19. Tanaka, Shunji & Voß, Stefan, 2022. "An exact approach to the restricted block relocation problem based on a new integer programming formulation," European Journal of Operational Research, Elsevier, vol. 296(2), pages 485-503.
    20. Zehendner, Elisabeth & Feillet, Dominique & Jaillet, Patrick, 2017. "An algorithm with performance guarantee for the Online Container Relocation Problem," European Journal of Operational Research, Elsevier, vol. 259(1), pages 48-62.
    21. Huiling Zhu & Mingjun Ji & Wenwen Guo & Qingbin Wang & Yongzhi Yang, 2019. "Mathematical formulation and heuristic algorithm for the block relocation and loading problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 66(4), pages 333-351, June.
    22. Silva, Marcos de Melo da & Erdoğan, Güneş & Battarra, Maria & Strusevich, Vitaly, 2018. "The Block Retrieval Problem," European Journal of Operational Research, Elsevier, vol. 265(3), pages 931-950.

    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. Boge, Sven & Goerigk, Marc & Knust, Sigrid, 2020. "Robust optimization for premarshalling with uncertain priority classes," European Journal of Operational Research, Elsevier, vol. 287(1), pages 191-210.
    2. Ting, Ching-Jung & Wu, Kun-Chih, 2017. "Optimizing container relocation operations at container yards with beam search," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 103(C), pages 17-31.
    3. Galle, Virgile & Barnhart, Cynthia & Jaillet, Patrick, 2018. "A new binary formulation of the restricted Container Relocation Problem based on a binary encoding of configurations," European Journal of Operational Research, Elsevier, vol. 267(2), pages 467-477.
    4. Jovanovic, Raka & Tuba, Milan & Voß, Stefan, 2019. "An efficient ant colony optimization algorithm for the blocks relocation problem," European Journal of Operational Research, Elsevier, vol. 274(1), pages 78-90.
    5. Jin, Bo & Tanaka, Shunji, 2023. "An exact algorithm for the unrestricted container relocation problem with new lower bounds and dominance rules," European Journal of Operational Research, Elsevier, vol. 304(2), pages 494-514.
    6. Huiling Zhu & Mingjun Ji & Wenwen Guo & Qingbin Wang & Yongzhi Yang, 2019. "Mathematical formulation and heuristic algorithm for the block relocation and loading problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 66(4), pages 333-351, June.
    7. Tanaka, Shunji & Voß, Stefan, 2019. "An exact algorithm for the block relocation problem with a stowage plan," European Journal of Operational Research, Elsevier, vol. 279(3), pages 767-781.
    8. 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.
    9. Feng, Yuanjun & Song, Dong-Ping & Li, Dong & Zeng, Qingcheng, 2020. "The stochastic container relocation problem with flexible service policies," Transportation Research Part B: Methodological, Elsevier, vol. 141(C), pages 116-163.
    10. Parreño-Torres, Consuelo & Alvarez-Valdes, Ramon & Ruiz, Rubén, 2019. "Integer programming models for the pre-marshalling problem," European Journal of Operational Research, Elsevier, vol. 274(1), pages 142-154.
    11. de Melo da Silva, Marcos & Toulouse, Sophie & Wolfler Calvo, Roberto, 2018. "A new effective unified model for solving the Pre-marshalling and Block Relocation Problems," European Journal of Operational Research, Elsevier, vol. 271(1), pages 40-56.
    12. Kap Hwan Kim & Sanghyuk Yi, 2021. "Utilizing information sources to reduce relocation of inbound containers," Maritime Economics & Logistics, Palgrave Macmillan;International Association of Maritime Economists (IAME), vol. 23(4), pages 726-749, December.
    13. Ruiyou Zhang & Shixin Liu & Herbert Kopfer, 2016. "Tree search procedures for the blocks relocation problem with batch moves," Flexible Services and Manufacturing Journal, Springer, vol. 28(3), pages 397-424, September.
    14. Gharehgozli, Amir & Zaerpour, Nima, 2018. "Stacking outbound barge containers in an automated deep-sea terminal," European Journal of Operational Research, Elsevier, vol. 267(3), pages 977-995.
    15. Zehendner, Elisabeth & Feillet, Dominique & Jaillet, Patrick, 2017. "An algorithm with performance guarantee for the Online Container Relocation Problem," European Journal of Operational Research, Elsevier, vol. 259(1), pages 48-62.
    16. Zhang, Canrong & Guan, Hao & Yuan, Yifei & Chen, Weiwei & Wu, Tao, 2020. "Machine learning-driven algorithms for the container relocation problem," Transportation Research Part B: Methodological, Elsevier, vol. 139(C), pages 102-131.
    17. Boschma, René & Mes, Martijn R.K. & de Vries, Leon R., 2023. "Approximate dynamic programming for container stacking," European Journal of Operational Research, Elsevier, vol. 310(1), pages 328-342.
    18. Lehnfeld, Jana & Knust, Sigrid, 2014. "Loading, unloading and premarshalling of stacks in storage areas: Survey and classification," European Journal of Operational Research, Elsevier, vol. 239(2), pages 297-312.
    19. Azab, Ahmed & Morita, Hiroshi, 2022. "The block relocation problem with appointment scheduling," European Journal of Operational Research, Elsevier, vol. 297(2), pages 680-694.
    20. Gharehgozli, Amir Hossein & Vernooij, Floris Gerardus & Zaerpour, Nima, 2017. "A simulation study of the performance of twin automated stacking cranes at a seaport container terminal," European Journal of Operational Research, Elsevier, vol. 261(1), pages 108-128.

    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:ejores:v:245:y:2015:i:2:p:415-422. 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/eor .

    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.