Hub covering location problems with different coverage types
By H. Karimi, Mahdi Bashiri. 2011
96 citations recorded by the source corpus.
Abstract The hub location problem is used for many applications, including cargo delivery systems, airline systems, telecommunication network design and so on. Each area has its own characteristics in hub location. In this paper, we study the hub covering problem with different coverage type over complete hub networks. Furthermore, hub set and maximal covering are expressed with single and multiple allocation strategies. First, a quadratic formulation is proposed for single allocation hub set covering problem. Then a linearization idea is considered for it and applied for multiple allocation hub set, single and multiple allocation hub maximal covering problems. The aim of these models is to find the location of hubs and allocate non-hub nodes to the located hub nodes subject to the travel time (cost or distance) between two nodes in origin-destination doesn’t exceed a given bound. The formulations with this coverage constraint have not been remarked in the literature. Two heuristic procedures are proposed to handle these models in an agreeable solution quality and computational time. The computational experience of Turkish dataset was presented for better illustration of proposed model. And a special application on Iranian hub airports location is discussed.
Subfields: Building and Construction, Industrial and Manufacturing Engineering, Organizational Behavior and Human Resource Management
View Paper: https://www.semanticscholar.org/paper/6af7d9cf30d93af9dcb4f5019ee037c6faa4ca1c
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Building and Construction
In Industrial and Manufacturing Engineering
In Organizational Behavior and Human Resource Management
Citations in the corpus
- A modified NSGA-II solution for a new multi-objective hub maximal covering problem under uncertain shipments (2014, methodology): “However, the formulation proposed by Campbell (1994) has n4 þ n2 þ n variables with 2n4 þ n2 þ 1 constraints and the model proposed by Karimi and Bashiri (2011) has 2n2 þ n variables with n4 þ 2n2 þ n þ 1 constraints (using the same coverage type).”
- Hub location problems: A review of models, classification, solution techniques, and applications (2013, background): “U-MA-V-p-HLP Karimi and Bashiri (2011) Heuristic algorithms 37 6”