Results and Comparison of Results for the Pollution Routing Problem

The file contains the detailed results for individual PRP instances in sets A, B and C as described in the main body of text.  In the tables that follow, the first column denotes the instance name (Inst.), followed by the number of vehicles (V), the best upper bound (BUB), the solution time (T) (tl = time limit), and the percentage gap (G %)(- means that no feasible solution has been found).
We additionally present, for each set, a table that compares the results obtained with the BaP algorithm to the results of the BCP algorithm of Fukasawa et al. (2017, 2018).
Note that in the comparisons the number of vehicles is not part of the optimisation.
Therefore, all results for the PRP are computed twice, one with an optimised number of vehicles and one with a fixed number.