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

A new mixed integer program and extended look-ahead heuristic algorithm for the block relocation problem

Author

Listed:
  • Petering, Matthew E.H.
  • Hussein, Mazen I.

Abstract

This paper considers the block relocation problem (BRP), in which a set of identically-sized items is to be retrieved from a set of last-in-first-out (LIFO) stacks in a specific order using the fewest number of moves. The problem is encountered in the maritime container shipping industry and other industries where inventory is stored in stacks. After surveying the work done on the BRP, we introduce “BRP-III”—a new mathematical formulation for the BRP—and show that it has considerably fewer decision variables and better runtime performance than the other formulation in the literature. We then introduce a new look-ahead algorithm (LA-N) that is an extension of the algorithms from the literature and show that the new algorithm generally obtains better solutions than the other algorithms and has minimal CPU runtime.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:231:y:2013:i:1:p:120-130
    DOI: 10.1016/j.ejor.2013.05.037
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221713004360
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2013.05.037?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. De Castilho, Bernardo & Daganzo, Carlos F., 1993. "Handling Strategies for Import Containers at Marine Terminals," University of California Transportation Center, Working Papers qt5gr4622f, University of California Transportation Center.
    2. Mordecai Avriel & Michal Penn & Naomi Shpirer & Smadar Witteboon, 1998. "Stowage planning for container ships to reduce the number of shifts," Annals of Operations Research, Springer, vol. 76(0), pages 55-71, January.
    3. Sculli, D & Hui, CF, 1988. "Three dimensional stacking of containers," Omega, Elsevier, vol. 16(6), pages 585-594.
    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. de Castillo, Bernardo & Daganzo, Carlos F., 1993. "Handling strategies for import containers at marine terminals," Transportation Research Part B: Methodological, Elsevier, vol. 27(2), pages 151-166, April.
    6. Li, Wenkai & Wu, Yong & Petering, M.E.H. & Goh, Mark & Souza, Robert de, 2009. "Discrete time model and algorithms for container yard crane scheduling," European Journal of Operational Research, Elsevier, vol. 198(1), pages 165-172, October.
    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. Gharehgozli, A.H. & Roy, D. & de Koster, M.B.M., 2014. "Sea Container Terminals," ERIM Report Series Research in Management ERS-2014-009-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.
    2. 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.
    3. Saurí, S. & Martín, E., 2011. "Space allocating strategies for improving import yard performance at marine terminals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 47(6), pages 1038-1057.
    4. Imai, Akio & Sasaki, Kazuya & Nishimura, Etsuko & Papadimitriou, Stratos, 2006. "Multi-objective simultaneous stowage and load planning for a container ship with container rehandle in yard stacks," European Journal of Operational Research, Elsevier, vol. 171(2), pages 373-389, June.
    5. 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.
    6. Ku, Dusan & Arthanari, Tiru S., 2016. "Container relocation problem with time windows for container departure," European Journal of Operational Research, Elsevier, vol. 252(3), pages 1031-1039.
    7. 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.
    8. Amir Hossein Gharehgozli & Gilbert Laporte & Yugang Yu & René de Koster, 2015. "Scheduling Twin Yard Cranes in a Container Block," Transportation Science, INFORMS, vol. 49(3), pages 686-705, August.
    9. Gharehgozli, Amir Hossein & Yu, Yugang & de Koster, René & Udding, Jan Tijmen, 2014. "An exact method for scheduling a yard crane," European Journal of Operational Research, Elsevier, vol. 235(2), pages 431-447.
    10. Feng, Yuanjun & Song, Dong-Ping & Li, Dong, 2022. "Smart stacking for import containers using customer information at automated container terminals," European Journal of Operational Research, Elsevier, vol. 301(2), pages 502-522.
    11. 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.
    12. Briskorn, Dirk & Drexl, Andreas & Hartmann, Sönke, 2005. "Inventory based dispatching of automated guided vehicles on container terminals," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 596, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    13. Goodchild, Anne V. & Daganzo, Carlos F., 2005. "Crane Double Cycling in Container Ports: Affect on Ship Dwell Time," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt9qp7p7jq, Institute of Transportation Studies, UC Berkeley.
    14. Kim, Kap Hwan & Park, Kang Tae, 2003. "A note on a dynamic space-allocation method for outbound containers," European Journal of Operational Research, Elsevier, vol. 148(1), pages 92-101, July.
    15. Zhang, Chuqian & Wan, Yat-wah & Liu, Jiyin & Linn, Richard J., 2002. "Dynamic crane deployment in container storage yards," Transportation Research Part B: Methodological, Elsevier, vol. 36(6), pages 537-555, July.
    16. Voß, Andre & Guckenbiehl, Gabriel & Schütt, Holger & Buer, Tobias, 2016. "A storage strategy with dynamic bay reservations for container terminals," Bremen Computational Logistics Group Working Papers 4, University of Bremen, Computational Logistics Junior Research Group.
    17. Nils Boysen & Malte Fliedner & Florian Jaehn & Erwin Pesch, 2013. "A Survey on Container Processing in Railway Yards," Transportation Science, INFORMS, vol. 47(3), pages 312-329, August.
    18. Legato, Pasquale & Mazza, Rina M., 2001. "Berth planning and resources optimisation at a container terminal via discrete event simulation," European Journal of Operational Research, Elsevier, vol. 133(3), pages 537-547, 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. 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.

    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:231:y:2013:i:1:p:120-130. 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.