Berth allocation problem
id:
berth-allocation-problem-178-13248949
title:
Berth allocation problem
text:
The berth allocation 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 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. dynam
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Berth_allocation_problem
date created:
2011-05-04T07:34:14Z
date modified:
2024-09-04T17:12:03Z
main entity:
{"identifier":"Q4895453","url":"https://www.wikidata.org/entity/Q4895453"}
image:
fields total:
13
integrity:
14