A Benders Decomposition Algorithm for the Berth Allocation Problem

  • Flávia BarbosaEmail author
  • José Fernando Oliveira
  • Maria Antónia Carravilla
  • Eduardo Ferian Curcio
Conference paper
Part of the Springer Proceedings in Mathematics & Statistics book series (PROMS, volume 278)


In this paper we present a Benders decomposition approach for the Berth Allocation Problem (BAP). Benders decomposition is a cutting plane method that has been widely used for solving large-scale mixed integer linear optimization problems. On the other hand, the Berth Allocation Problem is a NP-hard and large-scale problem that has been gaining relevance both from the practical and scientific points of view. In this work we address the discrete and dynamic version of the problem, and develop a new decomposition approach and apply it to a reformulation of the BAP based on the Heterogeneous Vehicle Routing Problem with Time Windows (HVRPTW) model. In a discrete and dynamic BAP each berth can moor one vessel at a time, and the vessels are not all available to moor at the beginning of the planning horizon (there is an availability time window). Computational tests are run to compare the proposed Benders Decomposition with a state-of-the-art commercial solver.


Berth allocation Mixed integer linear problem Benders decomposition 



The authors acknowledge the Project “TEC4Growth—Pervasive Intelligence, Enhancers and Proofs of Concept with Industrial Impact/NORTE-01-0145-FEDER-000020” is financed by the North Portugal Regional Operational Programme (NORTE 2020), under the PORTUGAL 2020 Partnership Agreement, and through the European Regional Development Fund (ERDF).


  1. 1.
    Buhrkal, K., Zuglian, S., Ropke, S., Larsen, J., Lusby, R.: Models for the discrete berth allocation problem: a computacional comparison. Transportation Research Part E: Logistics and Transportation Review 47(4), 461–473 (2011)CrossRefGoogle Scholar
  2. 2.
    Caramia, M., Mari, R.: A decomposition approach to solve a bilevel capacitated facility location problem with equity constraints. Optimization Letters 10(5), 997–1019 (2016)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Codato, G., Fischetti, M.: Combinatorial benders’ cuts for mixed integer linear programming. Operations Research 54(4), 756–766 (2006)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Cordeau, J.F., Laporte, G., Legato, P., Moccia, L.: Models and tabu search heuristics for the berth allocation problem. Transportation Science 39(4), 526–538 (2005)CrossRefGoogle Scholar
  5. 5.
    Geoffrion, A.M.: Generalized benders decomposition. Journal of Optimization Theory and Applications 10(4), 237–260 (1972)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Grubišić, N., Vilke, S., Barić, M.: A Contribution to Berth Allocation Problem Solution with Draft Restrictions. Pomorski zbornik 49(1), 127–142 (2015)Google Scholar
  7. 7.
    Guan, Y., Cheung, R.K.: The berth allocation problem: models and solution methods. Or Spectrum 26(1), 75–92 (2004)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Huang, Z., Zheng, Q.P.: Decomposition-based exact algorithms for risk-constrained traveling salesman problems with discrete random arc costs. Optimization Letters 9(8), 1553–1568 (2015)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Magnanti, T.L., Wong, R.T.: Accelerating benders decomposition: Algorithmic enhancement and model selection criteria. Operations Research 29(3), 464–484 (1981)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Mercier, A., Cordeau, J.F., Soumis, F.: A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem. Computers & Operations Research 32(6), 1451–1476 (2005)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Monaco, M.F., Sammarra, M.: The berth allocation problem: A strong formulation solved by a lagrangean approach. Transportation Science 41(2), 265–280 (2007)CrossRefGoogle Scholar
  12. 12.
    Pataki, G.: Teaching integer programming formulations using the traveling salesman problem. SIAM REV 45, 116–123 (2003)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Pratap, S., Nayak, A., Cheikhrouhou, N., Tiwari, M.K.: Decision support system for discrete robust berth allocation. IFAC-PapersOnLine 48(3), 875–880 (2015)CrossRefGoogle Scholar
  14. 14.
    Rasmussen, R.V., Trick, M.A.: A Benders approach for the constrained minimum break problem. European Journal of Operational Research 177(1), 198–213 (2007)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Rahmaniani, R., Crainic, T.G., Gendreau, M., Rei, W.: The Benders decomposition algorithm: A literature review. European Journal of Operational Research 259(3), 801–817 (2017)MathSciNetCrossRefGoogle Scholar
  16. 16.
    Tang, L., Jiang, W., Saharidis, G.K.: An improved benders decomposition algorithm for the logistics facility location problem with capacity expansions. Annals of Operations Research 210(1), 165–190 (2013)MathSciNetCrossRefGoogle Scholar
  17. 17.
    Taskın, Z.C.: Benders decomposition. Wiley Encyclopedia of Operations Research and Management Science. John Wiley & Sons, Malden (MA) (2010)Google Scholar
  18. 18.
    Theodorou, E., Diabat, A.: A joint quay crane assignment and scheduling problem: formulation, solution algorithm and computational results. Optimization Letters 9(4), 799–817 (2015)MathSciNetCrossRefGoogle Scholar
  19. 19.
    Vatsa, A.K., Jayaswal, S.: A new formulation and benders decomposition for the multi-period maximal covering facility location problem with server uncertainty. European Journal of Operational Research 251(2), 404–418 (2016)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Flávia Barbosa
    • 1
    Email author
  • José Fernando Oliveira
    • 2
  • Maria Antónia Carravilla
    • 2
  • Eduardo Ferian Curcio
    • 1
  1. 1.INESC TECPortoPortugal
  2. 2.INESC TEC, Faculdade de EngenhariaUniversidade do PortoPortoPortugal

Personalised recommendations