An instance of the BAP Partitioning Problem is specified by three files as described below:
| Input File | Description |
| info on the sections: number of sections, section lengths, and intersection distances. (Note: section 0 is a virtual section.) | |
| info on the vessels: number of vessels, vessel ids, lengths, arrival times, departure times. (Note: vessel 0 is a virtual vessel.) | |
|
a list of container transshipments in the form
"source vessel" "destination vessel" "#containers". |
In our simplified formulation, the arrival and departure times are given as integers in the range [0..W] where W is the length of the "planning window" for the problem.
The following BAP data sets should be used to test your algorithms. They consists of instances that are:
[Note: Some of the info in the comments headers of these datafiles, (such as filenames, prefix paths) may NOT match the actual datafiles. But these are comments and do NOT affect the running of the programs.]
1 sect001.dat ves001.dat trans001.dat 2 sect002.dat ves002.dat trans002.dat 3 sect003.dat ves003.dat trans003.dat 4 sect004.dat ves004.dat trans004.dat