IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-319-00795-3_15.html
   My bibliography  Save this book chapter

Simultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals

In: Operations Research Proceedings 2012

Author

Listed:
  • Necati Aras

    (Boğaziçi University)

  • Yavuz Türkoğulları

    (Boğaziçi University)

  • Z. Caner Taşkın

    (Boğaziçi University)

  • Kuban Altınel

    (Boğaziçi University)

Abstract

In this work, we focus on the integrated planning of the following problems faced within the context of seaside operations at container terminals: berth allocation, quay crane assignment, and quay crane scheduling. First, we formulate a new binary integer linear program for the integrated solution of the berth allocation and quay crane assignment problems called BACAP. Then we extend it by incorporating the crane scheduling problem as well, which is named BACASP. Although the model for BACAP is very efficient and even large instances up to 60 vessels can be solved to optimality, only small instances for BACASP can be solved optimally. To be able to solve large instances, we present a necessary and sufficient condition for generating an optimal solution of BACASP from an optimal solution of BACAP using a postprocessing algorithm. We also develop a cutting plane algorithm for the case where this condition is not satisfied. This algorithm solves BACAP repeatedly by adding cuts generated from the optimal solutions at each trial until the aforementioned condition holds.

Suggested Citation

  • Necati Aras & Yavuz Türkoğulları & Z. Caner Taşkın & Kuban Altınel, 2014. "Simultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals," Operations Research Proceedings, in: Stefan Helber & Michael Breitner & Daniel Rösch & Cornelia Schön & Johann-Matthias Graf von der Schu (ed.), Operations Research Proceedings 2012, edition 127, pages 101-107, Springer.
    • Handle: RePEc:spr:oprchp:978-3-319-00795-3_15
    DOI: 10.1007/978-3-319-00795-3_15
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:spr:oprchp:978-3-319-00795-3_15. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.