Data Set for Optimization of Electric Vehicle Recharge Schedule and Routing Problem with Time Windows and Partial Recharge: A Comparative Study for an Urban Logistics Fleet

Published: 04-01-2021| Version 1 | DOI: 10.17632/zr5x7h25r3.1
Contributors:
Uğur Baç,
Mehmet Erdem

Description

These data used to test VNS and VND optimization heuristics in paper titled "Optimization of Electric Vehicle Recharge Schedule and Routing Problem with Time Windows and Partial Recharge: A Comparative Study for an Urban Logistics Fleet". Data shared here includes small and large size instances for the optimization problem of electric vehicle routing problem with time windows and partial recharge (EWRPTW-PR) opportunities. Each instance includes different numbers of electric vehicles (EVs) used, customers (C), visits required by customers (V), depots (D), recharging stations (S). Size specification of data sets is given in "Specifications of data set.xlsx" file. Data is generated for different types of EVs with different load capacities, different battery capacities with different charging times, different travel times considering distance, speed and current random load. Provided data set can be used to test the effectiveness an efficiency of different vehicle routing algorithms designed for electric vehicles. Additionally, provided data is suitable for a comparison of heuristics with exact optimization methods.

Files