[1] Ahn, EY and et al(2006), ““The Operation of the Yard in a Terminal””, Journal of Intelligence and Information Systems, Vol. 12, No. 3, pp. 47-65.
[2] Alcalde, EM and et al(2015), ““Optimal Space for Storage Yard Considering Yard Inventory Forecasts and Terminal Performance””, Transportation Research Part E: Logistics and Transportation Review, Vol. 82, pp. 101-128.
[3] Bae, JW and et al(2006), ““Assignment and Operation Sequencing for Remashalling of a Vertical Yard Block in Automated Container Terminals””, Journal of Korean Navigation and Port Research, Vol. 30, No. 6, pp. 457-464.
[4] Busan Port Authority(2020), “2019 Container Statistics of BUSAN Port”, pp. 13-14.
[5] Chang, DF and et al(2010), ““A Hybrid Parallel Genetic Algorithm for Yard Crane Scheduling””, Transportation Research Part E, Vol. 46, pp. 136-155.
[6] Choi, YS and Ha, TY(2005), ““A Design Method of Yard Layout in Port Container Terminal””, Journal of Korean Navigation and Port Research, Vol. 29, No. 8, pp. 741-746.
[7] Drewry Maritime Research(2014), “Container Terminal Capacity and Performance Benchmarks”, pp. 10-13.
[8] He, JL and et al(2019), ““Yard Crane Scheduling Problem in a Container Terminal Considering Risk Caused by Uncertainty””, Advanced Engineering Informatics, Vol. 39, pp. 14-24.
[9] He, JL and et al(2020), ““Two-stage Stochastic Programming Model for Generating Container Yard Template under Uncertainty and Traffic Congestion””, Advanced Engineering Informatics, Vol. 43, pp. 101032.
[10] Hu, X and et al(2021), ““Container Storage Space Assignment Problem in Two Terminals with the Consideration of Yard Sharing””, Advanced Engineering Informatics, Vol. 47, pp. 101224.
[11] Jang, WH and Lee, JY(2018), ““A Study on Utilization of Yard Co-petition Area between Adjacent Container Terminals””, Journal of Korean Navigation and Port Research, Vol. 42, No. 6, pp. 501-506.
[12] Jiang, XJ and Jin, JG(2017), ““A Branch-and-Price Method for Integrated Yard Crane Deployment and Container Allocation in Transshipment Yard””, Transportation Research Part B, Vol. 98, pp. 62-75.
[13] Kim, YG and et al(2006), ““A Probabilistic Model of Damage Propagation based on the Markov Process””, Journal of KIISE: Computer System and Theory, Vol. 33, No. 8, pp. 524-535.
[14] No, CS and Kim, DH(2012), ““A Crime Occurrence Risk Probability Map Generation Model based on the Markov Chain””, The Journal of Korean Institute of Information Technology, Vol. 10, No. 10, pp. 89-98.
[15] Notteboom, TE and et al(2019), ““The Relationship between Transhipment Incidence and Throughput Volatility in North European and Mediterranean Container Ports””, Journal of Transport Geography, Vol. 74, pp. 371-381.
[16] Pruyn, JFJ and et al(2020), ““Analysis of Port Waiting Time due to Congestion by Applying Markov Chain Analysis””, Maritime Supply Chains, Chapter 4, pp. 69-94.
[17] Sauri, S and Martin, E(2011), ““Space Allocating Strategies for Improving Import Yard Performance at Marine Terminals””, Transportation Research Part E, Vol. 47, pp. 1038-1057.
[18] Sharif, O and Huynh, N(2013), ““Storage Space Allocation at Marine Container Terminals using Ant-Based Control””, Expert Systems with Applications, Vol. 40, pp. 2323-2330.
[19] Sohn, MJ and et al(2010), ““Optimization of Staking Strategies Considering Yard Occupancy Rate in and Automated Container Terminal””, Journal of KIISE: Computing Practices and Letters, Vol. 16, No. 11, pp. 1106-1110.
[20] Son, JH(2015), ““A Probabilistic Model of School Violence based on the Markov Chain Process””, Studies on Korean Youth, Vol. 26, No. 2, pp. 35-57.
[21] Song, YS and et al(2006), ““An Efficient Method for Allocating Storage Yard for Container Terminal””, Journal of Korean Navigation and Port Research, Vol. 30, No. 3, pp. 203-209.
[22] Tan, C, He, C and Wang, Y(2017), ““Storage Yard Management based on Flexible Yard Template in Container Terminal””, Advanced Engineering Informatics, Vol. 34, pp. 101-113.
[23] Zhen, L(2016), ““Modeling of Yard Congestion and Optimization of Yard Template in Container Ports””, Transportation Research Part B, Vol. 90, pp. 83-104.