Electric Vehicle Routing with Time Windows and Heterogeneous Charging-Station Attribute Dataset

Abstract

This paper describes the benchmark dataset for the electric vehicle routing problem with time windows. It is designed to facilitate the large-scale and reproducible evaluation of routing approaches under diverse charging scenarios. It is an extension of the Homberger 1000-customer vehicle-routing benchmark dataset through the incorporation of computationally derived charging-station data. For the 60 base instances included in the dataset, charging-station locations are randomly generated within the customer-coordinate bounds, and two variants are provided, resulting in 120 benchmark problems used in the validation and baseline analyses. A normalized local customer-density score is derived for each station. It is used to determine charging rates and log-normal parameters for prices and waiting times. Two variants are included in the dataset. Variant A maintains the original customer time-window constraints, while Variant B relaxes customer due dates based on the distance from the depot, subject to the depot closing time. The dataset is complemented by instance files, station attributes, parameters, and scripts. It also includes the results of feasibility tests, baseline solver tests, difficulty analyses, and sensitivity tests. These results show that the benchmark includes both easier and harder instance classes under different charging settings. Overall, the dataset is intended to support its use as a reproducible benchmark.