A SOLUTION ALGORITHM FOR p-MEDIAN LOCATION PROBLEM ON UNCERTAIN RANDOM NETWORKS

Akram Soltanpour, Fahimeh Baroughi, Behrooz Alizadeh

DOI Number
https://doi.org/10.22190/FUMI2001055S
First page
055
Last page
071

Abstract


This paper investigatesthe classical $p$-median location problem in a network in which some of the vertex weights and the distances between vertices are uncertain and while others are random. For solving the $p$-median problem in an uncertain random network, an optimization model based on the chance theory is proposed first and then an algorithm is presented to find the $p$-median. Finally, a numerical example is given to illustrate the efficiency of the proposed method

Keywords

Location problem; p-median; Chance theory; Uncertain random network.

Keywords


Location problem; p-median; Chance theory; Uncertain random network.

Full Text:

PDF

References


bibitem{D}

{sc R. Benkoczi {rm and} B. Bhattacharya}: textit{ A new template for solving $p$-median problems for trees in sub-quadratic time (extended abstract)}.

%{Lecture Notes in Computer Science}

LNCS. {bf 3669} (2005), 271-282.

bibitem{S7}

{sc O. Berman {rm and} J. Wang}: textit{Probabilistic location problems with discrete demand weights}. {Networks.} {bf 44} (2004), 47-57.

bibitem{S101}

{sc O. Berman {rm and} J. Wang}: textit{The network $p$-median problem with discrete

probabilistic demand weights}. {Comput. Oper. Res.} {bf 37}

(2010), 1455-1463.

bibitem{S16}

{sc O. Berman {rm and} Z. Drezner}: textit{The $p$-median problem under uncertainty}. {Eur J. Oper. Res.} {bf 189} (2008), 19-30.

bibitem{S131}

{sc O. Berman {rm and} D. Krass}: textit{On $n$-facility median problem with facilities

subject to failure facing uniform demand}. { Dis. Appl. Math.}

{bf 159} (2011), 420-432.

bibitem{Bespam}

{sc S. Bespamyatnikh, B. Bhattacharya, M. Keil, D. Kirkpatrick {rm and} M. Segal}: textit{Efficient algorithms for centers and medians in interval and circular‐arc graphs}. {Networks}. {bf 9} (2002), 144-152.

bibitem{Chang}

{sc S. C. Chang, W. C. K. Yen, Y. L. Wang {rm and} J. J. Liu}: textit{The connected $ p $-median problem on block graphs}. { Optim. Lett.} {bf 10} (2016), 1191-1201.

bibitem{M}

{sc M. S. Daskin}: textit{Network and discrete location : models, algorithms, and applications}. 2nd ed., Department of Industrial and Operations Engineering, (2013).

bibitem{S12}

{sc Z. Drezner {rm and} S. Shiode}: textit{A distribution map for the one-median location problem on a network}. {Eur. J. Oper. Res.} {bf 179} (2007), 1266-1273.

bibitem{AP}

{sc B. Gavish {rm and} S. Sridhar}: textit{Computing the 2-median on tree networks in $O(n log n)$ time}. {Networks}.

{bf 26} (1995), 305-317.

bibitem{2}

{sc H. Y. Guo {rm and} X. S. Wang}: textit{Variance of uncertain random variables}. {J. Uncertainty. Anal. Appl.} {bf 2} (2014), 1-7.

bibitem{T}

{sc Y. Gao}: textit{Uncertain models for single facility location problems on networks}. {Appl. Math. Model.} {bf 36} (2012),

-2599.

bibitem{Y}

{sc S. L. Hakimi}: textit{Optimum locations of switching centres and the absolute centres

and medians of a graph}. {Oper. Res.} {bf 12} (1964), 450-459.

bibitem{hatzl}

{sc J. Hatzl}: textit{Median problems on wheels and cactus graphs}. textit{Computing.} {bf 80} (2007), 377-393.

bibitem{18}

{sc Y. C. Hou}: textit{Subadditivity of chance measure}. {J. Uncertainty Anal. Appl.} {bf 2} (2014), 1-9.

bibitem{V}

{sc O. Kariv {rm and} S. L. Hakimi}: textit{An algorithmic approach to network location problem, Part 2: the $p$-median}. {SIAM J. Appl. Math.} {bf 37} (1979), 539-560.

bibitem{13r}

{sc A. N. Kolmogorov}: textit{Grundbegriffe der wahrscheinlichkeitsrechnung.} Julius Springer, Berlin, 1933.

bibitem{4}

{sc B. Liu}: textit{Uncertainty theory}. 4nd ed., Springer-Verlag, Berlin, 2015.

bibitem{5}

{sc B. Liu}: textit{Some research problems in uncertainty theory}. 2nd ed., {J. Uncertain Syst.} {bf 3} (2009), 3-10.

bibitem{8}

{sc B. Liu}: textit{Why is there a need for uncertainty theory?}. {J. Uncertain Syst.} {bf 6} (2012), 3-10.

bibitem{11}

{sc Y. H. Liu}: textit{Uncertain random variables: A mixture of uncertainty and randomness}. {Soft Comput.} {bf 17} (2013), 625-634.

bibitem{12}

{sc Y. H. Liu}: textit{Uncertain random programming with applications}. {Fuzzy Optim. Decis. Mak.} {bf 12} (2013), 153-169.

bibitem{S1}

{sc F. V. Louveaux}: textit{Stochastic location analysis}. {Location Science}. {bf 125} (1993), 127-154.

bibitem{S2}

{sc F. V. Louveaux {rm and} D. Peeters}: textit{A dual-based procedure for stochastic facility location}. {Oper. Res.} {bf 40} (1992), 564-573.

bibitem{S3}

{sc F. V. Louveaux {rm and} J. F. Thisse}: textit{Production and location on a network under uncertainty}. {Oper. Res. Lett.} {bf 4} (1985), 145-149.

bibitem{S4}

{sc P. B. Mirchandani {rm and} A. R. Odoni}: textit{Location of medians on stochastic networks}. {Transp. Sci.} {bf 13} (1979), 85-97.

bibitem{S6}

{sc P. B. Mirchandani {rm and} A. R. Odoni}: textit{Localizing 2-medians on probabilistic and deterministic tree networks}. {Networks}. {bf 10} (1980), 329-350.

bibitem{AF}

{sc P. B. Mirchandani}: textit{The $p$-median problem and generalizations}. {Discrete location theory,} Wiley-Interscience, New York, 1990.

bibitem{AG}

{sc K. T. Nguyen {rm and} N. T. L. Chi}: textit{A model for the inverse 1-median problem on trees under uncertain costs}. {Opusc. Math.} {bf 36} (2016), 513-523.

bibitem{Nguyen cactus}

{sc K. T. Nguyen, P. Van Chien, L. H. Hai {rm and} H. D. Quoc}: textit{A simple linear time algorithm for computing a 1-median on cactus graphs}. { Appl. Appl. Math.} {bf 12} (2017), 70-77.

bibitem{URO1}

{sc Y. Sheng {rm and} Y. Gao}: textit{Shortest path problem of uncertain random network}. {Comput. Ind. Eng. } {bf 99} (2016), 97-105.

bibitem{URO2}

{sc Y. Sheng, Z. Qin {rm and} G. Shi}: textit{Minimum spanning tree problem of uncertain random network}. {J. Intell. Manuf.} {bf 28} (2017), 565-574.

bibitem{URO3}

{sc Y. Sheng {rm and} J. Gao}: textit{Chance distribution of the maximum flow of

uncertain random network}. {J. Uncertainty Anal. Appl.} {bf 2} (2014), 1-14.

bibitem{16}

{sc Y. Sheng K. Yao}: textit{Some formulas of variance of uncertain random variable}. {J. Uncertainty Anal. Appl.} {bf 2} (2014), 1-10.

bibitem{Soltanpour}

{sc A. Soltanpour, F. Baroughi {rm and} B. Alizadeh}: textit{Classical center location problem under uncertain environment}. {Int. J. Ind. Math.} {bf 9} (2017), 365-374.

bibitem{AL}

{sc A. Tamir}: textit{An $O(p n^2)$ algorithm for the $p$-median and related problems on tree graphs}. {Oper. Res. Lett.} {bf 19} (1996), 59-64.

bibitem{S121}

{sc R. Tadei, N. Ricciardi {rm and} G. Perboli}: textit{The stochastic $p$-median problem

with unknown cost probability distribution.} {Oper. Res. Lett.}

{bf 37} (2009), 135-141.

bibitem{AM}

{sc K. E. Wang {rm and} Q. Yang}: textit{Hierarchical facility location for the reverse logistics network

design under uncertainty}. {J. Uncertain Syst.} {bf 8} (2014), 255-270.

bibitem{AN}

{sc M. Wen, Z. Qin, R. Kang {rm and} Y. Yang}: textit{The capacitated facility location-allocation problem under

uncertain environment.} {J. Intell. Fuzzy Syst.} {bf 29} (2015), 2217-2226.

bibitem{27r}

{sc K. Yao {rm and} J. Gao}: textit{Law of large numbers for uncertain random variables}. {IEEE Trans. Fuzzy Syst.}

{bf 24} (2016), 615-621.




DOI: https://doi.org/10.22190/FUMI2001055S

Refbacks

  • There are currently no refbacks.




© University of Niš | Created on November, 2013
ISSN 0352-9665 (Print)
ISSN 2406-047X (Online)