README
This executable solves instances of the Pollution Routing Problem (PRP) using a Branch-and-Price algorithm.
The implementation is based on 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:
@number of customers@

@not needed@ @vehicle capacity@

@not needed@ @not needed@

@distance matrix@

@depot id@ @depot name@ @demand@ @lower time window bound@ @upper time window bound@ @service time@

@customer id@ @customer name@ @demand@ @lower time window bound@ @upper time window bound@ @service time@

An example instance file is provided.