A Reliable Multi-objective p-hub Covering Location Problem Considering of Hubs Capabilities

In the facility location problem usually reducing total transferring cost and time are common objectives. in the p-hub covering problem it is attempted to locate hubs and allocate customers to established hubs while allocated nodes to hubs are inside of related hubs covering radius. in this paper, we attempt to consider capability of established hubs to achieve a more reliable network. also, the proposed model try to construct a network with more covering reliability by determining operating covering radius inside of nominal radius. then, a sensitivity analysis is performed to analyze effect of parameters in the model. the proposed multi objective model is solved by ε-constraint algorithm for small size instances. for large scale instances a non-dominated sorting genetic algorithm (nsga-ii) is presented to obtain pareto solutions and its performance is compared with results of ε-constraint algorithm. the model and solution algorithm were analyzed by more numerical examples such as turkish network dataset. the sensitivity analysis confirms that the network extracted by the proposed model is more efficient than classic networks.