New lower bound and exact method for the continuous berth allocation problem

DOI10.1287/OPRE.2017.1687MaRDI QIDQ4971379zbMATH OpenOpenAlexFDO

Authors Zhou Xu, Chung-Yee Lee

Publication date 12 October 2020

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.2017.1687

zbMATH Keywords

branch and boundcontinuous berth allocationexact methodlower bound

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• New exact methods for the time-invariant berth allocation and quay crane assignment problem
• The berth allocation problem: models and solution methods
• Combinatorial relaxation bounds and preprocessing for berth allocation problems
• The berth allocation problem with a cut-and-run option
• An adaptive large neighborhood search for the discrete and continuous berth allocation problem

Cites work

• A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
• A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
• A review of the application of meta-heuristic algorithms to 2D strip packing problems
• A scheduling method for Berth and Quay cranes
• A survey of berth allocation and quay crane scheduling problems in container terminals
• An adaptive large neighborhood search for the discrete and continuous berth allocation problem
• An exact algorithm for the two-dimensional strip-packing problem
• Berth allocation planning optimization in container terminals
• Berth management in container terminal: the template design problem
• Berth scheduling for container terminals by using a sub-gradient optimization technique
• Combinatorial Benders' cuts for the strip packing problem
• Exact solution of the two-dimensional finite bin packing problem
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Multi-objective and prioritized berth allocation in container ports
• Scheduling. Theory, algorithms, and systems.
• Tactical berth allocation under uncertainty
• The berth allocation problem: models and solution methods
• The Three-Dimensional Bin Packing Problem
• Two-dimensional packing problems: a survey
• Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem

Cited in

(7)

• An adaptive large neighborhood search for the discrete and continuous berth allocation problem
• Exact solution techniques for two-dimensional cutting and packing
• Berth allocation and quay crane assignment/scheduling problem under uncertainty: a survey
• Pilotage planning in seaports
• Combinatorial approach to exactly solving discrete and hybrid berth allocation problem
• Vessel service planning in seaports
• Combinatorial relaxation bounds and preprocessing for berth allocation problems

This page was built for publication: New lower bound and exact method for the continuous berth allocation problem

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