IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v48y2016i5p428-439.html
   My bibliography  Save this article

Integrated storage space allocation and ship scheduling problem in bulk cargo terminals

Author

Listed:
  • Lixin Tang
  • Defeng Sun
  • Jiyin Liu

Abstract

This study is motivated by the practices of large iron and steel companies that have steady and heavy demands for bulk raw materials, such as iron ore, coal, limestone, etc. These materials are usually transported to a bulk cargo terminal by ships (or to a station by trains). Once unloaded, they are moved to and stored in a bulk material stockyard, waiting for retrieval for use in production. Efficient storage space allocation and ship scheduling are critical to achieving high space utilization, low material loss, and low transportation costs. In this article, we study the integrated storage space allocation and ship scheduling problem in the bulk cargo terminal. Our problem is different from other associated problems due to the special way that the materials are transported and stored. A novel mixed-integer programming model is developed and then solved using a Benders decomposition algorithm, which is enhanced by the use of various valid inequalities, combinatorial Benders cuts, variable reduction tests, and an iterative heuristic procedure. Computational results indicate that the proposed solution method is much more efficient than the standard solution software CPLEX.

Suggested Citation

  • Lixin Tang & Defeng Sun & Jiyin Liu, 2016. "Integrated storage space allocation and ship scheduling problem in bulk cargo terminals," IISE Transactions, Taylor & Francis Journals, vol. 48(5), pages 428-439, May.
    • Handle: RePEc:taf:uiiexx:v:48:y:2016:i:5:p:428-439
    DOI: 10.1080/0740817X.2015.1063791
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/0740817X.2015.1063791
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/0740817X.2015.1063791?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Nader Ghaffarinasab & Bahar Y. Kara, 2019. "Benders Decomposition Algorithms for Two Variants of the Single Allocation Hub Location Problem," Networks and Spatial Economics, Springer, vol. 19(1), pages 83-108, March.
    2. Unsal, Ozgur & Oguz, Ceyda, 2019. "An exact algorithm for integrated planning of operations in dry bulk terminals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 126(C), pages 103-121.
    3. Sun, Defeng & Meng, Ying & Tang, Lixin & Liu, Jinyin & Huang, Baobin & Yang, Jiefu, 2020. "Storage space allocation problem at inland bulk material stockyard," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 134(C).
    4. João Luiz Marques Andrade & Gustavo Campos Menezes, 2023. "A column generation-based heuristic to solve the integrated planning, scheduling, yard allocation and berth allocation problem in bulk ports," Journal of Heuristics, Springer, vol. 29(1), pages 39-76, February.
    5. Bouzekri, Hamza & Bara, Najat & Alpan, Gülgün & Giard, Vincent, 2022. "An integrated Decision Support System for planning production, storage and bulk port operations in a fertilizer supply chain," International Journal of Production Economics, Elsevier, vol. 252(C).

    More about this item

    Statistics

    Access and download statistics

    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:taf:uiiexx:v:48:y:2016:i:5:p:428-439. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/uiie .

    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.