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

The berth allocation problem: models and solution methods

In: Container Terminals and Automated Transport Systems

Author

Listed:
  • Yongpei Guan

    (George Institute of Technology)

  • Raymond K. Cheung

    (The Hong Kong University of Science and Technology)

Abstract

In this paper, we consider the problem of allocating space at berth for vessels with the objective of minimizing total weighted flow time. Two mathematical formulations are considered where one is used to develop a tree search procedure while the other is used to develop a lower bound that can speed up the tree search procedure. Furthermore, a composite heuristic combining the tree search procedure and pair-wise exchange heuristic is proposed for large size problems. Finally, computational experiments are reported to evaluate the efficiency of the methods.

Suggested Citation

  • Yongpei Guan & Raymond K. Cheung, 2005. "The berth allocation problem: models and solution methods," Springer Books, in: Hans-Otto Günther & Kap Hwan Kim (ed.), Container Terminals and Automated Transport Systems, pages 141-158, Springer.
    • Handle: RePEc:spr:sprchp:978-3-540-26686-0_6
    DOI: 10.1007/3-540-26686-0_6
    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_6. 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.