General Information
This page comprises supplementary test instances for quay partitioning problem (QPP).
The QPP consists in partitioning a quay of length Q, such that
for a given stream of n arriving ships mean weighted completion time is
minimum.
Berth lengths can be chosen from a set of f different values
lambda_1,...,lambda_f.
The coming ships parameters are given:
• number of the ship arrivals n,
• ship ready times, r_j,
• ship processing times, p_j,
• ship lengths, L_j,
• ship importance (or value, weight), w_j,
for j=1,...,n.
Test Instances
Except for Le Havre instances in Large-and-LeHavre.zip (see below),
the test instances are synthetic, in this sense that they do not represent
real ship traffic.
Instance File Format
Instance files are text files with data in the following order:
- 1st line: instance name
- 2nd line: Q f
- 3nd line: lambda_1,...,lambda_f
- 4th line: n
- 5th line: p_1,...,p_n
- 6th line: r_1,...,r_n
- 7th line: w_1,...,w_n
- 8th line: L_1,...,L_n
The instances are collected in the following files
| # | instances | comments |
|---|---|---|
| 1. | qpp-timing-vs-n.ZIP | timing tests for changing n |
| 2. | qpp-timing-vs-f.ZIP | timing tests for changing f |
| 3. | qpp-timing-vs-Q.zip | timing tests for changing Q |
| 4. | qpp-mix3.zip | tests of ship size mixing impact on the selected berth sizes |
| 5. | qpp-Flexible-vs-OneLong.ZIP | tests of one long berth size vs flexible choice of berth sizes |
| 6. | Large-and-LeHavre.zip | large instances with sizes n=25,50,75,100 and LeHavre traffic examples |