IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-642-37270-4_44.html
   My bibliography  Save this book chapter

An Optimal Layout Design for Storage Yard of Container Terminal

In: The 19th International Conference on Industrial Engineering and Engineering Management

Author

Listed:
  • Jian-xun Tang

    (Northeastern University)

  • Li-xin Tang

    (Northeastern University)

Abstract

This problem is to optimizeThis research is partly supported by State Key Program of National Natural Science Foundation of China (71032004), the Fundamental Research Funds for the Central Universities (N090104002, N100704002) and by the 111 Project under Grant B08015. the layout design of blocks in new container yard. The yard cranes have restrictions on the width of blocks, and the layout of blocks and berths also have important impact on the driving route of yard trucks. Making use of bays, the lengths of blocks are discretized. An integer programming model is proposed for this problem, whose objective is to maximize the efficiency of trucks and the number of bays. In this model, there is also a lower bound on the minimum number of bays. Based on the characteristics of this model, a Filter-and-Fan algorithm is developed to solve this problem. The experimental results show the effectiveness of algorithm.

Suggested Citation

  • Jian-xun Tang & Li-xin Tang, 2013. "An Optimal Layout Design for Storage Yard of Container Terminal," Springer Books, in: Ershi Qi & Jiang Shen & Runliang Dou (ed.), The 19th International Conference on Industrial Engineering and Engineering Management, edition 127, chapter 0, pages 455-466, Springer.
    • Handle: RePEc:spr:sprchp:978-3-642-37270-4_44
    DOI: 10.1007/978-3-642-37270-4_44
    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-642-37270-4_44. 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.