An integrated berth allocation and yard assignment problem for bulk ports: Formulation and case study
From MaRDI portal
Publication:2969974
DOI10.1051/RO/2015048zbMATH Open1358.90014OpenAlexW2527422581MaRDI QIDQ2969974
Publication date: 24 March 2017
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1051/ro/2015048
Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Berth allocation with time-dependent physical limitations on vessels
- A Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraints
- A proactive approach for simultaneous berth and quay crane scheduling problem with stochastic arrival and handling time
- Robust cyclic berth planning of container vessels
- Online rules for container stacking
- Simulation-based optimization for discharge/loading operations at a maritime container terminal
- A scheduling method for Berth and Quay cranes
- A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports
- A joint quay crane assignment and scheduling problem: formulation, solution algorithm and computational results
- On the Berth Allocation Problem
- Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures
- The Dynamic Berth Allocation Problem: A linearized formulation
Related Items (3)
Berth allocation at indented berths for mega-containerships โฎ Exact and metaheuristic approaches to solve the integrated production scheduling, berth allocation and storage yard allocation problem โฎ On the Berth Allocation Problem
Recommendations
- An integrated storage space and berth allocation problem in a container terminal ๐ ๐
- Multi-objective and prioritized berth allocation in container ports ๐ ๐
- The berth allocation problem: models and solution methods ๐ ๐
- An integrated model for berth and yard planning in container terminals with multi-continuous berth layout ๐ ๐
- The berth allocation problem in terminals with irregular layouts ๐ ๐
- A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports ๐ ๐
- Novel formulations and modeling enhancements for the dynamic berth allocation problem ๐ ๐
- Berth Allocation Planning Optimization in Container Terminals ๐ ๐
- Exact and metaheuristic approaches to solve the integrated production scheduling, berth allocation and storage yard allocation problem ๐ ๐
This page was built for publication: An integrated berth allocation and yard assignment problem for bulk ports: Formulation and case study