Berth management in container terminal: the template design problem
From MaRDI portal
Publication:2432094
DOI10.1007/s00291-006-0036-5zbMath1098.90510OpenAlexW1966852250MaRDI QIDQ2432094
Publication date: 25 October 2006
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00291-006-0036-5
Management decision making, including multiple objectives (90B50) Transportation, logistics and supply chain management (90B06)
Related Items (24)
Modelling a resilient yard template under storage demand fluctuations in a container terminal ⋮ Solving a stochastic berth allocation problem using a hybrid sequence pair-based simulated annealing algorithm ⋮ Tactical berth allocation under uncertainty ⋮ A set-partitioning-based model for the berth allocation problem under time-dependent limitations ⋮ Optimal policies for the berth allocation problem under stochastic nature ⋮ Robust berth scheduling at marine container terminals via hierarchical optimization ⋮ Berth allocation and quay crane assignment/scheduling problem under uncertainty: a survey ⋮ Space defragmentation for packing problems ⋮ An optimization approach to the scale of port cold-chain dedicated terminals considering uncertainties ⋮ Berth allocation with time-dependent physical limitations on vessels ⋮ Simultaneous berth allocation and yard planning at tactical level ⋮ Real-time management of berth allocation with stochastic arrival and handling times ⋮ An integrated model for berth and yard planning in container terminals with multi-continuous berth layout ⋮ An exact robust approach for the integrated berth allocation and quay crane scheduling problem under uncertain arrival times ⋮ Operations research at container terminals: a literature update ⋮ A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports ⋮ A dynamic and flexible berth allocation model with stochastic vessel arrival times ⋮ Robust cyclic berth planning of container vessels ⋮ Combinatorial approach to exactly solving discrete and hybrid berth allocation problem ⋮ Selecting algorithms for large berth allocation problems ⋮ New Lower Bound and Exact Method for the Continuous Berth Allocation Problem ⋮ Robust berth scheduling with uncertain vessel delay and handling time ⋮ New formulations and solutions for the strategic berth template problem ⋮ A survey of berth allocation and quay crane scheduling problems in container terminals
Cites Work
This page was built for publication: Berth management in container terminal: the template design problem
