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

Published: 28 June 2018| Version 1 | DOI: 10.17632/7skb555yz4.1
Contributors:
Xiao YANG,
Nathalie Bostel,
Pierre Dejax

Description

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.

Files

Categories

Facility Location

License