Three-dimensional loading vehicle routing problem with split pickups and time windows (3L-SPVRP-TW): instances and results

Published: 29 November 2024| Version 1 | DOI: 10.17632/y9rf4nj7rd.1
Contributors:
Emeline Leloup, Celia Paquay, Thierry Pironet, José Fernando Oliveira

Description

This folder provides instances for a three-dimensional loading vehicle routing problem with split pickups and time windows (3L-SPVRP-TW) as well as results obtained with a three-phase heuristic. The 240 instances are built on the benchmark from Krebs et al. (2021) adding real features extracted from our survey among Belgian service providers. To have more information about the instances, please refer to the README file included in the "PracticalInstances" folder. The folder "ResultsInstancesKrebs" contains the solutions provided by the three-phase heuristic on the instances from Krebs et al. (2021), while the folder "ResultsPracticalInstances" contains the solutions provided by the three-phase heuristic on the 240 practical instances presented hereabove. In both folder, each solution starts with the name of the instance. In "ResultsInstancesKrebs", we give the repetition identification (15 runs per instance, called “Rep”), and the constraint set as referenced by Krebs in her Github. In "ResultsPracticalInstances”, we write the information about the number of customer’s shifts (2 or 4), the constraints considered (split or not, reachability or sequential loading), the EPs’ selection criterion (TDLF or DBLF) and the speed during the peak and off-peak hours. In both files, we then provide the number of used vehicles in the solution, the total cost (penalty + travel distance), the computation time (in ms) as well as the number of iterations in the GVNS. Next, each route is described with the sequence of customers and the arrival and departure times associated to each of them. Finally, the loading pattern in the vehicle is given (customer id, box type, Boolean stating if the box is rotated, the location of the front left bottom, the characteristics of the box, namely the length, width, height and mass). The file “SummaryResultsPracticalInstances.csv” contains the total travel distance, the number of vehicles in the solution and the computational time (in seconds) for the 240 practical instances. Krebs C, Ehmke JF, (2021). Axle Weights in combined Vehicle Routing and Container Loading Problems. EURO Journal on Transportation and Logistics, Volume 10, ISSN 2192-4376, DOI: 10.1016/j.ejtl.2021.100043, URL https://www.sciencedirect.com/science/article/pii/S2192437621000157

Files

Institutions

HEC-ULg Ecole de Gestion de l'Universite de Liege, Universidade do Porto Faculdade de Engenharia

Categories

Vehicle Routing Problem, Packing Problem

Licence