Combinatorial approach to exactly solving discrete and hybrid berth allocation problem

DOI10.1016/J.APM.2016.05.004zbMath1480.90165OpenAlexW2414528405MaRDI QIDQ2293760

Stevan Kordić, Tatjana Davidović, Branislav Dragović, Nataša Kovač

Publication date: 5 February 2020

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2016.05.004

zbMATH Keywords

combinatorial optimizationbranch and boundoptimal solutionberth allocation problemminimization of total cost

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Discrete location and assignment (90B80)

Cites Work

• POPMUSIC as a matheuristic for the berth allocation problem
• A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
• Berth allocation at indented berths for mega-containerships
• Variable neighborhood search for minimum cost berth allocation
• A survey of berth allocation and quay crane scheduling problems in container terminals
• The berth planning problem
• A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports
• A Lagrangian relaxation approach for solving the integrated quay crane assignment and scheduling problem
• Berth management in container terminal: the template design problem
• Berth Allocation Planning Optimization in Container Terminals
• Berth allocation planning in the public berth system by genetic algorithms

This page was built for publication: Combinatorial approach to exactly solving discrete and hybrid berth allocation problem