README

This executable solves instances derived from the industrial and tramp ship routing and scheduling problems, based on the modified instances presented by Fukasawa et al. (2018).
The solution method is a Branch-and-Price algorithm, implemented following the work of Tolga Bektaş and Stefan Schaudt.

Requirements

To run the executable, you need the SCIP Optimization Suite 6.0.1 dynamic library file placed in the same folder as the executable.

Running the Program

The executable is started with a command file.
An example command file is included.

Instance Format

The algorithm reads input instances in the following format:

Instance Format

The algorithm reads input instances in the following format:
[@number of customers@,@ship capacity *10@,@not needed@,@minSpeed@,@maxSpeed@]
[@demand depot@,@demand customer@]
[@lower time window bound depot@,@lower time window bound customer@]
[@upper time window bound depot@,@upper time window bound customer@]
[@service time depot@,@service time customer@]
[[@dist matrix@]]
An example instance file is provided.
