Improved sequential insertion heuristics for berth allocation problems

DOI10.1111/itor.13369MaRDI QIDQ6146631

Filipe Rodrigues

Publication date: 31 January 2024

Published in: International Transactions in Operational Research (Search for Journal in Brave)

zbMATH Keywords

berth allocation probleminsertion heuristicinsertion sequencebottom-left heuristic

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
• A proactive approach for simultaneous berth and quay crane scheduling problem with stochastic arrival and handling time
• Multi-objective and prioritized berth allocation in container ports
• Robust berth scheduling with uncertain vessel delay and handling time
• The berth planning problem
• The berth allocation problem: models and solution methods
• Integrated berth allocation and time-variant quay crane scheduling with tidal impact in approach channel
• 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
• The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
• Orthogonal Packings in Two Dimensions
• Metaheuristic approaches for the Berth Allocation Problem
• Maritime inventory routing: recent trends and future directions
• A decision method on yard cranes transformation and deployment in green ports

This page was built for publication: Improved sequential insertion heuristics for berth allocation problems