IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-540-26686-0_8.html
   My bibliography  Save this book chapter

A beam search algorithm for the load sequencing of outbound containers in port container terminals

In: Container Terminals and Automated Transport Systems

Author

Listed:
  • Kap Hwan Kim

    (Pusan National University)

  • Jin Soo Kang

    (Pusan National University)

  • Kwang Ryel Ryu

    (Pusan National University)

Abstract

Abeam search algorithm was applied to solve the load-sequencing problem in port container terminals. The algorithm was used to maximize the operational efficiency of transfer cranes and quay cranes (QCs) while satisfying various constraints on stacking containers onto vessels. The load-sequencing problem consisted of two decision-making subproblems. In the first subproblem, a pickup schedule was constructed in which the travel route of a transfer crane (TC) as well as the number of containers it must pick up at each yard-bay are determined. In the second subproblem, the load sequence for individual containers was determined. This study suggested a search scheme in which an algorithm to solve the second subproblem is imbedded into the algorithm for the first subproblem. Numerical experiments using practical data were performed to test the performance of the developed algorithm.

Suggested Citation

  • Kap Hwan Kim & Jin Soo Kang & Kwang Ryel Ryu, 2005. "A beam search algorithm for the load sequencing of outbound containers in port container terminals," Springer Books, in: Hans-Otto Günther & Kap Hwan Kim (ed.), Container Terminals and Automated Transport Systems, pages 183-206, Springer.
    • Handle: RePEc:spr:sprchp:978-3-540-26686-0_8
    DOI: 10.1007/3-540-26686-0_8
    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:sprchp:978-3-540-26686-0_8. 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.