Data for the multi-depot vehicle routing problem with profit fairness

This data is generated in order to investigate the multi-depot vehicle routing problem with profit fairness (MDVRP-PF), a bi-objective optimization problem that adds a fairness objective function to the classical cost minimization function. By studying the MDVRP-PF , we explore the effects of integrating fairness in the optimization process.In order to perform the desired experiments, artifcial MDVRP-PF instances are generated. These instances represent different configurations that could be suitable for carrier coalitions, especially with respect to customer locations and stand-alone revenue share of each carrier. In this sense, we differentiate between two types of customer locations (clustered vs. uniform) and two types of initial revenue share distribution (balanced vs. unbalanced). In clustered instances customers are placed closer to the depots of the carriers, while being randomly located in the uniform type. Both types represent possible realistic situations, where partners are located in different distant industrial/commercial regions or within the same urban area. Regarding revenue share, in balanced instances, all carriers contribute a similar amount of revenue. Contrarily, in unbalanced instances, notable differences exist in the initial revenues contributed by each carrier. For each pair of location-revenue share configurations (from now on coded as C B, C U, U B and U U), we generate a set of instances. Each set contains three instances of different sizes: 2 depots and 100 customers (2D 100C), three depots and 150 customers (3D 150C), and four depots and 200 customers (4D 200C). To keep simplicity of the experiments, all customers have the same demand (10) and the same revenue (100)