A bi-objective model for robust yard allocation scheduling for outbound containers

References

• Bierwirth, C., and F. Meisel. 2010. “A Survey of Berth Allocation and Quay Crane Scheduling Problems in Container Terminals.” European Journal of Operational Research 202 (3): 615–627. doi: 10.1016/j.ejor.2009.05.031
   Web of Science ®Google Scholar
• Han, Y., L. H. Lee, E. P. Chew, and K. C. Tan. 2008. “A Yard Storage Strategy for Minimizing Traffic Congestion in a Marine Container Transshipment Hub.” OR Spectrum 30 (4): 697–720. doi: 10.1007/s00291-008-0127-6
   Web of Science ®Google Scholar
• Hendriks, M. P. M., E. Lefeber, and T. Udding. 2013. “Simultaneous Berth Allocation and Yard Planning at Tactical Level.” OR Spectrum 35 (2): 441–456. doi: 10.1007/s00291-012-0305-4
   Web of Science ®Google Scholar
• Imai, A., K. Nagaiwa, and W. Chan. 1997. “Efficient Planning of Berthing Allocation for Container Terminals in Asia.” Journal of Advanced Transportation 31 (1): 75–94. doi: 10.1002/atr.5670310107
   Web of Science ®Google Scholar
• Kim, K. H., and H. B. Kim. 2002. “The Optimal Sizing of the Storage Space and Handling Facilities for Import Containers.” Transportation Research Part B 36 (9): 821–835. doi: 10.1016/S0191-2615(01)00033-9
   Google Scholar
• Kim, K., and K. Moon. 2003. “Berth Scheduling by Simulated Annealing.” Transportation Research Part B 37 (6): 541–560. doi: 10.1016/S0191-2615(02)00027-9
   Google Scholar
• Kim, K. H., and K. T. Park. 2003. “A Note on a Dynamic Space-Allocation Method for Outbound Containers.” European Journal of Operational Research 148 (1): 92–101. doi: 10.1016/S0377-2217(02)00333-8
   Web of Science ®Google Scholar
• Kim, K. H., Y. M. Park, and K. R. Ryu. 2000. “Deriving Decision Rules to Locate Export Containers in Storage Yards.” European Journal of Operational Research 124 (1): 89–101. doi: 10.1016/S0377-2217(99)00116-2
   Web of Science ®Google Scholar
• Kozan, E., and P. Preston. 2006. “Mathematical Modeling of Container Transfers and Storage Locations at Seaport Terminals.” OR Spectrum 28 (4): 519–537. doi: 10.1007/s00291-006-0048-1
   Web of Science ®Google Scholar
• Lambrechts, O., E. Demeulemeester, and W. Herroelen. 2008. “Proactive and Reactive Strategies for Resource Constrained Project Scheduling With Uncertain Resource Availabilities.” Journal of Scheduling 11 (2): 121–136. doi: 10.1007/s10951-007-0021-0
   Web of Science ®Google Scholar
• Lim, A., and Z. Xu. 2006. “A Critical-Shaking Neighborhood Search for the Yard Allocation Problem.” European Journal of Operational Research 174 (2): 1247–1259. doi: 10.1016/j.ejor.2005.01.064
   Web of Science ®Google Scholar
• Moorthy, R., and C. P. Teo. 2006. “Berth Management in Container Terminal: The Template Design Problem.” OR Spectrum 28 (4): 495–518. doi: 10.1007/s00291-006-0036-5
   Web of Science ®Google Scholar
• Nishimura, E., A. Imai, G. K. Janssens, and S. Papadimitriou. 2009. “Container Storage and Transshipment Marine Terminals.” Transportation Research Part E 45 (5): 771–786. doi: 10.1016/j.tre.2009.03.003
   Google Scholar
• Nishimura, E., A. Imai, and S. Papadimitriou. 2001. “Berth Allocation Planning in the Public Berth System by Genetic Algorithms.” European Journal of Operational Research 131 (2): 282–292. doi: 10.1016/S0377-2217(00)00128-4
   Web of Science ®Google Scholar
• Park, K., and K. Kim. 2002. “Berth Scheduling for Container Terminals by Using a Sub-Gradient Optimization Technique.” Journal of the Operational Research Society 53 (9): 1054–1062. doi: 10.1057/palgrave.jors.2601412
   Web of Science ®Google Scholar
• Park, Y., and K. Kim. 2003. “A Scheduling Method for Berth and Quay Cranes.” OR Spectrum 25 (1): 1–23. doi: 10.1007/s00291-002-0109-z
   Web of Science ®Google Scholar
• Robenek, T., N. Umang, M. Bierlaire, and S. Ropke. 2014. “A Branch-and-Price Algorithm to Solve the Integrated Berth Allocation and Yard Assignment Problem in Bulk Ports.” European Journal of Operational Research 235 (2): 399–411. doi: 10.1016/j.ejor.2013.08.015
   Web of Science ®Google Scholar
• Taleb-Ibrahimi, M., B. de Castilho, and C. F. Daganzo. 1993. “Storage Space vs Handling Work in Container Terminals.” Transport Research Part B 27 (1): 13–32. doi: 10.1016/0191-2615(93)90009-Y
   Google Scholar
• Stahlbock, Robert, and Stefan Voß. 2008. “Operations Research at Container Terminals: A Literature Update.” OR Spectrum 30 (1): 1–52. http://dx.doi.org/10.1007/s00291-007-0100-9. doi: 10.1007/s00291-007-0100-9
   Web of Science ®Google Scholar
• Steenken, Dirk, Stefan Voß, and Robert Stahlbock. 2004. “Container Terminal Operation and Operations Research—A Classification and Literature Review.” OR Spectrum 26 (1): 3–49. http://dx.doi.org/10.1007/s00291-003-0157-z. doi: 10.1007/s00291-003-0157-z
   Web of Science ®Google Scholar
• Vis, I. F. A., and R. Koster. 2003. “Transshipment of Containers at a Container Terminal: An Overview.” European Journal of Operational Research 147 (1): 1–16. doi: 10.1016/S0377-2217(02)00293-X
   Web of Science ®Google Scholar
• Zhang, C., J. Liu, Y. Wan, K. G. Murty, and R. J. Linn. 2003. “Storage Space Allocation in Container Terminals.” Transportation Research Part B 37 (10): 883–903. doi: 10.1016/S0191-2615(02)00089-9
   Google Scholar
• Zhang, C., T. Wu, L. Zheng, and L. Miao. 2013. “A Lagrangian Relaxation-Based Algorithm for the Allocation of Yard Cranes for Yard Activities with Different Priorities.” Journal of Systems Science and Systems Engineering 22 (2): 227–252. doi: 10.1007/s11518-013-5215-8
   Web of Science ®Google Scholar
• Zhang, C., L. Zheng, Zh. Zhang, L. Shi, Aaron Armstrong. 2010. “The Allocation of Berths and Quay Cranes by Using a Sub-Gradient Optimization Technique.” Computers & Industrial Engineering 58 (1): 40–50. doi: 10.1016/j.cie.2009.08.002
   Web of Science ®Google Scholar
• Zhen, L.. 2014. “Container Yard Template Planning Under Uncertain Maritime Market.” Transportation Research Part E 69 (1): 199–217. doi: 10.1016/j.tre.2014.06.011
   Google Scholar
• Zhen, L.. 2015. “Tactical Berth Allocation Under Uncertainty.” European Journal of Operational Research 247 (3): 928–944. doi: 10.1016/j.ejor.2015.05.079
   Web of Science ®Google Scholar
• Zhen, L., and D. Chang. 2012. “A Bi-Objective Model for Robust Berth Allocation Scheduling.” Computers & Industrial Engineering 63 (1): 262–273. doi: 10.1016/j.cie.2012.03.003
   Web of Science ®Google Scholar
• Zhen, L., E. P. Chew, and L. H. Lee. 2011a. “An Integrated Model for Berth Template and Yard Template Planning in Transshipment Hubs.” Transportation Science 45 (4): 483–504. doi: 10.1287/trsc.1100.0364
   Web of Science ®Google Scholar
• Zhen, L., L. H. Lee, and E. P. Chew. 2011b. “A Decision Model for Berth Allocation Under Uncertainty.” European Journal of Operational Research 212 (1): 54–68. doi: 10.1016/j.ejor.2011.01.021
   Web of Science ®Google Scholar