Erratum: A guided tabu search for the heterogeneous vehicle routeing problem

Correction to: Journal of the Operational Research Society doi:10.1057/palgrave.jors.2602504

Further examination on the heterogeneous fixed fleet vehicle routeing problem (HFFVRP) revealed an error on the solution reported for the benchmark Problem 13 with the fleet configuration FC_G. This error was caused by inappropriately accessing the benchmark instance file. We would like to apologize for any inconvenience caused by the aforementioned oversight.

The GTS algorithm was applied again for the benchmark Problem 13 with the FC_G fleet configuration. The cost of the best solution obtained is equal to 1491.86, and not 1461.24 as reported in the first row of Table 6. The CPU time required for generating the best solution is 53 s. Following this, the GTS method produced four new best solutions and reached the solution quality achieved by the LBTA in all four of the other benchmark instances with the FC_G fleet configuration.

The analytic solution of Problem 13 with the FC_G fleet configuration is provided in the corrected version of Table B-1. Furthermore, the structures of the solutions are illustrated in the corrected version of Figure 8. Note that only the solution shape of Problem 13 has changed.

Table 1 Analytic solution of benchmark Problem 13, with the FC_G fleet configuration

Figure 8

GTS solutions for the examined benchmark instances with the FC_G fleet configuration.