Combinatorial approach to exactly solving discrete and hybrid berth allocation problem

DOI10.1016/J.APM.2016.05.004MaRDI QIDQ2293760zbMATH OpenOpenAlexFDO

Authors S. Kordic, Tatjana Davidović, N. Kovac, Branislav Dragović

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

berth allocation problembranch and boundcombinatorial optimizationminimization of total costoptimal solution

Mathematics Subject Classification ID

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

Recommendations

• Combinatorial relaxation bounds and preprocessing for berth allocation problems
• The berth allocation problem: models and solution methods
• New lower bound and exact method for the continuous berth allocation problem
• On the berth allocation problem
• A dynamic programming-based matheuristic for the dynamic berth allocation problem
• The berth allocation problem with a cut-and-run option
• The dynamic berth allocation problem: A linearized formulation
• Solving a stochastic berth allocation problem using a hybrid sequence pair-based simulated annealing algorithm

Cites work

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

Cited in

(3)

• Combinatorial relaxation bounds and preprocessing for berth allocation problems
• An adaptive large neighborhood search heuristic for the multi-port continuous berth allocation problem
• A prescriptive analytics approach to solve the continuous berth allocation and yard assignment problem using integrated carbon emissions policies

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2293760)