Abstract
The Berth Allocation Problem (BAP) consists on programming and allocating ships to berthing areas along a quay. The BAP is modeled as a vehicle routing problem and a recently proposed evolutionary hybrid method denominated PTA/LP is used to solve it. The PTA/LP combines the Population Training Algorithm with Linear Programming to generate improving incoming columns in a column generation process. The computational results are obtained for a set of instances proposed in literature and new best known solutions are presented.
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.
References
Imai, A., Nishimura, E., Papadimitriou, S.: Berthing ships at a multi-user container terminal with a limited quay capacity. Transportation Research - Part E (2006)
Vis, I.F.A., Koster, R.D.: Transshipment of containers at a container terminal: An overview. European Journal of Operational Research 147, 1–16 (2003)
Cordeau, J.F., Laporte, G., Legato, P., Moccia, L.: Models and tabu search heuristics for the berth allocation problem. Transportation Science 39, 526–538 (2005)
Filho, G.R., Lorena, L.A.N.: Constructive genetic algorithm and column generation: an application to graph coloring. In: Proceedings of APORS 2000 - The Fifth Conference of the Association of Asian-Pacific Operations Research Societies within IFORS (2000)
ILOG France: ILOG CPLEX 10.0 - User’s Manual (2006)
Puchinger, J., Raidl, G.R.: Models and algorithms for three-stage two-dimensional bin packing. European Journal of Operational Research. Feature Issue on Cutting and Packing (2006)
Cordeau, J.F., Laporte, G., Mercier, A.: A unified tabu search heuristic for vehicle routing problems with time windows. Journal of the Operational Research Society 52, 928–936 (2001)
Mauri, G.R., Lorena, L.A.N.: Método interativo para resolução do problema de escalonamento de tripulações. In: XXXVI Brazilian Symposium of Operational Research (2004)
Mauri, G.R.: Novas heurísticas para o problema de escalonamento de tripulações. Master Thesis in Applied Computing. Brasilian Institute for Space Research (2005)
Mauri, G.R., Lorena, L.A.N.: A new hybrid heuristic for driver scheduling. International Journal of Hybrid Intelligent Systems 1(4), 39–47 (2007)
Oliveira, A.C.M., Lorena, L.A.N.: 2-opt population training for minimization of open stack problem. In: Bittencourt, G., Ramalho, G.L. (eds.) SBIA 2002. LNCS (LNAI), vol. 2507, pp. 313–323. Springer, Heidelberg (2002)
Lorena, L.A.N., Furtado, J.C.: Constructive genetic algorithm for clustering problems. Evolutionary Computation 3(9), 309–327 (2001)
Mauri, G.R., Lorena, L.A.N.: Simulated annealing aplicado a um modelo geral do problema de roteirização e programação de veículos. In: XXXVIII Brazilian Symposium of Operational Research (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mauri, G.R., Oliveira, A.C.M., Lorena, L.A.N. (2008). A Hybrid Column Generation Approach for the Berth Allocation Problem. In: van Hemert, J., Cotta, C. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2008. Lecture Notes in Computer Science, vol 4972. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78604-7_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-78604-7_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78603-0
Online ISBN: 978-3-540-78604-7
eBook Packages: Computer ScienceComputer Science (R0)