IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v49y2017i9p849-862.html
   My bibliography  Save this article

Capacity planning for mega container terminals with multi-objective and multi-fidelity simulation optimization

Author

Listed:
  • Haobin Li
  • Chenhao Zhou
  • Byung Kwon Lee
  • Loo Hay Lee
  • Ek Peng Chew
  • Rick Siow Mong Goh

Abstract

Container terminals play a significant role as representative logistics facilities for contemporary trades by handling outbound, inbound, and transshipment containers to and from the sea (shipping liners) and the hinterland (consignees). Capacity planning is a fundamental decision process when constructing, expanding, or renovating a container terminal to meet demand, and the outcome of this planning is typically represented in terms of configurations of resources (e.g., the numbers of quay cranes, yard cranes, and vehicles), which enables the container flows to satisfy a high service level for vessels (e.g., berth-on-arrivals). This study presents a decision-making process that optimizes the capacity planning of large-scale container terminals. Advanced simulation-based optimization algorithms, such as Multi-Objective Multi-Fidelity Optimization with Ordinal Transformation and Optimal Sampling (MO-MO2TOS), Multi-Objective Optimal Computing Budget Allocation (MOCBA), and Multi-Objective Convergent Optimization via Most-Promising-Area Stochastic Search (MO-COMPASS), were employed to formulate and optimally solve the large-scale multi-objective problem with multi-fidelity simulation models. Various simulation results are compared with one another in terms of the capacities over different resource configurations to understand the effect of various parameter settings on optimal capacity across the algorithms.

Suggested Citation

  • Haobin Li & Chenhao Zhou & Byung Kwon Lee & Loo Hay Lee & Ek Peng Chew & Rick Siow Mong Goh, 2017. "Capacity planning for mega container terminals with multi-objective and multi-fidelity simulation optimization," IISE Transactions, Taylor & Francis Journals, vol. 49(9), pages 849-862, September.
  • Handle: RePEc:taf:uiiexx:v:49:y:2017:i:9:p:849-862
    DOI: 10.1080/24725854.2017.1318229
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/24725854.2017.1318229
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/24725854.2017.1318229?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Xiang, Xi & Liu, Changchun, 2021. "An almost robust optimization model for integrated berth allocation and quay crane assignment problem," Omega, Elsevier, vol. 104(C).
    2. Li, Xiangda & Peng, Yun & Tian, Qi & Feng, Tao & Wang, Wenyuan & Cao, Zhen & Song, Xiangqun, 2023. "A decomposition-based optimization method for integrated vehicle charging and operation scheduling in automated container terminals under fast charging technology," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 180(C).
    3. Amir Gharehgozli & Nima Zaerpour & Rene Koster, 2020. "Container terminal layout design: transition and future," Maritime Economics & Logistics, Palgrave Macmillan;International Association of Maritime Economists (IAME), vol. 22(4), pages 610-639, December.

    More about this item

    Statistics

    Access and download statistics

    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:taf:uiiexx:v:49:y:2017:i:9:p:849-862. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/uiie .

    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.