Abstract
The present paper introduces a new multi-objective variant of the Berth Allocation Problem in the context of maritime container terminals. Specifically, this optimization problem seeks to minimize the waiting times of the incoming container vessels to serve, the costs derived from the movement of containers around the terminal, and the time the containers are at the terminal. This optimization problem is solved by means of an Adaptive Large Neighborhood Search, which uses a dynamic parameter to destroy part of the solutions while a building method is designed to later rebuild them. The computational performance of this technique is assessed over a wide range of realistic scenarios. The results indicate its high efficiency and effectiveness, reporting high-quality solutions in all the cases within short computational times.
This work has been partially funded by the Spanish Ministry of Economy and Competitiveness with FEDER funds (project TIN2015-70226-R).
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
Notes
References
Böse, J.W.: General considerations on container terminal planning. In: Böse, J.W., Sharda, R., Voß, S. (eds.) Handbook of Terminal Planning. Operations Research/Computer Science Interfaces Series, vol. 49, pp. 3–22. Springer, New York (2011). https://doi.org/10.1007/978-1-4419-8408-1_1
Brucker, P., Knust, S.: Complex job-shop scheduling. In: Brucker, P., Knust, S. (eds.) Complex Scheduling. GOR-Publications, pp. 239–317. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-23929-8
Carlo, H.J., Vis, I.F.A., Roodbergen, K.J.: Transport operations in container terminals: literature overview, trends, research directions and classification scheme. Eur. J. Oper. Res. 236(1), 1–13 (2014)
Carlo, H.J., Vis, I.F.A., Roodbergen, K.J.: Storage yard operations in container terminals: literature overview, trends, and research directions. Eur. J. Oper. Res. 235(2), 412–430 (2014). Maritime Logistics
Günther, H.O., Kim, K.H.: Container terminals and terminal operations. OR Spectr. 28(4), 437–445 (2006)
Kovacs, A.A., Parragh, S.N., Doerner, K.F., Hartl, R.F.: Adaptive large neighborhood search for service technician routing and scheduling problems. J. Sched. 15(5), 579–600 (2012)
Li, J., Pan, Y., Shen, H.: More efficient topological sort using reconfigurable optical buses. J. Supercomput. 24(3), 251–258 (2003)
Liu, S.Q., Kozan, E.: New graph-based algorithms to efficiently solve large scale open pit mining optimisation problems. Expert Syst. Appl. 43, 59–65 (2015)
Meisel, F.: Seaside Operations Planning in Container Terminals. Contributions to Management Science. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-7908-2191-8
Muller, L.F.: An adaptive large neighborhood search algorithm for the resource-constrained project scheduling problem. In: MIC 2009: The VIII Metaheuristics International Conference (2009)
Ribeiro, G.M., Laporte, G.: An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem. Comput. Oper. Res. 39(3), 728–735 (2012)
Ropke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp. Sci. 40(4), 455–472 (2006)
Umang, N., Bierlaire, M., Vacca, I.: Exact and heuristic methods to solve the berth allocation problem in bulk ports. Transp. Res. Part E: Logist. Transp. Rev. 54, 14–31 (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this paper
Cite this paper
Robayna-Hernández, K., Expósito-Izquierdo, C., Melián-Batista, B., Moreno-Vega, J.M. (2018). A Meta-heuristic Approach for the Transshipment of Containers in Maritime Container Terminals. In: Moreno-Díaz, R., Pichler, F., Quesada-Arencibia, A. (eds) Computer Aided Systems Theory – EUROCAST 2017. EUROCAST 2017. Lecture Notes in Computer Science(), vol 10671. Springer, Cham. https://doi.org/10.1007/978-3-319-74718-7_39
Download citation
DOI: https://doi.org/10.1007/978-3-319-74718-7_39
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-74717-0
Online ISBN: 978-3-319-74718-7
eBook Packages: Computer ScienceComputer Science (R0)