Open AccessHub covering location problems with different coverage types
Author(s) -
Hossein Karimi,
Mahdi Bashiri
Publication year - 2011
Publication title -
scientia iranica
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.299
H-Index - 51
eISSN - 2345-3605
pISSN - 1026-3098
DOI - 10.1016/j.scient.2011.09.018
Subject(s) - computer science , linearization , set (abstract data type) , constraint (computer aided design) , mathematical optimization , spoke hub distribution paradigm , heuristic , facility location problem , location allocation , set cover problem , operations research , mathematics , transport engineering , engineering , artificial intelligence , physics , geometry , quantum mechanics , nonlinear system , programming language
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