Metraipolis › archive › dc_93b28ee33beb

Berth allocation problem — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Berth_allocation_problem
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-31T09:50:19.996Z
SHA-256 of the archived text
233844384cf5c5790c56f786da990e343c485f0358a0ba91fefa377a0cb737d2
Stable URL of this page
https://metraipolis.com/documento/dc_93b28ee33beb

How to cite

Berth allocation problem — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Berth_allocation_problem (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_93b28ee33beb (Metraipolis archive dc_93b28ee33beb, sha256 233844384cf5c5790c56f786da990e343c485f0358a0ba91fefa377a0cb737d2)
BibTeX
@misc{dc93b28ee33beb,
  title = {Berth allocation problem — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Berth_allocation_problem},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_93b28ee33beb; sha256 233844384cf5c5790c56f786da990e343c485f0358a0ba91fefa377a0cb737d2},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Berth_allocation_problem. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The berth allocation problem (also known as the berth scheduling problem) is a NP-complete problem in operations research, regarding the allocation of berth space for vessels in container terminals. Vessels arrive over time and the terminal operator needs to assign them to berths in order to be served (loading and unloading containers) as soon as possible. Different factors affect the berth and time assignment of each vessel. Among models found in the literature, there are four most frequently observed cases: discrete vs. continuous berthing space, static vs. dynamic vessel arrivals, static vs. dynamic vessel handling times, and variable vessel arrivals. In the discrete problem, the quay is viewed as a finite set of berths. In the continuous problem, vessels can berth anywhere along the quay and the majority of research deals with the former case. In the static arrival problem all vessels are already at the port whereas in the dynamic only a portion of the vessels to be scheduled are present. The majority of the published research in berth scheduling considers the latter case. In the static handling time problem, vessel handling times are considered as input, whereas in the dynamic they are decision variables. Finally, in the last case, the vessel arrival times are considered as variables and are optimized. Technical restrictions such as berthing draft and inter-vessel and end-berth clearance distance are further assumptions that have been adopted in some of the studies dealing with the berth allocation problem, bringing the problem formulation closer to real world conditions. Introducing technical restrictions to existing berth allocation models is rather straightforward and it may increase the complexity of the problem but simplify the use of metaheuristics (decrease in the feasible space). Some of the most notable objectives addressed in the literature are: Minimization of vessel total service times (waiting and handling times), Minimization of early and delayed departures, Optimization of vessel arrival times, Optimization of emissions and fuel consumption. Problems have been formulated as single and multi-objective as well as single and bi-level.

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «mathematical optimization»).
Fonte: Wikipedia in inglese, voce «Berth allocation problem» — https://en.wikipedia.org/wiki/Berth_allocation_problem
Wikidata Q4895453: «optimization problem» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q4895453
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Berth_allocation_problem?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1326526975, consultata il 2026-10-31T09:37:41.889Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 8361d1f8d44bfd9b3a75aa0df6dbd5d39492014c00f2070dd03aeb2686e8f6bf