2026-10-16T08:42:36Z https://data.mendeley.com/oai

oai:data.mendeley.com/pt8dydr77x.1 2026-08-28T09:56:21Z

Leloup, Emeline Three-dimensional loading vehicle routing problem with split pickups and time windows (3L-SPVRP-TW) - model: codes, instances and results Mendeley Data This folder provides 1. Code 2. Instances The instances are built on the benchmark from Leloup et al. (2025). 3. Results • MILP_....xlsx provide the results related to the different MILP (noMIPStart= no initial solution provided) • I&F_StratID_FixedVariables....xlsx provide the results related to the different parameters setting of the I&F • I&F_bestAllParamSettings.xlsx provides the results of the best solution in terms of cost obtained with all parameters settings of the I\&F, along with the values of the 3PH (#vehicles, total travel distance, cost) 4. Solutions contains the solutions (routes, loading, schedule) for the different tests • MILP (without initial solution, with/without split, with/without stability, and with/without reachability) • I&F (with the first and second strategies (Strat1 and Strat2) and the precedence relationship fixed (GammaOmega vs Gamma)) and the number of rented vehicles Vr • 3PH README files with more information are included in the “Solutions” folder. Leloup, E., C. Paquay, T. Pironet, and J. F. Oliveira (2025). A three-phase algorithm for the three-dimensional loading vehicle routing problem with split pickups and time windows. European Journal of Operational Research 323 (1), 45–61. Vehicle Routing Problem Packing Problem Paquay, Celia PIRONET, Thierry Dataset doi:10.17632/pt8dydr77x.1 oai:data.mendeley.com/pt8dydr77x.1 Creative Commons Attribution 4.0 International http://creativecommons.org/licenses/by/4.0 https://data.mendeley.com/datasets/pt8dydr77x 2026-08-28T09:56:21Z