Data for the hub location-routing problem (HLRP) with distinct collection and delivery tours

The instances are generated for the hub location-routing problem (HLRP) with separate collection and delivery processes. There are three types of nodes: potential hubs, suppliers and clients. The distances between non-hub nodes are extracted from the AP data set. Hubs may be located at the same geographical position as suppliers or clients. The flows (in tons) for each origin-destination (O-D) pair have been generated uniformly within the interval [0.15, 1.0] in order to be consistent with the capacity of the vehicles (15 tons). 27 instances are generated, with up to 100 non-hub nodes (50 suppliers and 50 clients) and 10 potential hub nodes. The number of potential hubs: 3, 6,10; the number of suppliers/clients: 10, 15, 20, 25, 30, 35, 40, 45, 50. The structure of the data file can be found in the file of introduction.

本数据集针对带分离式集货与配送流程的枢纽位置-路径问题（hub location-routing problem, HLRP）生成实例。数据集包含三类节点：潜在枢纽节点、供应商节点与客户节点。非枢纽节点间的距离提取自AP数据集。枢纽节点可与供应商或客户节点位于同一地理位置。各起讫点（origin-destination, O-D）对的货物流量（单位：吨）在区间[0.15, 1.0]内均匀生成，以匹配车辆额定载货量（15吨）。本次共生成27组实例，每组实例最多包含100个非枢纽节点（50个供应商与50个客户）及10个潜在枢纽节点。潜在枢纽节点数可选3、6、10；供应商/客户节点数可选10、15、20、25、30、35、40、45、50。数据文件的结构可参考介绍文档。