Novel Reliable Uncapacitated P-Hub Location Problems Under Uncertainty

Novel Reliable Uncapacitated P-Hub Location Problems Under Uncertainty

Javad Nematian
Copyright: © 2018 |Pages: 41
DOI: 10.4018/IJFSA.2018100106
(Individual Articles)
No Current Special Offers


Hubs are facilities to collect, arrange and distribute commodities in telecommunication networks, cargo delivery systems, etc. In this article, it will study two popular hub location problems (p-hub center and p-hub maximal covering problems) under uncertainty. First, novel reliable uncapacitated p-hub location problems are introduced based on considering the failure probability of hubs, in which the parameters are random fuzzy variables, but the decision variables are real variables. Then, the proposed hub location problems under uncertainty are solved by new methods using random fuzzy chance-constrained programming based on the idea of possibility theory. These methods can satisfy optimistic and pessimistic decision makers under uncertain framework. Finally, some benchmark problems are solved as numerical examples to clarify the described methods and show their efficiency.
Article Preview

2. Literature Review

In the last two decades, many researchers have investigated hub location problems; however, reliable hub location under uncertain environment is discussed newly and it is advanced field. In this section at first, the researches about classical and original hub location problems are reviewed. Then, we review in brief some related works to this paper, specifically those considering uncertainty and reliability. Furthermore, we review the researches about reliable hub location problem under uncertainty.

The first mathematical model in HLP was introduced by O’Kelly (1987). He presented a quadratic integer programming whose objective is to minimize the total delivery cost between nodes and locating a pre-specified number of hubs. The interested reader could review the papers by Campbell and O’Kelly (2012) and Farahani et al. (2013) to read full survey of hub location problems and its subcategories.

Hub covering and p-hub center problems are two new hub location problems proposed by Campbell (1994). Then, different formulation for the p-hub center problem was represented by Kara and Tansel (2000) and Ernst et al. (2009). In the p-hub center problem the main issue is time, which is mostly considered in cargo delivering systems.

Complete Article List

Search this Journal:
Volume 13: 1 Issue (2024)
Volume 12: 1 Issue (2023)
Volume 11: 4 Issues (2022)
Volume 10: 4 Issues (2021)
Volume 9: 4 Issues (2020)
Volume 8: 4 Issues (2019)
Volume 7: 4 Issues (2018)
Volume 6: 4 Issues (2017)
Volume 5: 4 Issues (2016)
Volume 4: 4 Issues (2015)
Volume 3: 4 Issues (2013)
Volume 2: 4 Issues (2012)
Volume 1: 4 Issues (2011)
View Complete Journal Contents Listing