Crane allocation

Abstract

Disclosed is a computer-implemented method of determining, for a berthed vessel at a terminal comprising a plurality of cranes disposed along a crane conveyance system, a proposed allocation of the plurality of cranes to the berthed vessel to perform a plurality of vessel operations on the vessel within a time window. The determining is based at least in part on first data indicative of a status of the berthed vessel at the terminal within the time window, second data indicative of cargo associated with the plurality of vessel operations to be performed within the time window, third data indicative of a number of the plurality of cranes required to perform the plurality of vessel operations within the time window on the berthed vessel, fourth data indicative of a status of the plurality of cranes within the time window, and fifth data indicative of a relative positioning of at least one of the plurality of cranes to the berthed vessel within the time window.

Description

CRANE ALLOCATIONTECHNICAL FIELD

[0001] The present invention relates to a computer-implemented method of determining, for a berthed vessel at a terminal comprising a plurality of cranes disposed along a crane conveyance system, a proposed allocation of the plurality of cranes to the berthed vessel to perform a plurality of vessel operations on the vessel within a time window. The present invention also relates to a computing system configured to perform such a computer-implemented method, a data carrier comprising machine readable instructions for the operation of one or more processors of such a computing system, and a computer program comprising instructions which, when the program is executed by a computing system, cause the computing system to carry out the computer- implemented method.BACKGROUND

[0002] Berth planning can include the process of distributing cranes along vessel operations, that is, allocating cranes to vessels scheduled to load and discharge cargo at a specific container terminal.SUMMARY

[0003] According to a first aspect of the present invention, there is provided a computer- implemented method of determining, for a berthed vessel at a terminal comprising a plurality of cranes disposed along a crane conveyance system, a proposed allocation of the plurality of cranes to the berthed vessel to perform a plurality of vessel operations on the vessel within a time window, wherein the determining is based at least in part on: first data indicative of a status of the berthed vessel at the terminal within the time window; second data indicative of cargo associated with the plurality of vessel operations to be performed within the time window; third data indicative of a number of the plurality of cranes required to perform the plurality of vessel operations within the time window on the berthed vessel; fourth data indicative of a status of the plurality of cranes within the time window; and fifth data indicative of a relative positioning of at least one of the plurality of cranes to the berthed vessel within the time window.

[0004] By accounting for the first through fifth data when determining the proposed allocation of the plurality of cranes to the berthed vessel to perform the plurality of vessel operations on the vessel within the time window, energy consumption associated with performing the plurality of vessel operations on the berthed vessel within the time window may be reduced. For example, the first through third data may enable an accurate picture to be provided of the resources needed to perform the plurality of vessel operations within the time window, whilst the fourth and fifth data may enable provision of such resources whilst minimising energy consumption associated with performing the plurality of vessel operations on the berthed vessel within the time window.

[0005] By accounting for a status of the plurality of cranes within the time window, excessive wear and tear on cranes, which would otherwise lead to increased maintenance and therefore increased energy consumption, may be avoided. For example, if a crane has a status that indicates required maintenance and / or down time, but a proposed allocation nevertheless allocates that crane to a vessel operation within the time window, damage to the crane may occur, which may lead to increased energy consumption as a result of further maintenance.

[0006] By accounting for the relative positioning of the at least one of the plurality of cranes to the berthed vessel, energy consumption associated with movement of the plurality of cranes to perform the vessel operations may be reduced or minimised. For example, if a crane is currently positioned at a location able to perform a vessel operation within the time window, or will be positioned at a location able to perform a subsequent vessel operation having already performed a vessel operation within the time window, then to move that crane so that it is not involved in the vessel operation or the subsequent vessel operation would be an unnecessary use of energy. The relative positioning may be associated with performance of at least one of the plurality of vessel operations within the time window.

[0007] The berthed vessel may comprise a current berthed vessel, for example a berthed vessel currently located at its berthing location at the terminal. The berthed vessel may comprise a future berthed vessel, for example a vessel that will be berthed at a berthing location at the terminal in the future. The future berthed vessel may comprise a vessel indicated to be berthed at the terminal in a proposed allocation of the berthed vessel to the terminal.

[0008] The plurality of cranes may each comprise an electrically powered crane. Each of the plurality of cranes may comprise an automated crane. The crane conveyance system may comprise an electrically powered crane conveyance system. The plurality of cranes may bedisposed linearly along the crane conveyance system, for example such that the plurality of cranes can only move linearly along the crane conveyance system. The plurality of cranes may have an assigned order along the crane conveyance system, and the order may be fixed.

[0009] Each vessel operation may correspond to a shift of the plurality of cranes, for example with a shift of the plurality of cranes comprising a sub-window of the time window in which the cranes perform a respective vessel operation, with shifts spaced apart by down-time of the plurality of cranes. Determining the proposed allocation of the plurality of cranes to the berthed vessel to perform the plurality of vessel operations on the berthed vessel within the time window may comprise determining a number of cranes allocated to the vessel for each shift of the plurality of cranes. Each vessel operation may comprise at least one of unloading cargo from, and loading cargo to, the berthed vessel, for example unloading cargo from, and loading cargo to, the berthed vessel by the plurality of cranes during the shift of the plurality of cranes.

[0010] The first data may comprise at least one of an identifier, such as a name, of the berthed vessel, a type of the berthed vessel, a size, for example a length, of the berthed vessel, a cargo capacity of the berthed vessel, a priority of the berthed vessel, a berth identifier of the berthed vessel, and a time at which the berthed vessel is berthed at the terminal. The type of the berthed vessel may comprise an indication as to whether the berthed vessel is carrying perishable cargo or livestock. The priority of the berthed vessel may be indicative of a proposed ordering in which vessel operations should be carried out on the berthed vessel and a further berthed vessel at the terminal.

[0011] The computer-implemented method may comprise obtaining the first data from a memory accessible by a computing system configured to perform the computer-implemented method. The computing system may be located at the terminal. The memory may comprise a memory located at the terminal. The computer-implemented method may comprise obtaining the first data from an actual allocation, or a proposed allocation, of the berthed vessel to the terminal.

[0012] The second data may be indicative of a volume of cargo associated with the plurality of vessel operations. The second data may be indicative of a total volume of cargo associated with the plurality of vessel operations. The second data may be indicative of a respective volume of cargo associated with each of the plurality of vessel operations.

[0013] The computer-implemented method may comprise obtaining the second data from a memory accessible by a computing system configured to perform the computer-implemented method. The computing system may be located at the terminal. The memory may comprise a memory located at the terminal. The computer-implemented method may comprise obtaining the second data from an actual allocation, or a proposed allocation, of the berthed vessel to the terminal.

[0014] The third data may be indicative of a total number of cranes required to perform the plurality of vessel operations within the time window. The third data may be indicative of a number of cranes required to perform each respective vessel operation of the plurality of vessel operations within the time window.

[0015] The computer-implemented method may comprise obtaining the third data from a memory accessible by a computing system configured to perform the computer-implemented method. The computing system may be located at the terminal. The memory may comprise a memory located at the terminal. The computer-implemented method may comprise obtaining the third data from an actual allocation, or a proposed allocation, of the berthed vessel to the terminal. The computer- implemented method may comprise calculating the third data, for example based at least in part on any of the first data and the second data.

[0016] The fourth data may be indicative of whether at least one of the plurality of cranes will be available to perform at least one of the plurality of vessel operations within the time window.

[0017] This may enable excessive wear and tear on cranes, which would otherwise lead to increased maintenance and therefore increased energy consumption, to be avoided. For example, if a crane has a status that indicates a crane to be unavailable, such as due to required maintenance and / or downtime, but a proposed allocation of the plurality of cranes to the berthed vessel nevertheless allocates that crane to a vessel operation within the time window, damage to the crane may occur, which may lead to increased energy consumption as a result of further maintenance.

[0018] The fourth data may be indicative of whether each of the plurality of cranes will be available to perform at least one of the plurality of vessel operations within the time window.

[0019] Determining the proposed allocation of the plurality of cranes to the berthed vessel may comprise applying a negative weighting factor to the fourth data where the fourth data is indicative that the crane will not be operational within the time window, for example that the crane will not be operational for at least some of the vessel operations within the time window.

[0020] The fourth data may be indicative of whether a crane of the plurality of cranes is scheduled to be undergoing maintenance and / or downtime within the time window. Determining the proposed allocation of the plurality of cranes to the berthed vessel may comprise applying a negative weighting factor to the fourth data where the fourth data is indicative that the crane will be undergoing maintenance and / or downtime within the time window. The fourth data may be indicative of whether each of the plurality of cranes is scheduled to be undergoing maintenance and / or downtime within the time window.

[0021] The fourth data may be indicative of whether a crane of the plurality of cranes that is intended to be allocated to the berthed vessel in a possible allocation of the plurality of cranes to the berthed vessel is, or would be, missing from the possible allocation. For example, the fourth data may be indicative of whether a crane of the plurality of cranes that is intended to be allocated to the berthed vessel in a possible allocation of the plurality of cranes to the berthed vessel cannot actually be assigned as part of the possible allocation. Determining the proposed allocation of the plurality of cranes to the berthed vessel may comprise applying a negative weighting factor to the fourth data where the fourth data is indicative that the crane will be missing from the possible allocation.

[0022] The fourth data may be indicative of whether a crane of the plurality of cranes that is intended to be allocated to the berthed vessel in a possible allocation of the plurality of cranes to the berthed vessel is, or would be, assigned to a further berthed vessel during the time window. Determining the proposed allocation of the plurality of cranes to the berthed vessel may comprise applying a negative weighting factor to the fourth data where the fourth data is indicative that the crane is, or would be, assigned to a further berthed vessel during the time window.

[0023] The fourth data may be indicative of whether a crane of the plurality of cranes that is intended to be allocated to the berthed vessel in a possible allocation of the plurality of cranes to the berthed vessel, said crane being located intermediate any two other cranes of the plurality of cranes that are intended to be allocated to the berthed vessel in the possible allocation of theplurality of cranes to the berthed vessel, will be idle for more than a pre-determined period during at least some of the plurality of vessel operations.

[0024] This may allow the computer-implemented method to account for situations in which two cranes are intended to be allocated to the berthed vessel, but a third crane located between the two cranes along the crane conveyance system will be idle during at least some of the plurality of vessel operations. Such scenarios may lead to inefficient performance of the plurality of vessel operations compared to scenarios in which consecutive cranes along the crane conveyance system are allocated. For example, if a crane that is intended to be allocated to the berthed vessel in a possible allocation of the plurality of cranes to the berthed vessel is always scheduled to be idle within the time window, then an increased number of crane shifts may be required to successfully perform the intended vessel operations, for example leading to increased movement of cranes along the crane conveyance system. This can lead to increased energy consumption relative to scenarios in which consecutive cranes along the crane conveyance system are available within the time window.

[0025] Determining the proposed allocation of the plurality of cranes to the berthed vessel may comprise applying a negative weighting factor to the fourth data where the fourth data is indicative that the crane will be idle during at least some of the plurality of vessel operations.

[0026] The computer-implemented method may comprise obtaining the fourth data from a memory accessible by a computing system configured to perform the computer-implemented method. The computer-implemented method may comprise obtaining the fourth data from the terminal. The computer-implemented method may comprise calculating the fourth data, for example based at least in part on data obtained from the memory and / or data obtained from the terminal.

[0027] The fifth data may be indicative of a reach of the at least one crane of the plurality of cranes to the berthed vessel during a possible allocation of the at least one of the plurality of cranes to the berthed vessel.

[0028] This may enable a reduction in power consumption associated with performance of the plurality of vessel operations within the time window. For example, if the at least one crane is assigned to the berthed vessel to perform at least some of the plurality of vessel operations, but the at least one crane does not have full reach to the vessel, then the at least one crane may beunable to adequately perform the vessel operations to which it has been assigned. This may lead to requiring an increased number of cranes to perform the plurality of vessel operations, which can lead to increased energy consumption.

[0029] The fifth data may be indicative of whether and / or to what extent the crane can reach the vessel.

[0030] Determining the proposed allocation of the plurality of cranes to the berthed vessel may comprise applying a negative weighting factor to the fifth data where the fifth data is indicative that the at least one of the plurality of cranes that is associated with the possible allocation does not have full reach to the vessel. The negative weighting factor may be scaled based on the reach to the vessel, for example with the negative weighting factor increasing as the reach to the vessel decreases.

[0031] The fifth data may be indicative of a relative position of the at least one of the plurality of cranes to the berthed vessel prior to a start of a vessel operation of a possible allocation of the plurality of cranes to the berthed vessel.

[0032] By accounting for a relative position of the at least one of the plurality of cranes to the berthed vessel prior to the start of a vessel operation of the possible allocation of the plurality of cranes to the berthed vessel, energy consumption associated with the proposed allocation of cranes may be minimised. For example, if one crane that could perform the vessel operation is located further from the position it needs to be in to perform the vessel operation than another crane, then it may take more energy to move the crane into position to perform the vessel operation.

[0033] The fifth data may be indicative of whether the at least one of the plurality of cranes is required to move from a start position prior to the vessel operation to perform the vessel operation. Determining the proposed allocation of the plurality of cranes to the berthed vessel may comprise applying a negative weighting factor to the fifth data where the fifth data is indicative that the at least one of the plurality of cranes is required to move a distance above a pre-determined threshold from its respective relative start position to be able to perform a vessel operation of the plurality of vessel operations. The pre-determined threshold may be zero. The negative weighting factor may be scaled based on how far from its start position the at least one of the plurality of cranes is required to move to perform the vessel operation, for example with thenegative weighting factor increasing as the distance from the start position increases. The fifth data may be indicative of whether the at least one of the plurality of cranes needs to be repositioned to perform at least one of the vessel operations of the plurality of vessel operations.

[0034] The fifth data may be indicative of a number of movements the at least one of the plurality of cranes is required to make to be able to perform a plurality of vessel operations associated with a possible allocation of the at least one of the plurality of cranes to the berthed vessel. Determining the proposed allocation of the plurality of cranes to the berthed vessel may comprise applying a negative weighting factor to the fifth data where the fifth data is indicative that the at least one of the plurality of cranes is required to move more than a pre-determined number of movements to be able to perform the plurality of vessel operations associated with a possible allocation of the at least one of the plurality of cranes to the berthed vessel. The pre-determined number of movements may be zero. The negative weighting factor may be scaled based on how many movements are required to be able to perform the plurality of vessel operations associated with a possible allocation of the at least one of the plurality of cranes to the berthed vessel, for example with the negative weighting factor increasing as the number of movements increases.

[0035] The fifth data may be indicative of whether one of the plurality of cranes, associated with a possible allocation of the plurality of cranes to a further vessel located on a first side of a further one of the plurality of cranes intended to be allocated to the vessel, is located on a second opposite side of the further one of the plurality of cranes intended to be allocated to the vessel. By accounting for such data, possible allocations of the plurality of cranes to the berthed vessel that are technically incompatible the plurality of cranes, and hence that would otherwise lead to missing cranes associated with the possible allocation, are mitigated for. For example, where the plurality of cranes are disposed linearly along the crane conveyance system, such that the plurality of cranes can only move linearly along the crane conveyance system, a crane located on a left side of another crane that is allocated to the vessel cannot validly be assigned to a further vessel located on a right side of the another crane.

[0036] Determining the proposed allocation of the plurality of cranes to the berthed vessel may comprise applying a negative weighting factor to the fifth data where the fifth data is indicative that one of the plurality of cranes, associated with a possible allocation of the plurality of cranes to a further vessel located on a first side of a further one of the plurality of cranes intended to be allocated to the vessel, is located on a second opposite side of the further one of the plurality of cranes intended to be allocated to the vessel.

[0037] The computer-implemented method may comprise displaying, on a display device, the proposed allocation of the plurality of cranes to the berthed vessel.

[0038] By displaying the proposed allocation of the plurality of cranes to the berthed vessel on a display device, an operator of a computing system configured to perform the computer- implemented method may be able to analyse the proposed allocation of the plurality of cranes to the berthed vessel, and take appropriate action. For example, the operator may be able to configure resource operations of resources of the terminal, including the plurality of cranes, based on the proposed allocation of the plurality of cranes to the berthed vessel. This may enable the operator to minimise energy consumption of resources, such as the plurality of cranes, of the terminal.

[0039] Displaying, on the display device, the proposed allocation of the plurality of cranes to the berthed vessel may comprise providing a visual representation indicative of which cranes of the plurality of cranes are proposed to be allocated to the berthed vessel. The visual representation by be indicative of any of a position of cranes proposed to be allocated along the crane conveyance system, and which of the plurality of cranes are proposed to be allocated for each of the plurality of vessel operations.

[0040] The computer-implemented method may comprise redetermining the proposed allocation of the plurality of cranes to the berthed vessel in response to input from an operator of a computing system configured to perform the computer-implemented method.

[0041] The determining the proposed allocation of the plurality of cranes to the berthed vessel to perform the plurality of vessel operations on the berthed vessel within the time window may comprise selecting one a plurality of possible allocations of the plurality of cranes to the berthed vessel based at least in part on the first, second, third, fourth, and fifth data.

[0042] By considering a plurality of possible allocations of the plurality of cranes based at least in part on the first through fifth data, the computer-implemented method may enable the proposed allocation to be improved or optimised to meet certain criteria set by an operator of a computing system configured to perform the computer-implemented method.

[0043] Determining the proposed allocation of the plurality of cranes to the berthed vessel may comprise applying a negative weighting factor to any of the first through fifth data that is indicative of increased resource usage of resources of the terminal, and increased energy consumption of the terminal and / or resources thereof.

[0044] The computer-implemented method may comprise causing a controller of at least one of the crane conveyance system and the plurality of cranes to cause movement of one or more of the plurality of cranes along the crane conveyance system.

[0045] The computer-implemented method may be performed by a computing system in communication with the controller of at least one of the crane conveyance system and the plurality of cranes, or the computer-implemented method may be performed by the controller of at least one of the crane conveyance system and the plurality of cranes.

[0046] The computer-implemented method may comprise automatically causing the controller of at least one of the crane conveyance system and the plurality of cranes to cause movement of the plurality of cranes along the crane conveyance system, for example directly in response to the determination of the proposed allocation of the plurality of cranes to the berthed vessel.

[0047] The computer-implemented method may comprise causing, in response to operator input at an operator interface, a controller of at least one of the crane conveyance system and the plurality of cranes to cause movement of the plurality of cranes along the crane conveyance system.

[0048] According to a second aspect of the present invention there is provided a computing system comprising one or more processors configured to perform the computer-implemented method according to the first aspect of the present invention.

[0049] The computing system may be located at the terminal.

[0050] According to a third aspect of the present invention there is provided a data carrier comprising machine readable instructions for the operation of one or more processors of the computing system according to the second aspect of the present invention to perform the computer-implemented method according to the first aspect of the present invention.

[0051] According to a fourth aspect of the present invention there is provided a computer program comprising instructions which, when the program is executed by a computing system, cause the computing system to carry out the computer-implemented method of the first aspect of the present invention.

[0052] Optional features of aspects of the present invention may be equally applied to other aspects of the present invention, where appropriate.BRIEF DESCRIPTION OF DRAWINGS

[0053] Embodiments of the invention will now be described, by way of example only, with reference to the accompanying drawings, in which:

[0054] Figure 1 is a schematic view of a container terminal;

[0055] Figure 2 is a schematic view illustrating a first operation of a processor of a computing system of the container terminal of Figure 1 ;

[0056] Figure 3 is a schematic view illustrating a graphical user interface displayed by a display device of a computing system of the container terminal of Figure 1 ;

[0057] Figure 4 is a flow diagram illustrating processes performed by the processor as part of the first operation of Figure 2;

[0058] Figure 5 is a schematic view illustrating a second operation of the processor of the computing system of the container terminal of Figure 1 ; and

[0059] Figure 6 is a flow diagram illustrating processes performed by the processor as part of the second operation of Figure 5.DETAILED DESCRIPTION

[0060] A container terminal 10 is illustrated schematically in Figure 1 . The container terminal 10 comprises a quay 12, a crane system 14 extending along the quay 12, three berths 16 extending alongside the quay 12, terminal resources 18, and a computing system 20.

[0061] The crane system 14 comprises two rails 22, and fourteen cranes 24 that are rollably mounted to the two rails 22. The rails 22 are shown as extending off the quay 12 in Figure 1 , but it will be appreciated that this shows that the rails 22 and the quay 12 can have a greater extent than shown in Figure 1 . It will also be appreciated that a greater or fewer number of rails 22 and cranes 24 is also envisaged. The rails 22 can be thought of as a crane conveyance system herein, with the cranes 24 movable along the rails 22 to move along the quay 12.

[0062] Each of the cranes 24 is an electrically powered crane, and is an automated crane that does not require a manual operator. The cranes 24 can, in some examples, be operable in response to a control signal from the computing system 20. The cranes 24 are disposed linearly along the rails 22 such that the cranes have a fixed ordering along the rails 22. Each crane 24 has a boom 26 that can be used to perform vessel operations on vessels located at the container terminal 10, as will be discussed in more detail hereinafter. It will be appreciated that each boom 26 gives the respective crane an associated reach to vessels located at the berths 16.

[0063] The berths 16 are pre-designated positions at which vessels can berth at the container terminal 10, and are pre-designated positions along the quay 12. Although three berths 16 are illustrated here, it will be appreciated that there may be a greater number of berths 16 in practice.

[0064] The terminal resources 18 are indicated schematically as a block in Figure 1 , but in practice can comprise any of resources that consume electrical energy, and resources that consume fuel, at the container terminal 10. For example, crew facilities can be considered to be terminal resources 18. In some examples, the cranes 24 can themselves be considered to form part of the terminal resources 18.

[0065] The computing system 20 comprises a processor 28, a display device 30, a transceiver 32, and a memory 34. The processor 28 is configured to perform a variety of operations, as will be discussed in more detail hereinafter. The display device 30 is in communication with the processor 28, and is configured to display data to a terminal operator. The transceiver 32 is configured to communicate with a remote system 36. The remote system 36 can comprise any of a remote computing system and a vessel, for example a vessel to be berthed at the container terminal 10. The remote system 36 can comprise a memory configured to store data relevant to operations of the container terminal 10, as will be discussed in more detail hereinafter. The memory 34 of the computing system 20 is accessible by the processor 28, and can store a variety of different data, as will be discussed in more detail hereinafter. Although illustrated here as partof the container terminal 10, in other examples the computing system 20 can be located remotely from, but in communication with, another computing system of the container terminal 10.

[0066] In one example operation, the processor 28 determines a proposed allocation 50 of a vessel to one of the berths 16, for example a particular one of the berths 16 at a particular time period. This can include a consideration of multiple ones of the berths 16 for the particular vessel within a given time window. Such an operation is illustrated schematically in Figure 2.

[0067] To perform the determination, the processor 28 obtains first data 38 indicative of at least one of a departure time of the vessel from a previously scheduled terminal and an arrival time of the vessel at a next scheduled terminal. In some examples, the first data 38 is indicative of at least one of a future departure time of the vessel from a previously scheduled terminal, and a future arrival time of the vessel at a next scheduled terminal. In some examples, the first data 38 is indicative of a past departure time of the vessel from the previously scheduled terminal.

[0068] The processor 28 can obtain the first data 38 in a number of ways. In some examples the processor 28 can obtain the first data 38 from the memory 34. In some examples, the processor 28 can submit a request for the first data 38, using the transceiver 32, from the remote system 36. For example, the processor 28 can request that the vessel transmits its actual or intended departure time from a previously scheduled terminal to the processor 28. In response, the vessel can transmit the first data 38, with the processor 28 receiving the first data 38 via the transceiver 32. In other examples, the first data 38 can be transmitted from a previously scheduled or future scheduled terminal associated with the vessel.

[0069] The processor 28 also obtains second data 40 data indicative of a fuel operation of the vessel associated with a possible allocation of the vessel to the berth 16. In some examples, the second data 40 is indicative of a predicted volume of fuel to be supplied to the vessel as part of the fuel operation associated with the possible allocation of the vessel to the berth 16. In some examples, the second data 40 can indicate that a plurality of fuel operations is associated with the possible allocation of the vessel to the berth 16. For example, a possible allocation of the vessel to the berth 16 may require a plurality of fuel operations in order to reach the berth 16 on time, and / or to reach a next scheduled terminal on time. In some examples, the second data 40 is indicative of a plurality of fuel operations of the vessel associated with a plurality of possible allocations of the vessel to the berth 16. In some examples, the second data 40 is indicative of a plurality of fuel operations, each associated with a respective possible allocation of the vessel to the berth 16. The fuel operations may comprise possible fuel operations, for example all possiblefuel operations associated with a given possible allocation of the vessel to the berth 16. The fuel operations can comprise predicted fuel operations, for example possible fuel operations that are considered likely to occur in response to a possible allocation of the vessel to the berth 16.

[0070] The processor 28 can obtain the second data 40 in a number of ways. In some examples, the processor 28 can obtain the second data 40. For example, the processor 28 can obtain the second data from a vessel fuel table that indicates daily fuel consumption for a vessel. Such fuel consumption can be indicative of an increased number of fuelling operations that are needed. In some examples, the second data 40 can comprise actual fuel consumption data, for example transmitted from the vessel to the processor 28 via the transceiver 32. In some examples, the second data 40 can be based on the first data 38, for example with the first data 38 indicating increased vessel speed necessary to reach the container terminal 10, and hence impacting on the second data 40.

[0071] The processor 28 determines the proposed allocation 50 of the vessel to one of the berths 16 based at least in part on the first data 38 and the second data 40. To do this, the processor 28 considers a plurality of possible allocations of the vessel to the berth 16 based on the first data 38 and the second data 40, and the processor 28 selects one of the plurality of possible allocations as the proposed allocation 50 based on minimising an impact of the proposed allocation 50. For example, it may be desirable to minimise fuel consumption, and so the processor 28 can select one of the possible allocations of the vessel to the berth 16 that reduces or minimises fuel consumption. In some examples, the processor 28 can solve a minimisation problem based on the first 38 and second 40 data. In some examples, the processor 28 can comprise a model, such as a machine learning model, that can take the first 38 and second 40 data as inputs, and output the proposed allocation 50 of the vessel to the berth 16.

[0072] By accounting both for the first data 38 and the second data 40, fuel consumption of the vessel may be accounted for when proposing an allocation of the vessel to the berth 16.

[0073] There are a number of possible actions that can take place in response to determination of the proposed allocation 50 of the vessel to the berth 16. In some examples, the processor 28 can cause the display device 30 to display the proposed allocation 50 of the vessel to the berth 16. By displaying the proposed vessel allocation to the berth on the display device 30, an operator of the computing system 20 may be able to analyse the proposed vessel allocation, and take appropriate action. For example, the operator of the computing system 20 may communicate, orcause communication of, the proposed allocation 50 of the vessel to the berth 16 to a crew of the vessel ahead of its arrival at the berth. The crew of the vessel may then configure the vessel for appropriate vessel operations and / or may configure the vessel so that it arrives on time with minimal fuel consumption. The operator may be able to configure resource operations of the terminal resources 18 based on the proposed vessel allocation. The operator may be able to configure crane operations of the cranes 24 based on the proposed vessel allocation. This may enable the operator to minimise energy consumption of the cranes 24.

[0074] In some examples a user can confirm, via user input to the computing system 20, the proposed allocation 50, resulting in actual allocation of the vessel to the berth 16 in a berthing plan for the container terminal 10. Such allocation of the vessel to the berth 16 can comprise any of storing the allocation in the memory 34, and displaying the allocation on the display device 30. In some examples, the user can request a redetermination of the proposed allocation 50, such as via a user input to the computing system 20. A redetermination can include determination of an alternative proposed allocation, for example based on a modified criteria forming part of the user input.

[0075] An example graphical user interface 200 that shows the proposed allocation 50 on the display device 30 is shown in Figure 3. Here the graphical user interface 200 comprises a plot of berth versus time, with a visual indicium 202 used to represent the vessel. Either side of the visual indicium 202 are boundary lines 204. The boundary lines 204 indicate potential movement of the allocation of the vessel to the berth 16 that would still enable the allocation to meet criteria, such as enabling the vessel to reach a next scheduled terminal on time.

[0076] In some examples, the proposed allocation 50 can be transmitted via the transceiver 32 to the vessel, such as in response to a user input requesting such transmission via an input to the computing system 20. In some examples, the proposed allocation 50 can be transmitted to the remote system 36 via the transceiver 32.

[0077] The processor 28 can also take further data into account when determining the proposed allocation 50 of the vessel to the berth 16.

[0078] In some examples, the processor 28 obtains third data 42 indicative of cargo carried by either or both of the vessel and a further vessel, and can determine, based at least in part on the third data 42, the proposed allocation 50 of the vessel to the berth 16. Such third data 42 can be indicative of any of a type of cargo carried by the vessel and the further vessel, whether at leastone of perishable cargo and livestock is carried by the vessel and the further vessel, and a priority of cargo carried by the at least one of the vessel and the further vessel. A priority of cargo carried by the vessel and the further vessel may be assigned to the cargo based on at least one of a type of the cargo, a value of the cargo, and an impact if an intended vessel operation performed on the cargo were to be missed or delayed. Such a vessel operation can comprise at least one of unloading the cargo from the vessel and the further vessel, loading the cargo from the vessel to the further vessel, and storing the cargo at the container terminal 10 or a further terminal for collection.

[0079] The third data 42 can be obtained from the memory 34, or from the remote system 36. For example, the third data 42 can be obtained from an inventory of the vessel or the further vessel, either directly from the vessel or the further vessel, from a previous terminal at which the vessel or the further vessel was loaded, or from the remote computing system 36.

[0080] In some examples, the processor 28 obtains fourth data 44 indicative of an impact of a possible allocation of the vessel to the berth 16 on a vessel operation of a further vessel, and can determine, based at least in part on the fourth data 44, the proposed allocation 50 of the vessel to the berth 16. The fourth data 44 can be indicative of an impact of the possible allocation of the vessel to the berth 16 on a timing of a vessel operation of the further vessel, for example on a timing of an onward journey of the further vessel to a next scheduled terminal. The fourth data 44 can be indicative of an impact of a possible allocation of the vessel to the berth 16 on at least one of loading cargo to, unloading cargo from, and cargo carried by, the further vessel. The fourth data 44 can be indicative of an impact of the possible allocation of the vessel to the berth 16 on at least one of a timing and a location of berthing of the further vessel at the terminal. The fourth data 44 can be indicative of any of an impact of the possible allocation of the vessel to the berth 16 on at least one of a loading operation of the further vessel and an unloading operation of the further vessel.

[0081] The fourth data 44 can, in some examples, be calculated based on the first data 38.

[0082] In some examples, the processor 28 obtains fifth data 46 indicative of the terminal resources 18 of the container terminal 10, and can determine, based at least in part on the fifth data 46, the proposed allocation 50 of the vessel to the berth 16.

[0083] The fifth data 46 can be indicative of any of an availability of the terminal resources 18, for example of an availability of the cranes 24, a number of a particular resource of the terminal resources 18 allocated to a vessel operation, and a resource operation of the terminal resources 18 associated with a possible allocation of the vessel to the berth 16. The fifth data 46 can be indicative of any of a timing of the resource operation of the terminal resources 18, and a start of a crane shift for unloading and / or loading cargo.

[0084] A method 100 in accordance with the above is illustrated schematically in Figure 4. The method 100 comprises obtaining 102 the first data 38 indicative of at least one of a departure time of the vessel from a previously scheduled terminal and an arrival time of the vessel at a next scheduled terminal. The method 100 comprises obtaining 104 the second data 40 indicative of a fuel operation of the vessel associated with a possible allocation of the vessel to the berth 16. The method 100 comprises obtaining 106 the third data 42 indicative of cargo carried by at least one of the vessel and a further vessel. The method 100 comprises obtaining 108 the fourth data 44 indicative of an impact of a possible allocation of the vessel to the berth 16 on a vessel operation of a further vessel. The method 100 comprises obtaining 1 10 the fifth data 46 indicative of resources at the terminal. The method 100 comprises determining 1 12, based at least in part on the first 38, second 40, third 42, fourth 44, and fifth 46, data, a proposed allocation 50 of the vessel to the berth 16. It will be appreciated that the processes of obtaining 106 the third data 42, obtaining 108 the fourth data 44, and obtaining 1 10 the fifth data 46, are optional, and this is indicated by dashed lines in Figure 4. In such circumstances, the determining 112 process is based at least in part on the first 38 and second 40 data.

[0085] When accounting for any of the first 38 through fifth 46 data, the processor 28 can apply a negative weighting factor to any of the first 48 through fifth 46 data that is indicative of any of increased fuelling operations of at least one of the vessel and a further vessel, increased fuel consumption of at least one of the vessel and a further vessel, increased cargo loss associated with at least one of the vessel and a further vessel, increased risk of missed vessel operations, increased risk of missed vessel connections for at least one of the vessel and a further vessel, increased risk of the vessel or a further vessel having a delayed arrival time at a next scheduled terminal, increased resource usage of resources of the terminal, and increased energy consumption of the terminal and / or resources thereof.

[0086] In such a manner, the proposed allocation 50 of the vessel to the berth 16 can provide for reduced fuel consumption of the vessel compared to other possible allocations of the vessel tothe berth 16, alongside decreased risk of missed vessel operations, decreased risk of cargo loss, decreased risk of missed vessel connections, decreased resource usage of the terminal resources 18, and decreased energy consumption of the container terminal 10 and the terminal resources 18.

[0087] It will be appreciated that, although described above in relation to allocation of one vessel to the berth 16, the processor 28 can equally determine berths 16 for a number of vessels, and can consider multiple berths 16 for each vessel.

[0088] In another example operation, the processor 28 determines, for a berthed vessel at the container terminal 10, a proposed allocation 350 of the cranes 24 to the berthed vessel to perform a plurality of vessel operations on the vessel within a time window. In particular, for a given berthed vessel at the container terminal 10, at least some of the cranes 24 will be required to perform unloading or loading operations for the berthed vessel. Inefficiencies in allocation of the cranes 24 can lead to increased energy consumption by the cranes 24, and the determination performed by the processor 28 can provide decreased energy consumption relative to other methods of allocating the cranes 24. Determination of the proposed allocation 350 of cranes 24 may take place subsequently to the processor 28 determining a proposed allocation 50 of the vessel to the berth 16. Such an operation is illustrated schematically in Figure 5.

[0089] It will be appreciated that here a berthed vessel here can be a current berthed vessel, or indeed a future berthed vessel, such as a vessel that has been allocated to a berth 16 by the method 100 of Figure 4. It will also be appreciated that the processor 28 can determine proposed allocations of the cranes 24 to multiple berthed vessels. The vessel operations here can correspond to a shift of the cranes 24, and can include unloading cargo from, and loading cargo to, the berthed vessel by the cranes 24 during the shift of the cranes 24.

[0090] To perform the determination, the processor 28 obtains first data 300 indicative of a status of the berthed vessel at the container terminal 10 within the time window. It will be appreciated here that the term “first data” is used as a label for the first data used in this particular determination performed by the processor 28. The first data 300 can comprise at least one of an identifier, such as a name, of the berthed vessel, a type of the berthed vessel, a size, for example a length, of the berthed vessel, a cargo capacity of the berthed vessel, a priority of the berthed vessel, a berth identifier of the berthed vessel, and a time at which the berthed vessel is berthed at the terminal. The type of the berthed vessel can comprise an indication as to whether the berthed vessel is carrying perishable cargo or livestock. The priority of the berthed vessel isindicative of a proposed ordering in which vessel operations should be carried out on the berthed vessel and a further berthed vessel at the container terminal 10.

[0091] The processor 28 can obtain the first data 300 in a number of ways. In some examples the processor 28 can obtain the first data 300 from the memory 34. In some examples, the processor 28 can submit a request for the first data 300, using the transceiver 32, from the remote system 36. For example, the processor 28 can request that the vessel transmits the first data 300, with the processor 28 receiving the first data 300 via the transceiver 32. In some examples, the first data 300 can be obtained from an actual allocation, or a proposed allocation 50, of the berthed vessel to the container terminal 10, such as an allocation obtained by the method 100 of Figure 4.

[0092] The processor 28 obtains second data 302 indicative of cargo associated with the plurality of vessel operations to be performed within the time window. The second data 302 can be indicative of a volume of cargo associated with the plurality of vessel operations, such as a total volume of cargo associated with the plurality of vessel operations, and a respective volume of cargo associated with each of the plurality of vessel operations.

[0093] The processor 28 can obtain the second data 302 in a number of ways. In some examples the processor 28 can obtain the second data 302 from the memory 34. In some examples, the processor 28 can submit a request for the second data 302, using the transceiver 32, from the remote system 36. For example, the processor 28 can request that the vessel transmits the second data 302, with the processor 28 receiving the second data 302 via the transceiver 32. In some examples, the second data 302 can be obtained from an actual allocation, or a proposed allocation 50, of the berthed vessel to the container terminal 10, such as an allocation obtained by the method 100 of Figure 4.

[0094] The processor 28 obtains third data 304 indicative of a number of the cranes 24 required to perform the plurality of vessel operations within the time window on the berthed vessel. The third data 304 can be indicative of any of a total number of cranes 24 required to perform the plurality of vessel operations within the time window, and a number of cranes 24 required to perform each respective vessel operation of the plurality of vessel operations within the time window.

[0095] The processor 28 can obtain the third data 304 in a number of ways. In some examples the processor 28 can obtain the third data 304 from the memory 34. In some examples, the thirddata 304 can be obtained from an actual allocation, or a proposed allocation 50, of the berthed vessel to the container terminal 10, such as an allocation obtained by the method 100 of Figure 4. In some examples, the processor 28 can calculate the third data 304 based at least in part on the first data 300 and the second data 302.

[0096] The processor 28 obtains fourth data 306 indicative of a status of the cranes 24 within the time window. The fourth data 304 can be indicative of any of whether at least one of the cranes 24 will be available to perform at least one of the plurality of vessel operations within the time window, whether each of the cranes 24 will be available to perform at least one of the plurality of vessel operations within the time window, and whether any of the cranes 24 is scheduled to be undergoing maintenance and / or downtime within the time window. The fourth data 304 can be indicative of any of whether a crane 24 that is intended to be allocated to the berthed vessel in a possible allocation of the cranes 24 to the berthed vessel is, or would be, missing from the possible allocation, and whether a crane 24 that is intended to be allocated to the berthed vessel in a possible allocation of the cranes 24 to the berthed vessel is, or would be, assigned to a further berthed vessel during the time window.

[0097] The fourth data 306 can also be indicative of whether a first crane 24 that is intended to be allocated to the berthed vessel in a possible allocation of the cranes 24 to the berthed vessel, will be idle for more than a pre-determined period during at least some of the plurality of vessel operations, with the first crane 24 being located between two other cranes 24 that are intended to be allocated to the berthed vessel in the possible allocation of the cranes 24 to the berthed vessel.

[0098] The processor 28 can obtain the fourth data 306 in a number of ways. In some examples the processor 28 can obtain the fourth data 306 from the memory 34. In some examples the processor 28 can obtain the fourth data 306 from the cranes 24. In some examples, the processor 28 can calculate the fourth data 306 based at least in part on data obtained from the memory 34 and / or on data obtained from the cranes 24.

[0099] The processor 28 obtains fifth data 308 indicative of a relative positioning of at least one of the cranes 24 to the berthed vessel within the time window. The fifth data 308 can be indicative of any of a reach of the cranes 24 to the berthed vessel during a possible allocation of the cranes 24 to the berthed vessel, a relative position of the crane 24 to the berthed vessel prior to a start of a vessel operation of a possible allocation of the cranes 24 to the berthed vessel, whether thecrane 24 is required to move from a start position prior to the vessel operation to perform the vessel operation, a number of movements the crane 24 is required to make to be able to perform a plurality of vessel operations associated with a possible allocation of the cranes 24 to the berthed vessel, and whether one of the cranes 24, associated with a possible allocation of the cranes 24 to a further vessel located on a first side of a further one of the cranes 24 intended to be allocated to the vessel, is located on a second opposite side of the further one of the cranes 24 intended to be allocated to the vessel. For the latter, it will be appreciated that as the cranes 24 are disposed in a fixed order along the rails 22, crossover of cranes 24 to perform the vessel operations cannot occur, and hence possible allocations indicating such crossover should be penalised.

[0100] The processor 28 determines the proposed allocation 350 of the cranes 24 to the berthed vessel based at least in part on the first 300 through fifth 308 data. To do this, the processor 28 can consider a plurality of possible allocations of the cranes 24 to the berthed vessel based on the first 300 through fifth 308 data, and the processor 28 can select one of the plurality of possible allocations as the proposed allocation 350 based on minimising an impact of the proposed allocation 350. For example, it may be desirable to minimise energy consumption, and so the processor 28 can select one of the possible allocations of the cranes 24 to the berthed vessel that reduces or minimises energy consumption.

[0101] In some examples, the processor 28 can solve a minimisation problem based on the first 300 through fifth 308 data. In some examples, the processor 28 can comprise a model, such as a machine learning model, that can take the first 300 through fifth 308 data as inputs, and output the proposed allocation 350 of the cranes 24 to the berthed vessel.

[0102] When performing the determination of the proposed allocation 350 of the cranes 24 to the berthed vessel, the processor 28 assigns negative weighting factors to certain aspects of the first 300 through fifth 308 data. Exemplary such scenarios that are associated with negative weighting factors are described briefly below.

[0103] Where the fourth data 306 is indicative that a crane 24 will not be operational within the time window, for example that a crane 24 will not be operational for at least some of the vessel operations within the time window, a negative weighting factor is applied to the fourth data 306. Where the fourth data 306 indicates that a crane 24 will be undergoing maintenance and / or downtime within the time window, a negative weighting factor is applied to the fourth data 306.

[0104] Where the fourth data 306 indicates that a crane 24 that is intended to be allocated to the berthed vessel in a possible allocation of the cranes 24 to the berthed vessel cannot actually be assigned as part of the possible allocation, a negative weighting factor is applied to the fourth data 306. Where the fourth data 306 is indicative that the crane 24 is, or would be, assigned to a further berthed vessel during the time window, a negative weighting factor is applied to the fourth data 306. Where the fourth data 306 is indicative that the crane 24 will be idle during at least some of the plurality of vessel operations, a negative weighting factor is applied to the fourth data 306.

[0105] Where the fifth data 308 indicates that a crane 24 does not have full reach to the vessel, a negative weighting factor is applied to the fifth data 308, with the negative weighting factor increasing as the reach to the vessel decreases. Where the fifth data 308 indicates that a crane 28 is required to move a distance above a pre-determined threshold from its respective relative start position to be able to perform a vessel operation of the plurality of vessel operations, a negative weighting factor is applied to the fifth data 308. In some examples the pre-determined threshold is zero, and the negative weighting factor can be scaled based on how far from its start position the crane 24 is required to move to perform the vessel operation, for example with the negative weighting factor increasing as the distance from the start position increases.

[0106] Where the fifth data 308 indicates that the crane 24 is required to move more than a predetermined number of movements to be able to perform the plurality of vessel operations associated with a possible allocation of the crane 24 to the berthed vessel, a negative weighting factor is applied to the fifth data 308. In some examples, the pre-determined number of movements is zero, and the negative weighting factor is scaled based on how many movements are required to be able to perform the plurality of vessel operations associated with a possible allocation of the cranes 24 to the berthed vessel, for example with the negative weighting factor increasing as the number of movements increases.

[0107] Where the fifth data 308 indicates that one of the cranes 24, associated with a possible allocation of the cranes 24 to a further vessel located on a first side of a further one of the cranes 24 intended to be allocated to the vessel, is located on a second opposite side of the further one of the cranes 24 intended to be allocated to the vessel, a negative weighting factor is applied to the fifth data 308.

[0108] There are a number of possible actions that can take place in response to determination of the proposed allocation 350 of the cranes 24 to the berthed vessel. In some examples, the processor 28 can cause the display device 30 to display the proposed allocation 350 of the cranes 24 to the berthed vessel. By displaying the proposed crane allocation 350 on the display device 30, an operator of the computing system 20 may be able to analyse the proposed crane allocation, and take appropriate action. For example, the operator of the computing system 20 may communicate, or cause communication of, the proposed allocation 350 of the cranes to a crew of the vessel ahead of its arrival at the berth. The crew of the vessel may then configure the vessel for appropriate vessel operations. The operator may be able to configure resource operations of the terminal resources 18 based on the proposed vessel allocation. The operator may be able to configure crane operations of the cranes 24 based on the proposed vessel allocation. This may enable the operator to minimise energy consumption of the cranes 24.

[0109] In some examples a user can confirm, via user input to the computing system 20, the proposed allocation 350, resulting in actual allocation of the cranes 24 to the berthed vessel in a plan for operations of the cranes 24 at the container terminal 10. Such allocation of the cranes 24 can comprise any of storing the allocation in the memory 34, and displaying the allocation on the display device 30. In some examples, the user can request a redetermination of the proposed allocation 350, such as via a user input to the computing system 20.

[0110] In some examples, the processor 28 automatically causes a controller or controllers of the cranes 24 to cause movement of the cranes 24 along the rails 22. In some examples, the processor 28 causes, in response to a user input to the computing system 20, a controller or controllers of the cranes 24 to cause movement of the cranes 24 along the rails 22.

[0111] A method 400 in accordance with the above is illustrated schematically in Figure 6. The method 400 comprises obtaining 402 the first data 300 indicative of a status of the berthed vessel at the container terminal 10 within the time window. The method 400 comprises obtaining 404 the second data 302 indicative of cargo associated with the plurality of vessel operations to be performed within the time window. The method 400 comprises obtaining 406 the third data 304 indicative of a number of the cranes 24 required to perform the plurality of vessel operations within the time window on the berthed vessel. The method 400 comprises obtaining 408 the fourth data 306 indicative of a status of the cranes 24 within the time window. The method 400 comprises obtaining 410 the fifth data 308 indicative of a relative positioning of at least one of the cranes 24 to the berthed vessel within the time window. The method 400 comprises determining 412, basedat least in part on the first 300, second 302, third 304, fourth 306, and fifth 308, data, a proposed allocation 350 of the cranes 24 to the berthed vessel.

[0112] By accounting for the first 300 through fifth 308 data when determining the proposed allocation 350 of the cranes 24 to the berthed vessel to perform the plurality of vessel operations on the vessel within the time window, energy consumption associated with performing the plurality of vessel operations on the berthed vessel within the time window may be reduced. For example, the first 300 through third 304 data may enable an accurate picture to be provided of the resources needed to perform the plurality of vessel operations within the time window, whilst the fourth 306 and fifth 308 data may enable provision of such resources whilst minimising energy consumption associated with performing the plurality of vessel operations on the berthed vessel within the time window.

[0113] It will be appreciated that container terminals 10 where the processor 28 performs only one of the method 100 of Figure 4 and the method 400 of Figure 6 are also envisaged.

[0114] Example embodiments of the present invention have been discussed, with particular reference to the examples illustrated. However, it will be appreciated that variations and modifications may be made without departing from the scope of the invention as defined by the appended claims.

Claims

CLAIMS:

1. A computer-implemented method of determining, for a berthed vessel at a terminal comprising a plurality of cranes disposed along a crane conveyance system, a proposed allocation of the plurality of cranes to the berthed vessel to perform a plurality of vessel operations on the vessel within a time window, wherein the determining is based at least in part on: first data indicative of a status of the berthed vessel at the terminal within the time window; second data indicative of cargo associated with the plurality of vessel operations to be performed within the time window; third data indicative of a number of the plurality of cranes required to perform the plurality of vessel operations within the time window on the berthed vessel; fourth data indicative of a status of the plurality of cranes within the time window; and fifth data indicative of a relative positioning of at least one of the plurality of cranes to the berthed vessel within the time window.

2. A computer-implemented method as claimed in Claim 1 , wherein the fourth data is indicative of whether at least one of the plurality of cranes will be available to perform at least one of the plurality of vessel operations within the time window.

3. A computer-implemented method as claimed in Claim 1 or Claim 2, wherein the fourth data is indicative of whether a crane of the plurality of cranes is scheduled to be undergoing maintenance and / or downtime within the time window.

4. A computer-implemented method as claimed in any one of the preceding claims, wherein the fourth data is indicative of whether a crane of the plurality of cranes that is intended to be allocated to the berthed vessel in a possible allocation of the plurality of cranes to the berthed vessel, said crane being located intermediate any two other cranes of the plurality of cranes that are intended to be allocated to the berthed vessel in the possible allocation of the plurality of cranes to the berthed vessel, will be idle for more than a pre-determined period during at least some of the plurality of vessel operations.

5. A computer-implemented method as claimed in any one of the preceding claims, wherein the fifth data is indicative of a reach of the at least one crane of the plurality of cranes to theberthed vessel during a possible allocation of the at least one of the plurality of cranes to the berthed vessel.

6. A computer-implemented method as claimed in any one of the preceding claims, wherein the fifth data is indicative of a relative position of the at least one of the plurality of cranes to the berthed vessel prior to a start of a vessel operation of a possible allocation of the plurality of cranes to the berthed vessel.

7. A computer-implemented method as claimed in any one of the preceding claims, wherein the fifth data is indicative of whether the at least one of the plurality of cranes is required to move from a start position prior to the vessel operation to perform the vessel operation8. A computer-implemented method as claimed in any one of the preceding claims, wherein the fifth data is indicative of a number of movements the at least one of the plurality of cranes is required to make to be able to perform a plurality of vessel operations associated with a possible allocation of the at least one of the plurality of cranes to the berthed vessel.

9. A computer-implemented method as claimed in any one of the preceding claims, wherein the fifth data is indicative of whether one of the plurality of cranes, associated with a possible allocation of the plurality of cranes to a further vessel located on a first side of a further one of the plurality of cranes intended to be allocated to the vessel, is located on a second opposite side of the further one of the plurality of cranes intended to be allocated to the vessel.

10. A computer-implemented method as claimed in any one of the preceding claims, wherein the computer-implemented method comprises displaying, on a display device, the proposed allocation of the plurality of cranes to the berthed vessel.

11. The computer-implemented method according to any one of the preceding claims, wherein the determining the proposed allocation of the plurality of cranes to the berthed vessel to perform the plurality of vessel operations on the berthed vessel within the time window comprises selecting one a plurality of possible allocations of the plurality of cranes to the berthed vessel based at least in part on the first, second, third, fourth, and fifth data.

12. A computer-implemented method according to any one of the preceding claims, wherein the computer-implemented method comprises causing a controller of at least one of the craneconveyance system and the plurality of cranes to cause movement of one or more of the plurality of cranes along the crane conveyance system.

13. A computing system comprising one or more processors configured to perform the computer-implemented method according to any one of the preceding claims.

14. A data carrier comprising machine readable instructions for the operation of one or more processors of the computing system according to Claim 13 to perform the computer-implemented method according to any one of Claims 1 to 12.

15. A computer program comprising instructions which, when the program is executed by a computing system, cause the computing system to carry out the computer-implemented method of any one of Claims 1 to 12.

Images