A genetic algorithm based on spatiotemporal conflict between continuous berth-allocation and time-varying specific crane assignment

References

• Bierwirth, C., and F. Meisel. 2015. “A Follow-up Survey of Berth Allocation and Quay Crane Scheduling Problems in Container Terminals.” European Journal of Operational Research 244: 675–689. doi: 10.1016/j.ejor.2014.12.030
   Web of Science ®Google Scholar
• Blazewicz, J., T. C. E. Cheng, M. Machowiak, and C. Oguz. 2011. “Berth and Quay Crane Allocation: A Moldable Task Scheduling Model.” Journal of the Operational Research Society 62 (7): 1189–1197. doi: 10.1057/jors.2010.54
   Web of Science ®Google Scholar
• Chang, D., W. Yan, C.-H. Chen, and Z. Jiang. 2008. “A Berth Allocation Strategy Using Heuristics Algorithm and Simulation Optimization.” International Journal of Computer Applications in Technology 32 (4): 272–281. doi: 10.1504/IJCAT.2008.021382
   Google Scholar
• Elwany, M. H., I. Ali, and Y. Abouelseoud. 2013. “A Heuristics-Based Solution to the Continuous Berth Allocation and Crane Assignment Problem.” Alexandria Engineering Journal 52: 671–677. doi: 10.1016/j.aej.2013.09.001
   Google Scholar
• Emde, S., N. Boysen, and D. Briskorn. 2014. “The Berth Allocation Problem with Mobile Quay Walls: Problem Definition, Solution Procedures, and Extensions.” Journal of Scheduling 17 (3): 289–303. doi: 10.1007/s10951-013-0358-5
   Web of Science ®Google Scholar
• Giallombardo, G., L. Moccia, M. Salani, and I. Vacca. 2010. “Modeling and Solving the Tactical Berth Allocation Problem.” Transportation Research Part B: Methodological 44 (2): 232–245. doi: 10.1016/j.trb.2009.07.003
   Web of Science ®Google Scholar
• Guan, Y., W.-Q. Xiao, R. K. Cheung, and C.-L. Li. 2002. “A Multiprocessor Task Scheduling Model for Berth Allocation: Heuristic and Worst-Case Analysis.” Operations Research Letters 30 (5): 343–350. doi: 10.1016/S0167-6377(02)00147-5
   Web of Science ®Google Scholar
• Han, X., X. Gong, and J. Jo. 2015. “A New Continuous Berth Allocation and Quay Crane Assignment Model in Container Terminal.” Computers & Industrial Engineering 89: 15–22. doi: 10.1016/j.cie.2015.04.033
   Web of Science ®Google Scholar
• Han, X.-l., Z.-q. Lu, and L.-f. Xi. 2010. “A Proactive Approach for Simultaneous Berth and Quay Crane Scheduling Problem with Stochastic Arrival and Handling Time.” European Journal of Operational Research 207: 1327–1340. doi: 10.1016/j.ejor.2010.07.018
   Web of Science ®Google Scholar
• Hansen, P., and C. Oguz. 2003. “A Note on Formulations of Static and Dynamic Berth Allocation Problems.” Les Cahiers du GERAD 30: 1–17.
   Google Scholar
• Hansen, P., C. Oğuz, and N. Mladenović. 2008. “Variable Neighborhood Search for Minimum Cost Berth Allocation.” European Journal of Operational Research 191: 636–649. doi: 10.1016/j.ejor.2006.12.057
   Web of Science ®Google Scholar
• Hsu, H.-P. 2016. “A HPSO for Solving Dynamic and Discrete Berth Allocation Problem and Dynamic Quay Crane Assignment Problem Simultaneously.” Swarm and Evolutionary Computation 27: 156–168. doi: 10.1016/j.swevo.2015.11.002
   Web of Science ®Google Scholar
• Hu, Q.-M., Z.-H. Hu, and Y. Du. 2014. “Berth and Quay-Crane Allocation Problem Considering Fuel Consumption and Emissions from Vessels.” Computers & Industrial Engineering 70: 1–10. doi: 10.1016/j.cie.2014.01.003
   Web of Science ®Google Scholar
• Imai, A., H. C. Chen, E. Nishimura, and S. Papadimitriou. 2008. “The Simultaneous Berth and Quay Crane Allocation Problem.” Transportation Research Part E: Logistics and Transportation Review 44: 900–920. doi: 10.1016/j.tre.2007.03.003
   Web of Science ®Google Scholar
• Imai, A., K. Nagaiwa, and C. W. Tat. 1997. “Efficient Planning of Berth Allocation for Container Terminals in Asia.” Journal of Advanced Transportation 31: 75–94. doi: 10.1002/atr.5670310107
   Web of Science ®Google Scholar
• Imai, A., E. Nishimura, and S. Papadimitriou. 2003. “Berth Allocation with Service Priority.” Transportation Research Part B: Methodological 37: 437–457. doi: 10.1016/S0191-2615(02)00023-1
   Web of Science ®Google Scholar
• Imai, A., E. Nishimura, and S. Papadimitriou. 2008. “Berthing Ships at a Multi-user Container Terminal with a Limited Quay Capacity.” Transportation Research Part E: Logistics and Transportation Review 44: 136–151. doi: 10.1016/j.tre.2006.05.002
   Web of Science ®Google Scholar
• Imai, A., X. Sun, E. Nishimura, and S. Papadimitriou. 2005. “Berth Allocation in a Container Port: Using a Continuous Location Space Approach.” Transportation Research Part B: Methodological 39: 199–221. doi: 10.1016/j.trb.2004.04.004
   Web of Science ®Google Scholar
• Lalla-Ruiz, E., J. L. González-Velarde, B. Melián-Batista, and J. M. Moreno-Vega. 2014. “Biased Random Key Genetic Algorithm for the Tactical Berth Allocation Problem.” Applied Soft Computing 22: 60–76. doi: 10.1016/j.asoc.2014.04.035
   Web of Science ®Google Scholar
• Lee, D.-H., and H. Q. Wang. 2010. “Integrated Discrete Berth Allocation and Quay Crane Scheduling in Port Container Terminals.” Engineering Optimization 42: 747–761. doi: 10.1080/03052150903406571
   Web of Science ®Google Scholar
• Li, F., J.-B. Sheu, and Z.-Y. Gao. 2016. “Solving the Continuous Berth Allocation and Specific Quay Crane Assignment Problems with Quay Crane Coverage Range.” Transportation Science 4: 968–989.
   Google Scholar
• Liang, C., Y. Huang, and Y. Yang. 2009. “A Quay Crane Dynamic Scheduling Problem by Hybrid Evolutionary Algorithm for Berth Allocation Planning.” Computers & Industrial Engineering 56: 1021–1028. doi: 10.1016/j.cie.2008.09.024
   Web of Science ®Google Scholar
• Meisel, F., and C. Bierwirth. 2009. “Heuristics for the Integration of Crane Productivity in the Berth Allocation Problem.” Transportation Research Part E: Logistics and Transportation Review 45: 196–209. doi: 10.1016/j.tre.2008.03.001
   Web of Science ®Google Scholar
• Park, Y.-M., and K. H. Kim. 2003. “A Scheduling Method for Berth and Quay Cranes.” OR Spectrum 25: 1–23. doi: 10.1007/s00291-002-0109-z
   Web of Science ®Google Scholar
• Raa, B., W. Dullaert, and R. V. Schaeren. 2011. “An Enriched Model for the Integrated Berth Allocation and Quay Crane Assignment Problem.” Expert Systems with Applications 38: 14136–14147.
   Web of Science ®Google Scholar
• Rashidi, H., and E. P. K. Tsang. 2013. “Novel Constraints Satisfaction Models for Optimization Problems in Container Terminals.” Applied Mathematical Modelling 37: 3601–3634. doi: 10.1016/j.apm.2012.07.042
   Web of Science ®Google Scholar
• Song, L., T. Cherrett, and W. Guan. 2012. “Study on Berth Planning Problem in a Container Seaport: Using an Integrated Programming Approach.” Computers & Industrial Engineering 62: 119–128. doi: 10.1016/j.cie.2011.08.024
   Web of Science ®Google Scholar
• Türkoğulları, Y. B., Z. C. Taşkın, N. Aras, and İ. K. Altınel. 2014. “Optimal Berth Allocation and Time-Invariant Quay Crane Assignment in Container Terminals.” European Journal of Operational Research 235: 88–101. doi: 10.1016/j.ejor.2013.10.015
   Web of Science ®Google Scholar
• Vacca, I., M. Salani, and M. Bierlaire. 2013. “An Exact Algorithm for the Integrated Planning of Berth Allocation and Quay Crane Assignment.” Transportation Science 47 (2): 148–161. doi: 10.1287/trsc.1120.0428
   Web of Science ®Google Scholar
• Yang, C., X. Wang, and Z. Li. 2012. “An Optimization Approach for Coupling Problem of Berth Allocation and Quay Crane Assignment in Container Terminal.” Computers & Industrial Engineering 63: 243–253. doi: 10.1016/j.cie.2012.03.004
   Web of Science ®Google Scholar