Optimizing Ship Berthing
TL;DR: This work presents an optimization model for berth planning and demonstrates it for Norfolk Naval Station, which exhibits all the richness of berthing problem: the Navy faces.
read more
Abstract: : Ship berthing plans reserve a location for inbound U.S. Navy surface vessels prior to their port entrance, or reassign ships once in port to allow them to complete, in a timely manner, reprovisioning, repair, maintenance, training, and certification tests prior to redeploying for future operational commitments. Each ship requires different services when in port, such as shore power, crane, ordnance, and fuel. Unfortunately, not all services are offered at all piers, and berth shifting is disruptive and expensive: A port operations scheduler strives to reduce unnecessary berth shifts. We present an optimization model for berth planning and demonstrate it for Norfolk Naval Station, which exhibits all the richness of berthing problem:. the Navy faces.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A survey of berth allocation and quay crane scheduling problems in container terminals
Christian Bierwirth,Frank Meisel +1 more
TL;DR: New classification schemes for berth allocation problems and quay crane scheduling problems are developed and particular focus is put on integrated solution approaches which receive increasing importance for the terminal management.
824
Ship Routing and Scheduling: Status and Perspectives
TL;DR: The objective of this paper is to review the current status of ship routing and scheduling and focus on literature published during the last decade, indicating both accelerating needs for and benefits from such systems.
782
A crane scheduling method for port container terminals
Kap Hwan Kim,Young-Man Park +1 more
TL;DR: This study proposes a branch and bound (B & B) method to obtain the optimal solution of the QC scheduling problem and a heuristic search algorithm, called greedy randomized adaptive search procedure (GRASP), to overcome the computational difficulty of the B & B method.
562
The dynamic berth allocation problem for a container port
TL;DR: In this paper, the problem of determining a dynamic berth assignment to ships in the public berth system is addressed, and a heuristic procedure based on the Lagrangian relaxation of the original problem is developed.
557
The Dynamic Berth Allocation Problem for a Container Port
Akio Imai,Etsuko Nishimura,Stratos Papadimitriou +2 more
- 01 Mar 2003
TL;DR: This paper developed a heuristic procedure based on the Lagrangian relaxation of the original problem and conducted a large amount of computational experiments which showed that the proposed algorithm is adaptable to real world applications.
500
References
Mathematical Programming Studies
TL;DR: In this article, the authors present Mathematical Programming Studies (MPSS) for the Operational Research Society (ORS) conference on mathematical programming studies, with a focus on the application of MPSS.
38
On the development of a general algebraic modeling system in a strategic planning environment
Bisschop, J. Meeraus, A.
- 01 Jan 1982
TL;DR: This paper describes the resulting development of a General Algebraic Modeling System (GAMS), which employs a rigorous algebraic representation of data and equations, coupled with relational database-type facilities, and draws comparisons to other modeling systems designed for large-scale linear programming problems.
Optimal ship berthing plans
Katie Podolak Thurman
- 01 Mar 1989
TL;DR: In this paper, an extensive user-friendly computerized optimization model is developed and tested to assist the schedulers in the creation of a ship berthing plan which minimizes port loading conflicts, thus promoting fleet readiness through berthing stability.