Dataset, CPLEX code of the Electric Vehicle Routing Problem with Time Windows, Simultaneous Pickup and Deliveries (EVRP-TW-SPD) based on the paper titled "Application of CMSA to the Electric Vehicle Routing Problem with Time Windows, Simultaneous Pickup and Deliveries, and Partial Vehicle Charging" (Akbay et al, 2022).
We generate EVRP-TW-SPD dataset and CPLEX 20.1 verification.
As stated in the paper of Akbay et al (2022), EVRP-TW-SPD dataset is generated based on the EVRP-TW problem instances introduced by the paper titled "The electric vehicle-routing problem with time windows and recharging stations" (Schneider et al, 2014), where the delivery demand of each customer was separated into a delivery and a pickup demand by using the approach from the paper titled "A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling" (Salhi et al, 1999).
EVRP-TW-SPD dataset instances generator is implemented in Python.
To verify the correctness of EVRP-TW-SPD dataset generation, we give CPLEX code to compare its verification results with corresponding numerical results in the paper of Akbay et al (2022). For simplicity, this CPLEX code is based on https://github.com/0SliverBullet/E-VRPTW, where we set three copies as dummy vertex for each charging station in .dat files. Verification was performed on a Personal Computer with 11th Gen Intel (R) Core (TM) i5-1135G7 CPU with 8 cores of 2.40GHz and a minimum of 16 GB RAM. CPLEX version 20.1 was used in one-threaded mode, the same as the configuration in the paper of Akbay et al (2022).
Computational results of CPLEX 20.1 verification for small-sized instances with 5 customers are shown as follows:
where m denotes the vehicle number, best denotes the optimal objective values, time denotes the total run-time in seconds, gap is calculated as
CPLEX 20.1 verification conclusion: computational results in the EVRP-TW-SPD dataset generated using Akbay et al.'s (2022) approach align with those of the dataset actually used in the same paper, indicating the correctness of the EVRP-TW-SPD dataset generation.
the original EVRP-TW-SPD Instances used in Akbay et al.'s (2022) can be seen in https://github.com/manilakbay/EVRP-TW-SPD-Instances, which is updated on Apr 25. The difference between the original EVRP-TW-SPD Instances and the generated EVRP-TW-SPD Instances in this repository is that when calculating the delivery value, we reserve the float value , whereas the dataset used in the original paper of Akbay et al.'s (2022) automatically reserve the integer part (directly truncating the decimal part). We will delete this repository later soon.
- Akbay, M. A., Kalayci, C. B., & Blum, C. (2022). Application of cmsa to the electric vehicle routing problem with time windows, simultaneous pickup and deliveries, and partial vehicle charging. In Metaheuristics International Conference (pp. 1-16). Cham: Springer International Publishing.
- Schneider, M., Stenger, A., & Goeke, D. (2014). The electric vehicle-routing problem with time windows and recharging stations. Transportation science, 48(4), 500-520.
- Salhi, S., & Nagy, G. (1999). A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling. Journal of the operational Research Society, 50, 1034-1042.