Abstract: With the growing demand of freight transport by means of container vessels as well as the important competition among terminals, managers and stakeholders seek to improve the exploitation of the container terminal resources efficiently. In this context, arises the Berth Allocation Problem, which aims to allocate and schedule incoming vessels along the quay. Its appropriate solution plays a relevant role in enhancing the terminal productivity. Thus, for addressing this problem, we propose a cooperative search, where the individuals are organized into groups and each member shares information with its group partners. This grouping strategy allows to diversify as well as intensify the search in some regions by means of information shared among the individuals of each group. The computational experiments for this problem reveal that our approach reports high-quality solutions and identifies promising regions within the search space in short computational times.
Bierwirth C. & Meisel F. 2010. A survey of berth allocation and quay crane scheduling problems in container terminals. European Journal of Operational Research 202(3), 615–627.
Buhrkal K., Zuglian S., Ropke S., Larsen J. & Lusby R. 2011. Models for the discrete berth allocation problem: a computational comparison. Transportation Research Part E 47(4), 461–473.
Christensen C. & Holst C. 2008. Berth Allocation in Container Terminals. Master’s thesis, Department of Informatics and Mathematical Modelling, Technical University of Denmark (in Danish).
Christiansen M., Fagerholt K., Nygreen B. & Ronen D. 2007. Chapter 4 maritime transportation. In ‘Transportation’, Volume 14 of Handbooks in Operations Research and Management Science, Barnhart, C. & Laporte, G. (eds). Elsevier, 189–284.
Cordeau J.-F., Laporte G., Legato P. & Moccia L. 2005. Models and tabu search heuristics for the berth-allocation problem. Transportation Science 39(4), 526–538.
de Oliveira R. M., Mauri G. R. & Lorena L. A. N. 2012. Clustering search for the berth allocation problem. Expert Systems with Applications 39(5), 5499–5505.
Duman E., Uysal M. & Alkaya A. F. 2012. Migrating birds optimization: a new metaheuristic approach and its performance on quadratic assignment problem. Information Sciences 217, 65–77.
Gutiérrez-Castro J. P., Melian Batista B., Moreno-Perez J. A., Moreno-Vega J. M. & Ramos-Bonilla J. 2008. Codea: an architecture for designing nature-inspired cooperative decentralized heuristics. In ‘Nature Inspired Cooperative Strategies for Optimization (NICSO 2007)’, Vol. 129 of Studies in Computational Intelligence, Krasnogor, N., Nicosia, G., Pavone, M. & Pelta, D. (eds). Springer Berlin Heidelberg, 189–198.
Imai A., Nagaiwa K. & Chan W. T. 1997. Efficient planning of berth allocation for container terminals in Asia. Journal of Advanced Transportation 31(1), 75–94.
Imai A., Nishimura E. & Papadimitriou S. 2001. The dynamic berth allocation problem for a container port. Transportation Research Part B: Methodological 35(4), 401–407.
Lalla-Ruiz E., Melián-Batista B. & Moreno-Vega J. M. 2012. Artificial intelligence hybrid heuristic based on tabu search for the dynamic berth allocation problem. Engineering Applications of Artificial Intelligence 25(6), 1132–1141.
Monaco M. F. & Sammarra M. 2007. The berth allocation problem: a strong formulation solved by a lagrangean approach. Transportation Science 41(2), 265–280.
Ting C.-J., Wu K.-C. & Chou H. 2014. Particle swarm optimization algorithm for the berth allocation problem. Expert Systems with Applications 41(4), 1543–1550.
Umang N., Bierlaire M. & Vacca I. 2013. Exact and heuristic methods to solve the berth allocation problem in bulk ports. Transportation Research Part E: Logistics and Transportation Review 54(0), 14–31.
Abstract: Abstract: With the growing demand of freight transport by means of container vessels as well as the important competition among terminals, managers and stakeholders seek to improve the exploitation of the container terminal resources efficiently. In this context, arises the Berth Allocation Problem, which aims to allocate and schedule incoming vessels along the quay. Its appropriate solution plays a relevant role in enhancing the terminal productivity. Thus, for addressing this problem, we propose a cooperative search, where the individuals are organized into groups and each member shares information with its group partners. This grouping strategy allows to diversify as well as intensify the search in some regions by means of information shared among the individuals of each group. The computational experiments for this problem reveal that our approach reports high-quality solutions and identifies promising regions within the search space in short computational times.
HTML
Acknowledgments
The preparation of this work has been partially funded by the Spanish Ministry of Economy and Competitiveness (projects TIN2012-32608, TIN2015-70226-R). Eduardo Lalla-Ruiz thanks the Canary Government the financial support he receives through his doctoral grant.
This work was previously submitted to the COPLAS workshop in 2014 and thanks to that included in this special issue.
United Nations Conference on Trade and Development, http://unctad.org
