A Survey of Hub Location Problems

Abstract

Hub location problems originated in telecommunications and transportation systems. They combine various aspects of network issues, including location problems, network design problems and routing problems. The main theme of these problems is to route the services via a subset of hubs, rather than route each service with direct links between demand nodes. Therefore, solutions for hub location problems typically use sets of hubs to reroute the flow of the services and attempt to reduce the costs of building the service links. In this paper, we present a survey of hub location problems.

Toward unraveling multi-objective optimization problems: A hybrid approach for solving a novel facility location problem

“…Let us note that the following parametrization is obtained by an experimental manner. For this characterization, we consider matrices F 1, F 2, C1, C2 in such a way that their entries are randomly selected with an uniform distribution from the intervals [200, 600], [10,15], [10,20] and [20,40], respectively. In addition, we initialize ∆ = [2h, 2.5h, 3h], σ = [24h, 24h, 24h], α = 0.2, γ = [0.7, 0.85, 1], and Γ = [0.8m, m, 1.2m], where m is average value of AP data.…”

“…For instance, there is a small number of approaches that are based on optimally solving the mathematical programming model; See [35], [36], [37], and [38]). Nevertheless, as mentioned, since the under-study problem is an NP-hard one, most of the solution approaches that have been proposed so far follow (meta) heuristic manners; See, for example, [39], [40], and [41].…”

Toward unraveling multi-objective optimization problems: A hybrid approach for solving a novel facility location problem

“…For instance, there is a small number of approaches that are based on optimally solving the math-ematical programming model; See [53], and [26], [61], [51]). Nevertheless, as mentioned, since the under-study problem is an NP-hard one, most of the solution approaches that have been proposed so far follow (meta) heuristic manners; See, for example, [63], [32], and [7].…”

Hardness and approximation for the star p-Hub Routing Cost Problem in metric graphs

“…In 1987, O'Kelly [4] developed the first mathematical formulations of this problem by studying the dataset of airline passenger networks. Since then, numerous HLPs and variants of the p-Hub Median Problem have been studied by researchers [5][6][7][8][9][10][11][12][13][14][15].…”

“…If every non-hub can be served by several hubs, the problem is classified as multiallocation. For more classifications of HLPs, there exist several reviews and surveys on HLPs [5,7,12,14].…”