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

Dispatching vehicles in a mega container terminal

In: Container Terminals and Cargo Systems

Author

Listed:
  • Ebru K. Bish

    (Virginia Polytechnic Institute and State University)

  • Frank Y. Chen

    (The Chinese University of Hong Kong)

  • Yin Thin Leong

    (Port of Singapore Authority (PSA))

  • Barry L. Nelson

    (Northwestern University)

  • Jonathan Wing Cheong Ng

    (University of Hong Kong)

  • David Simchi-Levi

    (Massachusetts Institute of Technology)

Abstract

We consider a container terminal discharging and uploading containers to and from ships. The discharged containers are stored at prespecified storage locations in the terminal yard. Containers are moved between the ship area and the yard using a fleet of vehicles, each of which can carry one container at a time. The problem is to dispatch vehicles to the containers so as to minimize the total time it takes to serve a ship, which is the total time it takes to discharge all containers from the ship and upload new containers onto the ship. We develop easily implementable heuristic algorithms and identify both the absolute and asymptotic worst-case performance ratios of these heuristics. In simple settings, most of these algorithms are optimal, while in more general settings, we show, through numerical experiments, that these algorithms obtain near-optimal results for the dispatching problem.

Suggested Citation

  • Ebru K. Bish & Frank Y. Chen & Yin Thin Leong & Barry L. Nelson & Jonathan Wing Cheong Ng & David Simchi-Levi, 2007. "Dispatching vehicles in a mega container terminal," Springer Books, in: Kap Hwan Kim & Hans-Otto Günther (ed.), Container Terminals and Cargo Systems, pages 179-194, Springer.
    • Handle: RePEc:spr:sprchp:978-3-540-49550-5_9
    DOI: 10.1007/978-3-540-49550-5_9
    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.

    Citations

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


    Cited by:

    1. Hsien-Pin Hsu & Chia-Nan Wang & Hsin-Pin Fu & Thanh-Tuan Dang, 2021. "Joint Scheduling of Yard Crane, Yard Truck, and Quay Crane for Container Terminal Considering Vessel Stowage Plan: An Integrated Simulation-Based Optimization Approach," Mathematics, MDPI, vol. 9(18), pages 1-28, September.

    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-49550-5_9. 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.