IDEAS home Printed from https://ideas.repec.org/a/ids/ijmore/v2y2010i6p674-693.html
   My bibliography  Save this article

An integrated storage space and berth allocation problem in a container terminal

Author

Listed:
  • Nima Safaei
  • Mohammad Bazzazi
  • Pooria Assadi

Abstract

In this paper, an integrated storage space allocation and berth assignment problem is proposed for the import containers in a container terminal. This problem is adopted from a real-world situation, in which the type of container affects the decision-making process for the storage space allocation problem (SSAP). A two-level approach is proposed to solve this problem. The SSAP and the berth assignment problem are formulated as mathematical programming models in two consecutive levels. In the first level, the import containers are allocated to the storage blocks in order to minimise the storage/retrieval times of the containers. The vessels are then allocated to the berth locations in the second level according to the results obtained from the first level in order to minimise the total distance travelled by container handling equipments between the storage blocks and the vessel berth locations. The performance of the extended model is examined and verified by a number of numerical examples.

Suggested Citation

  • Nima Safaei & Mohammad Bazzazi & Pooria Assadi, 2010. "An integrated storage space and berth allocation problem in a container terminal," International Journal of Mathematics in Operational Research, Inderscience Enterprises Ltd, vol. 2(6), pages 674-693.
    • Handle: RePEc:ids:ijmore:v:2:y:2010:i:6:p:674-693
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=35494
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    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. Bierwirth, Christian & Meisel, Frank, 2015. "A follow-up survey of berth allocation and quay crane scheduling problems in container terminals," European Journal of Operational Research, Elsevier, vol. 244(3), pages 675-689.
    2. Qingcheng Zeng & Yuanjun Feng & Zigen Chen, 2017. "Optimizing berth allocation and storage space in direct transshipment operations at container terminals," Maritime Economics & Logistics, Palgrave Macmillan;International Association of Maritime Economists (IAME), vol. 19(3), pages 474-503, August.

    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:ids:ijmore:v:2:y:2010:i:6:p:674-693. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=320 .

    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.