Solving a stochastic berth allocation problem using a hybrid sequence pair-based simulated annealing algorithm

DOI10.1080/0305215X.2018.1552268MaRDI QIDQ5059243zbMATH OpenWikidataFDO

Authors Mohammad Hassan Mohammadi, Kamran Forghani

Publication date 23 December 2022

Published in Engineering Optimization (Search for Journal in Brave)

zbMATH Keywords

simulated annealingstochastic optimizationschedulingberth allocationsequence pair

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Recommendations

• A dynamic and flexible berth allocation model with stochastic vessel arrival times
• A sample average approximation approach to the berth allocation problem with uncertain tides
• A decision model for berth allocation under uncertainty considering service level using an adaptive differential evolution algorithm
• Exact and heuristic methods for the integrated berth allocation and specific time-invariant quay crane assignment problems
• An adaptive large neighborhood search for the discrete and continuous berth allocation problem

Cites work

• A proactive approach for simultaneous berth and quay crane scheduling problem with stochastic arrival and handling time
• A sample average approximation approach to the berth allocation problem with uncertain tides
• A set-partitioning-based model for the berth allocation problem under time-dependent limitations
• Berth management in container terminal: the template design problem
• Berth scheduling for container terminals by using a sub-gradient optimization technique
• Differential evolution based meta-heuristic algorithm for dynamic continuous berth allocation problem
• Handling precedence constraints in scheduling problems by the sequence pair representation
• Optimal policies for the berth allocation problem under stochastic nature
• Robust berth scheduling at marine container terminals via hierarchical optimization
• Robust berth scheduling with uncertain vessel delay and handling time
• Robust cyclic berth planning of container vessels
• Tactical berth allocation under uncertainty

Cited in

(11)

• The use of frontier techniques to identify efficient solutions for the berth allocation problem solved with a hybrid evolutionary algorithm
• Combinatorial approach to exactly solving discrete and hybrid berth allocation problem
• Differential evolution based meta-heuristic algorithm for dynamic continuous berth allocation problem
• A sample average approximation approach to the berth allocation problem with uncertain tides
• An adaptive large neighborhood search for the discrete and continuous berth allocation problem
• A decision model for berth allocation under uncertainty considering service level using an adaptive differential evolution algorithm
• Clustering search heuristic for solving a continuous Berth Allocation Problem
• Proactive berth scheduling with data-driven buffer time in container terminals
• A dynamic and flexible berth allocation model with stochastic vessel arrival times
• Designing a model for service facility protection with a time horizon based on tri-level programming
• Berth allocation and quay crane assignment/scheduling problem under uncertainty: a survey

This page was built for publication: Solving a stochastic berth allocation problem using a hybrid sequence pair-based simulated annealing algorithm

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