A sample average approximation approach to the berth allocation problem with uncertain tides

DOI10.1080/0305215X.2017.1411483MaRDI QIDQ5058799zbMATH OpenOpenAlexFDO

Authors Abdorreza Sheikholeslami, Reza Ilati

Publication date 23 December 2022

Published in Engineering Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/0305215x.2017.1411483

zbMATH Keywords

Berth allocationcontainer terminalrandom arrivalsample average approximationtides

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Recommendations

• A decision model for berth allocation under uncertainty considering service level using an adaptive differential evolution algorithm
• A dynamic and flexible berth allocation model with stochastic vessel arrival times
• Solving a stochastic berth allocation problem using a hybrid sequence pair-based simulated annealing algorithm
• Robust berth scheduling at marine container terminals via hierarchical optimization
• Tactical berth allocation under uncertainty

Cites work

• A hybrid metaheuristic approach to solving the UBQP problem
• A set-partitioning-based model for the berth allocation problem under time-dependent limitations
• Berth allocation with time-dependent physical limitations on vessels
• Monte Carlo bounding techniques for determinig solution quality in stochastic programs
• Robust berth scheduling with uncertain vessel delay and handling time
• Robust scheduling for berth allocation and quay crane assignment problem
• The sample average approximation method for stochastic discrete optimization

Cited in

(10)

• Real-time management of berth allocation with stochastic arrival and handling times
• Optimization of port emergency materials dispatch with time windows constraints under uncertainties
• Berth allocation and quay crane assignment/scheduling problem under uncertainty: a survey
• An exact robust approach for the integrated berth allocation and quay crane scheduling problem under uncertain arrival times
• A decision model for berth allocation under uncertainty considering service level using an adaptive differential evolution algorithm
• Tactical berth allocation under uncertainty
• Dynamic disruption management for container terminal resources allocation problem in periodic environment
• Solving a stochastic berth allocation problem using a hybrid sequence pair-based simulated annealing algorithm
• Superposition, reduction of multivariable problems, and approximation
• Proactive berth scheduling with data-driven buffer time in container terminals

This page was built for publication: A sample average approximation approach to the berth allocation problem with uncertain tides

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