Dataset and Computational Experiment Results for "Dual-Driven Path Elimination for Vehicle Routing with Idle Times and Arrival-Time Consistency"

This repository contains all input and output files associated with the computational experiments described in the article: Jorge Riera-Ledesma, Inmaculada Rodríguez-Martín, Hipólito Hernández–Pérez,Dual-driven path elimination for vehicle routing with idle times and arrival-time consistency,Computers & Operations Research,2025,107326,https://doi.org/10.1016/j.cor.2025.107326. Computational Environment All algorithms were implemented in C++ and compiled with gcc version 13.3.0 on Ubuntu 24.04 LTS, using the -O2 optimization flag. Experiments were executed on a single core of an Intel Core i5-7500 processor with 20 GB RAM. The CPLEX 22.1 solver (via its callable library) was used to solve the branch-and-cut implementations. A time limit of 7200 seconds was imposed for each instance, replicating the computational setup adopted in: A Decomposition Algorithm for the Consistent Traveling Salesman Problem with Vehicle Idling,Anirudh Subramanyam and Chrysanthos E. Gounaris, Transportation Science (2018), 52(2), 386–401.