Berth allocation with time-dependent physical limitations on vessels

A Contribution to Berth Allocation Problem Solution with Draft Restrictions

“…The principle showing how the model works can be seen in the graphical presentation (Fig.7). Let us look at the group 3 (vessels [11][12][13][14][15]). An optimal berthing schedule without draft limitation requires that vessel no.14 should wait 3 time windows to be berthed at 29 th immediately after vessel no.13 has left berth segments 1-3.…”

“…The relation between vessel's time of arrival, waiting, berthing and departure is set up by (11) and (12). Berthing time should fall after the time of arrival, as it is defined by (13). Finally, a lower bound of waiting time is defined by (14).…”

“…In that case, such ships could be redirected to berths where depth is not a limiting factor, if available. A similar approach to this one can be found in [13], where water depth and tidal fluctuations are used as attributes. However, the authors have only considered BAP with fixed berths layout.…”

Modeling and Solving the Three Seaside Operational Problems Using an Object-Oriented and Timed Predicate/Transition Net

“…Having investigated three relevant models for solving the BAP, they improved one of the three models. Regarding a parallel-machine scheduling problem, Xu et al [24] dealt with the BAP with constraints that included taking into account the water depth and tidal condition. That study considered both static and dynamic versions of BAP and a heuristic was proposed to deal with them.…”

“…Simulation has been used to solve BAP [14], QCSP [11,15], and as an evaluation tool for terminal operations [16]. Genetic algorithms (GAs) have been used to solve dynamic QCAP [17], QCSP [1,18], simultaneous BAP and QCAP [19][20][21], and simultaneous BAP and QCSP [7,[22][23][24]. Heuristic rules have been employed to solve QCSP [25].…”