The dynamic berth allocation problem: A linearized formulation
From MaRDI portal
Publication:5501868
Recommendations
- Novel formulations and modeling enhancements for the dynamic berth allocation problem
- On the berth allocation problem
- The berth allocation problem in terminals with irregular layouts
- Berth allocation planning in the public berth system by genetic algorithms
- Nonlinear mathematical programming for optimal management of container terminals
Cites work
- A joint quay crane assignment and scheduling problem: formulation, solution algorithm and computational results
- A Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraints
- A survey of berth allocation and quay crane scheduling problems in container terminals
- Variable neighborhood search for minimum cost berth allocation
Cited in
(18)- A POPMUSIC-based approach for the berth allocation problem under time-dependent limitations
- Mathematical models for the berth allocation problem in dry bulk terminals
- The berth allocation problem in terminals with irregular layouts
- A dynamic programming-based matheuristic for the dynamic berth allocation problem
- A self-adaptive evolutionary algorithm for the berth scheduling problem: towards efficient parameter control
- Combinatorial approach to exactly solving discrete and hybrid berth allocation problem
- A joint quay crane assignment and scheduling problem: formulation, solution algorithm and computational results
- Novel formulations and modeling enhancements for the dynamic berth allocation problem
- POPMUSIC as a matheuristic for the berth allocation problem
- On the berth allocation problem
- An integrated berth allocation and yard assignment problem for bulk ports: Formulation and case study
- Clustering search heuristic for solving a continuous Berth Allocation Problem
- Combinatorial relaxation bounds and preprocessing for berth allocation problems
- A Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraints
- Nonlinear mathematical programming for optimal management of container terminals
- Berth allocation planning in the public berth system by genetic algorithms
- An improved genetic algorithm for the berth scheduling with ship-to-ship transshipment operations integrated model
- The service allocation problem at the Gioia Tauro maritime terminal
This page was built for publication: The dynamic berth allocation problem: A linearized formulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501868)
