Abstract
The berths allocation problem (BAP), aims to allocate the space along the waterfront, for incoming ships in a container terminal, to minimize an objective function. In this paper, we propose a multi- objective model for decision support, for the assignment problem the incoming ships on the quays in a containers terminal. The model we propose,seeks an assignment that simultaneously minimizes the time spent by vessels in the port and the distances traveled by containers imports/exports. We propose a mathematical model to achieve our goals by respecting imposed constraints. This model is solved by using, a hybrid of genetic algorithm and simulated annealing. Calculation results are presented in this article.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Zeinebou, Z., Benabdelhafid, A.: Development of a model of decision support for optimization of physical flows in a container terminal. In: International Conference on Advanced Logistics and Transport (ICALT), pp. 421–426 (2013)
Imai, A., Nishimura, E., Papadimitriou, S.: Berth allocation with service priority. Transportation Research Part B 37, 437–457 (2003)
Imai, A., Nishimura, E., Papadimitriou, S.: The dynamic berth allocation for a container terminal. Transportation Research Part B 35, 401–417 (2001)
Monaco, F.M., Sammarra, M.: The Berth Allocation Problem: A Strong Formulation Solved by a Lagrangean Approach. Transportation Science 41(2), 265–280 (2007)
Kim, K.H., Moon, K.C.: Berth scheduling by simulated annealing. Transportation Research Part B 37, 541–560 (2003)
Guan, Y., Cheung, K.R.: The Berth Allocation Problem: Models and Solution Methods. Operations Research Spectrum 26, 75–92 (2004)
Moorthy, R., Teo, C.-P.: Berth management in container terminal: The template design problem. OR Spectrum (2006), doi:10.1007/s00291-006-0036-5
Imai, A., Sun, X., Nishimura, E., Papadimitriou, S.: Berth Allocation in a Container Port: Using Continuous Location Space Approach. Transportation Research Part B 39, 199–221 (2005)
Golias, M.M., Boile, M., Theofanis, S.: Berth scheduling by customer service differentiation: A multi-objective approach. Transportation Research Part E 45, 878–892 (2009)
Hansen, P., Oguz, C., Mladenovic, N.: Variable neighborhood search for minimum cost berth allocation. European Journal of Operational Research 131(3), 636–649 (2008)
Lee, D.-H., Chen, J.H., Cao, J.X.: The continuous Berth Allocation Problem: A Greedy Randomized Adaptive Search Solution. Transportation Research Part E46, 1017–1029 (2010)
Hansen, P., Oguz, C.: A Note on Formulations of Static and Dynamic Berth Allocation Problems (2003) ISSN: 0711-2440 Les Cahiers du GERAD
Imai, A., Nishimura, E., Papadimitriou, S.: The dynamic berth allocation problem for a container port. Transportation Research Part B 35, 401–417 (2001)
Xu, D., Li, C.-L., Leung, J.Y.-T.: Berth allocation with time-dependent physical limitations on vessels. European Journal of Operational Research 216, 47–56 (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Zoubeir, Z., Benabdelhafid, A. (2014). The Development of a Decision Support Model for the Problem of Berths Allocation in Containers Terminal Using a Hybrid of Genetic Algorithm and Simulated Annealing. In: Nguyen, N.T., Attachoo, B., Trawiński, B., Somboonviwat, K. (eds) Intelligent Information and Database Systems. ACIIDS 2014. Lecture Notes in Computer Science(), vol 8397. Springer, Cham. https://doi.org/10.1007/978-3-319-05476-6_46
Download citation
DOI: https://doi.org/10.1007/978-3-319-05476-6_46
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-05475-9
Online ISBN: 978-3-319-05476-6
eBook Packages: Computer ScienceComputer Science (R0)