Selecting the best option in the stochastic hub location problem: Using Simulation and Data Envelopment Analysis

Resumen

The hub location problem is a subgroup of network optimization, in which, among existing nodes, p nodes are selected as hubs, and the remaining hubs are allocated to hub nodes. In the real world, demand, i.e., flow, through the nodes is probable and the simulation methods are usually used to solve problems in probability space. Thus, we review the hub location problem in probability space and some measuring criteria for existing options. To choose a suitable option, the Data Envelopment Analysis method is used as the ranking tool. Keywords: Hub Location, Simulation, Data Envelopment Analysis