References
- Bierwirth, C. , and F. Meisel . 2015. “A Survey of Berth Allocation and Quay Crane Scheduling Problems in Container Terminals.” European Journal of Operational Research 244 (202): 615–627.
- Buhrkal, K. , S. Zuglian , S. Ropke , J. Larsen , and R. Lusby . 2011. “Models for the Discrete Berth Allocation Problem: A Computational Comparison.” Transportation Research Part E: Logistics & Transportation Review 47 (4): 461–473.10.1016/j.tre.2010.11.016
- Chen, J. H. , D. H. Lee , and J. X. Cao . 2012. “A Combinatorial Benders’ Cuts Algorithm for the Quayside Operation Problem at Container Terminals.” Transportation Research Part E Logistics & Transportation Review 48 (1): 266–275.10.1016/j.tre.2011.06.004
- Christensen, C. G. , and C. T. Holst . 2008. “Berth Allocation in Container Terminals.” Master’s thesis, Technical University of Denmark.
- Du, Y. , Q. Chen , J. S. L. Lam , Y. Xu , and J. X. Cao . 2015. “Modeling the Impacts of Tides and the Virtual Arrival Policy in Berth Allocation.” Transportation Science 49 (4): 939–956.10.1287/trsc.2014.0568
- Gen, M. , and R. Cheng . 1996. Genetic Algorithms and Engineering Design. New York: John Wiley.10.1002/9780470172254
- 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.10.1016/j.trb.2009.07.003
- Guo, S. , and C. Yang . 2015. “Enhancing Differential Evolution Utilizing Eigenvector-based Crossover Operator.” IEEE Transactions on Evolutionary Computation 19 (1): 31–49.
- Imai, A. , H. Chen , E. Nishimura , and S. Papadimitriou . 2008. “The Simultaneous Berth and Quay Crane Allocation Problem.” Transportation Research Part E: Logistics & Transportation Review 44 (5): 900–920.10.1016/j.tre.2007.03.003
- Iris, C. , D. Pacino , S. Ropke , and A. Larsen . 2015. “Integrated Berth Allocation and Quay Crane Assignment Problem: Set partitioning models and computational results.” Transportation Research Part E Logistics & Transportation Review 81: 75–97.10.1016/j.tre.2015.06.008
- Kelareva, E. , S. Brand , and P. Kilby . 2013. “CP and MIP Methods for Ship Scheduling with Time-varying Draft.” In Integration of AI and OR techniques in constraint programming for combinatorial optimization problems. Vol. 7874, edited by C. Gomes and M. Sellmann , 111–127. Lecture notes in computer science, Berlin: Springer.10.1007/978-3-642-38171-3
- Lalla-Ruiz, E. , C. Expósito-Izquierdo , B. Melián-Batista , and J. M. Moreno-Vega . 2016. “A Set-Partitioning-based Model for the Berth Allocation Problem Under Time-dependent Limitations.” European Journal of Operational Research 250 (3): 1001–1012.10.1016/j.ejor.2015.10.021
- 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 (6): 60–76.10.1016/j.asoc.2014.04.035
- Liu, J. , Y. W. Wan , and L. Wang . 2006. “Quay Crane Scheduling at Container Terminals to Minimize the Maximum Relative Tardiness of Vessel Departures.” Naval Research Logistics 53 (1): 60–74.10.1002/(ISSN)1520-6750
- Meisel, F. , and C. Bierwirth . 2006. “Integration of Berth Allocation and Crane Assignment to Improve the Resource Utilization at a Seaport Container Terminal.” In Operations Research Proceedings 2005, 105–110. Berlin: Springer. https://link.springer.com/content/pdf/10.1007/3-540-32539-5_17.pdf.
- Meisel, F. , and C. Bierwirth . 2009. “Heuristics for the Integration of Crane Productivity in the Berth Allocation Problem.” Transportation Research Part E Logistics & Transportation Review 45 (1): 196–209.10.1016/j.tre.2008.03.001
- Mozdgir, A. , I. Mahdavi , I. S. Badeleh , and M. Solimanpur . 2013. “Using the Taguchi Method to Optimize the Differential Evolution Algorithm Parameters for Minimizing the Workload Smoothness Index in Simple Assembly Line Balancing.” Mathematical & Computer Modelling 57 (1–2): 137–151.10.1016/j.mcm.2011.06.056
- Park, Y. M. , and K. H. Kim . 2003. “A Scheduling Method for Berth and Quay Cranes.” OR Spectrum 25 (1): 1–23.10.1007/s00291-002-0109-z
- Pinedo, M. 2002. Scheduling: Theory, Algorithms, and Systems. Englewood Cliffs: Prentice Hall.
- Pirayesh, M. , and S. Poormoaied . 2015. “GPSO-LS Algorithm for a Multi-item EPQ Model with Production Capacity Restriction.” Applied Mathematical Modelling 39 (17): 5011–5032.10.1016/j.apm.2015.03.047
- Ponsich, A. , and C. A. C. Coello . 2013. “A Hybrid Differential Evolution – Tabu Search Algorithm for the Solution of Job-shop Scheduling Problems.” Applied Soft Computing 13 (1): 462–474.10.1016/j.asoc.2012.07.034
- Qin, T. , Y. Du , and M. Sha . 2016. “Evaluating the Solution Performance of IP and CP for Berth Allocation with Time-varying Water Depth.” Transportation Research Part E Logistics & Transportation Review 87: 167–185.10.1016/j.tre.2016.01.007
- 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 (11): 14136–14147.
- Şahin, C. , and Y. Kuvvetli . 2016. “Differential Evolution Based Meta-heuristic Algorithm for Dynamic Continuous Berth Allocation Problem.” Applied Mathematical Modelling 40 (23–24): 10679–10688.10.1016/j.apm.2016.08.017
- Sakr, W. S. , R. A. EL-Sehiemy , and A. M. Azmy . 2017. “Adaptive Differential Evolution Algorithm for Efficient Reactive Power Management.” Applied Soft Computing 53: 336–351.10.1016/j.asoc.2017.01.004
- Sheikholeslami, A. , G. Ilati , and M. Kobari . 2014. “The Continuous Dynamic Berth Allocation Problem at A Marine Container Terminal with Tidal Constraints in the Access Channel.” International Journal of Civil Engineering 12 (3): 344–353.
- Stahlbock, R. , and S. Voβ . 2008. “Operations Research at Container Terminals: A Literature Update.” OR Spectrum 30 (1): 1–52.
- Türkoğulları, Y. B. , Z. C. Taşkın , N. Aras , and I. Kuban Altinelb . 2014. “Optimal Berth Allocation and Time-invariant Quay Crane Assignment in Container Terminals.” European Journal of Operational Research 235 (1): 88–101.10.1016/j.ejor.2013.10.015
- Umang, N. , M. Bierlaire , and I. Vacca . 2013. “Exact and Heuristic Methods to Solve the Berth Allocation Problem in Bulk Ports.” Transportation Research Part E Logistics & Transportation Review 54 (7): 14–31.10.1016/j.tre.2013.03.003
- UNCTAD . 2015. http://unctad.org/en/pages/PublicationWebflyer.aspx?publicationid=1374.
- 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.10.1287/trsc.1120.0428
- Wang, Y. , Z. Z. Liu , J. Li , and G. G. Yen . 2016. “Utilizing Cumulative Population Distribution Information in Differential Evolution.” Applied Soft Computing 48: 329–346.10.1016/j.asoc.2016.07.012
- Wisittipanich, W. , and V. Kachitvichyanukul . 2012. “Two Enhanced Differential Evolution Algorithms for Job Shop Scheduling Problems.” International Journal of Production Research 50 (10): 2757–2773.10.1080/00207543.2011.588972
- Xu, D. , C. L. Li , and J. Y. T. Leung . 2012. “Berth Allocation with Time-dependent Physical Limitations on Vessels.” European Journal of Operational Research 216 (1): 47–56.10.1016/j.ejor.2011.07.012
- Zhou, S. , M. Liu , H. Chen , and X. Li . 2016. “An Effective Discrete Differential Evolution Algorithm for Scheduling Uniform Parallel Batch Processing Machines with Non-identical Capacities and Arbitrary Job Sizes.” International Journal of Production Economics 179: 1–11.10.1016/j.ijpe.2016.05.014