skip to main content
10.1145/3396743.3396753acmotherconferencesArticle/Chapter ViewAbstractPublication PagesmsieConference Proceedingsconference-collections
research-article

Container Yard Planning Layout Model Considering Demand and Lost Sale Container

Authors Info & Claims
Published:29 May 2020Publication History

ABSTRACT

This paper proposed a mathematical model: Mixed Integer Non-Linear Programming to optimize the utilization of space in the container yard. The model developed was considering in two types of different blocks: exclusive block and sharing block. The exclusive block is a space in the container yard uniquely serving to the certain forwarder, otherwise it is classified as sharing block type. Base on this model, the maximum revenue is gained by reducing the loss of sales opportunity and considering fulfilment number of containers demand in each block in the container yard according to the capacity available. The mathematical model was applied to LINGO 11 software to obtain the optimal solution and its results are 14 sharing blocks and 9 exclusive blocks. The Total maximum profit is $ 29,816 per month. The proposed model was flexible enough to respond to changes in parameters related to future demand.

References

  1. H. J. Carlo, I. F. A. Vis, and K. J. Roodbergen, "Storage yard operations in container terminals: Literature overview, trends, and research directions," Eur. J. Oper. Res., vol. 235, no. 2, pp. 412--430, 2014.Google ScholarGoogle ScholarCross RefCross Ref
  2. D.-H. Lee, J. G. Jin, and J. H. Chen, "Terminal and yard allocation problem for a container transshipment hub with multiple terminals," Transp. Res. Part E Logist. Transp. Rev., vol. 48, no. 2, pp. 516--528, 2012.Google ScholarGoogle ScholarCross RefCross Ref
  3. D.-H. Lee and J. G. Jin, "Feeder vessel management at container transshipment terminals," Transp. Res. Part E Logist. Transp. Rev., vol. 49, no. 1, pp. 201--216, 2013.Google ScholarGoogle ScholarCross RefCross Ref
  4. J. He and C. Tan, "Modelling a resilient yard template under storage demand fluctuations in a container terminal," Eng. Optim., vol. 51, no. 9, pp. 1547--1566, 2019.Google ScholarGoogle ScholarCross RefCross Ref
  5. K. H. Kim and K. T. Park, "A note on a dynamic space-allocation method for outbound containers," Eur. J. Oper. Res., vol. 148, no. 1, pp. 92--101, 2003.Google ScholarGoogle ScholarCross RefCross Ref
  6. K. H. Kim, Y. M. Park, and K.-R. Ryu, "Deriving decision rules to locate export containers in container yards," Eur. J. Oper. Res., vol. 124, no. 1, pp. 89--101, 2000.Google ScholarGoogle ScholarCross RefCross Ref
  7. C. Zhang, T. Wu, K. H. Kim, and L. Miao, "Conservative allocation models for outbound containers in container terminals," Eur. J. Oper. Res., vol. 238, no. 1, pp. 155--165, 2014.Google ScholarGoogle ScholarCross RefCross Ref
  8. J. Wiese, L. Suhl, and N. Kliewer, "Mathematical models and solution methods for optimal container terminal yard layouts," OR Spectr., vol. 32, no. 3, pp. 427--452, 2010.Google ScholarGoogle ScholarCross RefCross Ref
  9. L. Zhen, "Modeling of yard congestion and optimization of yard template in container ports," vol. 90, pp. 83--104, 2016.Google ScholarGoogle Scholar
  10. V. Galle, "Optimization Models and Methods for Storage Yard Operations in Maritime Container Terminals," Massachusetts Institute of Technology, 2018.Google ScholarGoogle Scholar

Index Terms

  1. Container Yard Planning Layout Model Considering Demand and Lost Sale Container

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Other conferences
      MSIE '20: Proceedings of the 2020 2nd International Conference on Management Science and Industrial Engineering
      April 2020
      341 pages
      ISBN:9781450377065
      DOI:10.1145/3396743

      Copyright © 2020 ACM

      © 2020 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of a national government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only.

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 29 May 2020

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article
      • Research
      • Refereed limited
    • Article Metrics

      • Downloads (Last 12 months)7
      • Downloads (Last 6 weeks)0

      Other Metrics

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader