Dataset about real instances for truck and drone problem in Boujnord city

in this data set, we presented a real instance for the two-echelon truck and drone routing problem. this data set is for a well known company in iran, and the data is for Boujnord city. for the maximum size, we choosed 300 locations of customers and 300 locations for parking stations and from this large-sized instance, we made 35 instances. The set conntains, demand of two kinds of customers including drone delivery clients and alternaatie delivery clients. distance between each pair of locations, and starting time of traffic peak between each pair of parking stations. this data is prepared for the time-dependent two-echelon truck and drone routing problem, where the truck can only stops at parking stations and it cannot stop at customers locations. a readme file in the data set describ the model elaboratly. <br>

本数据集提供了两层卡车-无人机路径规划问题的真实算例。该数据集面向伊朗一家知名企业，数据采集自博季努尔德市（Boujnord）。针对最大规模场景，我们选取了300个客户点位与300个停靠站点点位，并基于该大型算例生成了35个子算例。该数据集包含两类客户的需求数据：无人机配送客户与备选配送客户，各点位间的距离数据，以及每对停靠站点间的交通高峰起始时间数据。本数据集专为时变两层卡车-无人机路径规划问题设计，该问题中卡车仅可停靠于停靠站点，不得直接停靠于客户点位。数据集内附带的README文件将对该模型进行详细阐述。