arXiv (All)
open access
Robust Metaheuristics under Uncertainty for Berth Allocation and Quay Crane Assignment: A Review
The berth allocation and quay crane assignment problem (BACAP) is a representative port-terminal scheduling problem in maritime transportation and freight logistics, where vessel arrivals, berth positions, service durations, and quay?crane availability are tightly coupled. Under uncertainties such a
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- An Adaptive Computational Framework for Structural Shape Optimization: Deterministic and Robust Formulations#1040206
- Heuristic algorithm for path planning in high-density automated storage and retrieval system raw material box reorganization.#145967
- How long is long enough? Finite-horizon approximation of energy storage scheduling problems#1011987
- Assessment of a heuristic algorithm for scheduling Theater Security Cooperation naval missions#633678
- Analysis of deficits in discrete time resource allocation problems with correlated supplies and demands#496940
Record · ID 985220
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive