Detailed results and solutions for the 3L-CVRP

This dataset contains the detailed computational results and best solutions obtained in the study “Logic-based Benders decomposition for the three-dimensional loading capacitated vehicle routing problem with time windows.” The data include benchmark instances from the literature and the corresponding solutions generated by the proposed mathematical formulations and decomposition approaches.

The repository is organized as follows:

Folders “Gendreau et al. (2006)”, “Kuçuk and Yildiz (2022)”, and “Moura and Oliveira (2009)”: contain the best solutions obtained for each instance, including both vehicle routes and the three-dimensional placement of boxes inside the containers.

File “Detailed Results”: provides complete computational results for all experiments performed in the study. Each worksheet corresponds to a set of benchmark instances and reports the following information:

- Objective value of the solution.
- Lower bound computed by Gurobi (“lb”).
- Number of undefined solutions with objective values below the incumbent (“ns”).
- Value of the best undefined solution (“vs”).
- Optimality gap between the integer solution and the minimum of “lb” and “vs.”
- Total runtime in seconds.