Abstract
Container terminals are facilities where cargo containers are transshipped between different transport vehicles, for onward transportation. They are open systems that carry out a large number of different combinatorial problems that can be solved by means of Artificial Intelligence techniques. In this work, we focus our attention on scheduling a number of incoming vessels by assigning to each a berthing position, a mooring time and a number of Quay Cranes. This problem is known as the Berthing Allocation and Quay Crane Assignment problem. To formulate the problem, we first propose a mixed integer linear programming model to minimize the total weighted service time of the incoming vessels. Then, a meta-heuristic algorithm (Genetic Algorithm (GA)) is presented for solving the proposed problem. Computational experiments are performed to evaluate the effectiveness and efficiency of the proposed method.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bierwirth, C., Meisel, F.: A Survey of Berth Allocation and Quay Crane Scheduling Problems in Container Terminals. European Journal of Operational Research 202, 615–627 (2010)
Giallombardo, G., Moccia, L., Salani, M., Vacca, I.: Modeling and Solving the Tactical Berth Allocation Problem. Transportation Research Part B: Methodological 44(2), 232–245 (2010)
Goldberg, D.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley (1985)
Gonzalez-Rodriguez, I., Vela, C., Puente, J.: A Memetic Approach to Fuzzy Job Shop Based on Expectation Model. In: 16th IEEE International Conference on Fuzzy Systems (FUZZ-IEEE 2007), pp. 692–697. IEEE (2007)
González-Rodríguez, I., Vela, C., Puente, J.: A Genetic Solution Based on Lexicographical Goal Programming for a Multiobjective Job Shop with Uncertainty. Journal of Intelligent Manufacturing 21(1), 65–73 (2010)
Holand, J.: Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence. University of Michigan Press (1975)
Imai, A., Chen, H., Nishimura, E., Papadimitriou, S.: The Simultaneous Berth and Quay Crane Allocation Problem. Transportation Research Part E: Logistics and Transportation Review 44(5), 900–920 (2008)
Kim, K., Moon, K.: Berth Scheduling by Simulated Annealing. Transportation Research Part B: Methodological 37(6), 541–560 (2003)
Liang, C., Guo, J., Yang, Y.: Multi-Objective Hybrid Genetic Algorithm for Quay Crane Dynamic Assignment in Berth Allocation Planning. Journal of Intelligent Manufacturing 22, 471–479 (2011)
Lim, A.: The Berth Planning Problem. Operations Research Letters 22(2-3), 105–110 (1998)
Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs. 3rd Revised and Extended Edition. Springer (1996)
Park, Y., Kim, K.: A Scheduling Method for Berth and Quay Cranes. OR Spectrum 25(1), 1–23 (2003)
Salido, M.A., Rodriguez-Molins, M., Barber, F.: Integrated Intelligent Techniques for Remarshaling and Berthing in Maritime Terminals. Advanced Engineering Informatics 25(3), 435–451 (2011)
Stahlbock, R., Voß, S.: Operations Research at Container Terminals – A Literature Update. OR Spectrum 30(1), 1–52 (2008)
Zhang, C., Zheng, L., Zhang, Z., Shi, L., Armstrong, A.: The Allocation of Berths and Quay Cranes by Using a Sub-Gradient Optimization Technique. Computers & Industrial Engineering 58(1), 40–50 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rodriguez-Molins, M., Barber, F., Sierra, M.R., Puente, J., Salido, M.A. (2012). A Genetic Algorithm for Berth Allocation and Quay Crane Assignment. In: Pavón, J., Duque-Méndez, N.D., Fuentes-Fernández, R. (eds) Advances in Artificial Intelligence – IBERAMIA 2012. IBERAMIA 2012. Lecture Notes in Computer Science(), vol 7637. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34654-5_61
Download citation
DOI: https://doi.org/10.1007/978-3-642-34654-5_61
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34653-8
Online ISBN: 978-3-642-34654-5
eBook Packages: Computer ScienceComputer Science (R0)