Pages that link to "Item:Q5059243"

The following pages link to Solving a stochastic berth allocation problem using a hybrid sequence pair-based simulated annealing algorithm (Q5059243):

Displaying 9 items.

• An adaptive large neighborhood search for the discrete and continuous berth allocation problem (Q1651633) (← links)
• The use of frontier techniques to identify efficient solutions for the berth allocation problem solved with a hybrid evolutionary algorithm (Q1738818) (← links)
• A dynamic and flexible berth allocation model with stochastic vessel arrival times (Q2005875) (← links)
• Berth allocation and quay crane assignment/scheduling problem under uncertainty: a survey (Q2158003) (← links)
• Differential evolution based meta-heuristic algorithm for dynamic continuous berth allocation problem (Q2281828) (← links)
• Combinatorial approach to exactly solving discrete and hybrid berth allocation problem (Q2293760) (← links)
• A sample average approximation approach to the berth allocation problem with uncertain tides (Q5058799) (← links)
• Designing a model for service facility protection with a time horizon based on tri-level programming (Q5059288) (← links)
• Proactive berth scheduling with data-driven buffer time in container terminals (Q6495372) (← links)