Each file consists of 20 vessels (or ships) described one per line. The data of a vessel is represented by a sequence of integers separated by semi-colons.

• id;l;a;m;p;nh;h₁;h₂;...;h_nh;

• id: number of the vessel.
• l: length of the vessel.
• a: arrival time of the vessel.
• m: movements (or containers) to be unloaded/loaded.
• p: priority of the vessel (1 ≤ p ≤ 10 where 10 is the highest priority, and 1 is the lowest one).
• nh: number of holds in this vessel.
• The following <nh> numbers (h_i, 1 ≤ i ≤ nh) indicate the number of movs in each hold.

Restrictions and assumptions considered:

• Quay length: 700 meters
• There is a safe distance (safeLength) between two moored vessels. We assume 5% of the length of the vessels:
  • ceil(5% of its length vessel)
• Available Quay Cranes: 7
• The maximum number of assigned QCs by a vessel depends on its length, since a safe distance is required be tween two contiguous QCs (35 meters), and the maximum number of QCs that the container terminal allows per vessel (5 QC). Both parameters are given by the container terminal.
  • min(5, floor(length/35) )
• Movements of the Quay Crane per time unit: 25 movs/t.u.

More details in the following article:

• Rodriguez-Molins, M. and Salido, M.A. and Barber, F.. A GRASP-based Metaheuristic for the Berth Allocation Problem and the Quay Crane Assignment Problem by Managing Vessel Cargo Holds. In Applied Intelligence, Springer US, 40(2), 273--290 (2014). DOI: 10.1007/s10489-013-0462-4