Skip to main content
Log in

Fuzzy random classical and inverse median location problems

  • Optimization
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

In many complex systems, fuzziness and randomness simultaneously appear in a system. Then the fuzzy random variable such that it can be an effective tool to determine some high-uncertainty phenomena. Moreover, in the real-world situation, the parameters of a location problem can be randomness and fuzziness at the same time. This means that, available random data of a location problem may be unsatisfactory, therefore the fuzzy information must be integrate with the random data. This paper deals with the classical and inverse median location problems on uncertain networks in which the vertex weights are fuzzy random variables. We introduce the new criteria probability-possibility, probability-necessity and probability-credibility to convert the fuzzy random p-median location problem into a quadratic programming problem on uncertain networks. For this purpose, new formula are introduced for the possibility, necessity and credibility criteria that are used for converting fuzzy variables into deterministic variables. Also, the inverse 1-median location problem with the fuzzy random vertex weights is reformulated as the deterministic inverse 1-median location problem under the probability-possibility, the probability-necessity and the probability-credibility criteria. Finally, using these criteria, the linear time algorithms are presented for the inverse 1-median location problems on the uncertain tree networks.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1

Similar content being viewed by others

Data Availability

No data associated in the manuscript.

References

  • Afrashteh E, Alizadeh B, Baroughi F (2018a) Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks. Optim Theory Appl 178:914–934

    MathSciNet  MATH  Google Scholar 

  • Afrashteh E, Alizadeh B, Baroughi F (2018b) Optimal algorithms for integer inverse undesirable p-median location problems on weighted extended star networks. J Oper Soc China 9:99–117

  • Afrashteh E, Alizadeh B, Baroughi F (2019) Optimal algorithms for selective variants of the classical and inverse median location problems on trees. Optim Methods Softw 34:1213–1230

    MathSciNet  MATH  Google Scholar 

  • Afrashteh E, Alizadeh B, Baroughi F (2019) Inverse obnoxious p-median location problems on trees with edge length modifications under different norms. Theor Comput Sci 772:73–87

    MathSciNet  MATH  Google Scholar 

  • Babich G (1978) An efficient algorithm for solving the rectilinear location-allocation problem. Environ Plan A 10:1387–1395

    Google Scholar 

  • Baroughi F, Burkard RE, Gassner E (2011) Inverse p-median problems with variable edge lengths. Math Methods Oper Res 73:263–280

    MathSciNet  MATH  Google Scholar 

  • Benkoczi R, Bhattacharya B (2005) A new template for solving p-median problems for trees in sub-quadratic time (extended abstract). Lect Notes Comput Sci 3669:271–282

    MathSciNet  MATH  Google Scholar 

  • Bongartz I, Calamai PH, Conn AR (1994) A projection method for p norm location-allocation problems. Math Program 66:283–312

    MathSciNet  MATH  Google Scholar 

  • Brimberg J, Drezner Z (2013) A new heuristic for solving the p-median problem in the plane. Comput Oper Res 40:427–437

    MathSciNet  MATH  Google Scholar 

  • Burkard RE, Krarup J (1998) A linear algorithm for the pos/neg-weighted 1-median problem on a cactus. Comput 60:193–215

    MathSciNet  MATH  Google Scholar 

  • Burkard RE, Pleschiutschnig C, Zhan J (2004) Inverse median problems. Discrete Optim 1:23–39

    MathSciNet  MATH  Google Scholar 

  • Burkard RE, Pleschiutschnig C, Zhan J (2004) The inverse 1-median problem on a cycle. Discrete Optim 5(2008):242–253

    MathSciNet  MATH  Google Scholar 

  • Chen R (1983) Solution of minisum and minimax location-allocation problems with Euclidean distances. Nav Res Logist Q 30:449–459

    Google Scholar 

  • Cooper L (1963) Location-allocation problems. Oper Res 11:331–343

    MathSciNet  MATH  Google Scholar 

  • Cooper L (1964) Heuristic methods for location-allocation problems. SIAM Rev 6:37–53

    MathSciNet  MATH  Google Scholar 

  • Cooper WW, Huang Z, Li SX (1996) Satisfiying DEA models under chance constraints. Ann Oper Res 66:279–295

    MathSciNet  MATH  Google Scholar 

  • Cooper WW, Deng H, Huang Z, Li SS (2004) Chance constrained programming approaches to congestion in stochastic data envelopment analysis. Eur J Oper Res 155:487–501

    MathSciNet  MATH  Google Scholar 

  • Dhanaraj RK, Jhaveri RH, Krishnasamy L, Srivastava G, Maddikunta PK (2021) Black-Hole attack mitigation in medical sensor networks using the enhanced gravitational search algorithm. Int J Uncertain Fuzz Knowl-Based Syst 29(Suppl–2):297–315

    Google Scholar 

  • Dhanaraj RK, Lalitha K, Anitha S, Khaitan S, Gupta P, Goyal MK (2021) Hybrid and dynamic clustering based data aggregation and routing for wireless sensor networks. J Intell Fuzzy Syst 40(6):10751–10765

    Google Scholar 

  • Drezner Z (1984) The planar two-center and two-median problems. Transp Sci 18:351–361

    MathSciNet  Google Scholar 

  • Drezner Z, Brimberg J, Mladenovic N, Salhi S (2015) New heuristic algorithms for solving the planar p-median problem. Comput Oper Res 62:296–304

    MathSciNet  MATH  Google Scholar 

  • Dubois D (1980) Fuzzy sets and system: theory and applications. Academic Press, New York

    MATH  Google Scholar 

  • Dubois D, Prade H (1988) Possibility theory: an approach to computerized processing of uncertainty. Plenum, New York

    MATH  Google Scholar 

  • El Sayed MA, Abo-Sinna MA (2021) A novel approach for fully intuitionistic fuzzy multi-objective fractional transportation problem. Alex Eng J 60:1447–1463

    Google Scholar 

  • El Sayed MA, Baky IA, Singh P (2020) A modified TOPSIS approach for solving stochastic fuzzy multi-level multi-objective fractional decision making problem. Oper Res 57:1374–1403

    MathSciNet  MATH  Google Scholar 

  • El Sayed MA, Farahat FA, Elsisy MA (2022) A novel interactive approach for solving uncertain bi-level multi-objective supply chain model. Comput Ind Eng 169:108225

    Google Scholar 

  • Elsisy MA, Elsaadany AS, El Sayed MA (2020) Using interval operations in the Hungarian method to solve the fuzzy assignment problem and its application in the rehabilitation problem of valuable buildings in Egypt. Complexity 2020:1–11

  • Elsisy MA, El Sayed MA, Abo-Elnaga Y (2021) A novel algorithm for generating Pareto frontier of bi-level multi-objective rough nonlinear programming problem. Ain Shams Eng J 12:2125–2133

    Google Scholar 

  • Galavii M (2010) The inverse 1-median problem on a tree and on a path. Electron Notes Discrete Math 36:1241–1248

    MATH  Google Scholar 

  • Gassner E (2008) The inverse 1-maxian problem with edge length modification. J Comb Optim 16:50–67

    MathSciNet  MATH  Google Scholar 

  • Gavish B, Sridhar S (1995) Computing the 2-median on tree networks in \(O(n \log n)\) time. Networks 26:305–317

    MathSciNet  MATH  Google Scholar 

  • Goldman AJ (1971) Optimal center location in simple networks. Transp Sci 5:212–221

    MathSciNet  Google Scholar 

  • Grzegorzewski P, Mrowka E (2005) Trapezoidal approximations of fuzzy numbers. Fuzzy Sets Syst 153:115–135

  • Guan X, Zhang B (2010) Inverse 1-median problem on trees under weighted \(l_\infty \) norm. Lect Notes Comput Sci 6124:150–160

  • Guan X, Zhang B (2012) Inverse 1-median problem on trees under weighted Hamming distance. J Glob Optim 54:75–82

    MathSciNet  MATH  Google Scholar 

  • Hakimi SL (1964) Optimum locations of switching centers and the absolute centers and medians of a graph. Oper Res 12:450–459

    MATH  Google Scholar 

  • Hakimi SL (1965) Optimum distribution of switching centers in a communication network and some related graph theoretic problems. Oper Res 13:462–475

    MathSciNet  MATH  Google Scholar 

  • Hatzl J (2012) 2-balanced flows and the inverse 1-median problem in the Chebyshev space. Discrete Optim 9:137–148

    MathSciNet  MATH  Google Scholar 

  • Hua LK (1962) Application of mathematical models to wheat harvesting. Chin Math 2:539–560

    Google Scholar 

  • Jeyaselvi M, Dhanaraj RK, Sathya M, Memon FH, Krishnasamy L, Dev K, Ziyue W, Qureshi NM (2023) A highly secured intrusion detection system for IoT using EXPSO-STFA feature selection for LAANN to detect attacks. Clust Comput 26:559–574

    Google Scholar 

  • Kariv O, Hakimi SL (1979) An algorithmic approach to network location problem, part 2: the p-median. SIAM J Appl Math 37:513–538

    MathSciNet  MATH  Google Scholar 

  • Kruse R, Meyer KD (1987) Statistics with Vague DataD. Reidel Publishing Company, Dordrecht

    MATH  Google Scholar 

  • Kwakernaak H (1978) Fuzzy random variables: definitions and theorems. Inf Sci 15:1–29

    MathSciNet  MATH  Google Scholar 

  • Liu b (2002) Theory and practice of uncertain programming. Physica-Verlag, Heidelberg

    MATH  Google Scholar 

  • Liu YK, Liu B (2003) Fuzzy random variables: a scalar expected value operator. Fuzzy Optim Decis Mak 2:143–160

    MathSciNet  MATH  Google Scholar 

  • Love RF (1976) One dimensional facility location-allocation using dynamic programming. Manage Sci 22:614–617

    MATH  Google Scholar 

  • Love RF, Morris JG (1975) A computation procedure for the exact solution of location-allocation problems with rectangular distances. Nav Res Logist Q 22:441–453

    MathSciNet  MATH  Google Scholar 

  • Nahmias S (1978) Fuzzy variable. Fuzzy Sets Syst 1:97–101

    MathSciNet  MATH  Google Scholar 

  • Negoita CV, Ralescu D (1987) Simulation, Knowledge-based Computing and Fuzzy Statistics. Van Nostrand Reinhold Company, New York

    MATH  Google Scholar 

  • Nematian J, Musavi MM (2016) Uncapacitated p-hub center problem under uncertainty. Int J Ind Syst Eng 9:23–39

    Google Scholar 

  • Nematian J, Sadati M (2015) New methods for solving a vertex p-center problem with uncertain demand-weighted distance: a real case study. Int J Ind Eng Comput 6:253–266

    Google Scholar 

  • Nguyen KT (2016) Inverse 1-median problem on block graphs with variable vertex weights. J Optim Theory Appl 168:944–957

    MathSciNet  MATH  Google Scholar 

  • Puri ML, Ralescu DA (1985) The concept of normality for fuzzy random variables. Ann Probab 13:1373–1379

    MathSciNet  MATH  Google Scholar 

  • Rahmani A, Yosefikhoshbakht M (2013) Capacitated facility location problem in random fuzzy environment: using \((\alpha,\beta )\)-cost minimization model under the Hurwicz criterion. J Intell Fuzzy Syst J IN 25:953–964

    MathSciNet  MATH  Google Scholar 

  • Ramakrishnan V, Chenniappan P, Dhanaraj RK, Hsu CH, Xiao Y, Al-Turjman F (2021) Bootstrap aggregative mean shift clustering for big data anti-pattern detection analytics in 5G/6G communication networks. Comput Electr Eng 95:107380

    Google Scholar 

  • Sepasian AR, Rahbarnia F (2015) An \(O(n \log n)\) algorithm for the inverse 1-median problem on trees with variable vertex weights and edge reductions. Optim 64:595–602

    MATH  Google Scholar 

  • Sherali AD, Shetty CM (1977) The rectilinear distance location-allocation problem. AIIE Trans 9:136–143

    MathSciNet  Google Scholar 

  • Sherali HD, Tuncbilek DH (1992) A squared Euclidean distance location-allocation problem. Nav Res Logist 39:447–469

    MathSciNet  MATH  Google Scholar 

  • Tamir A (1996) An \(O(pn^2)\) algorithm for the p-median and related problems on tree graphs. Oper Res Lett 19:59–64

  • Wang S, Watada J (2012) A hybrid modified PSO approach to VaR-based facility location problems with variable capacity in fuzzy random uncertainty. Inf Sci 192:3–18

    MATH  Google Scholar 

  • Wen M, Kang R (2011) Some optimal models for facility location-allocation problem with random fuzzy demands. Appl Soft Comput 11:1202–1207

    Google Scholar 

  • Zadeh LA (1965) Fuzzy sets. Inf Control 8:338–353

    MATH  Google Scholar 

  • Zimmerman HJ (1996) Fuzzy set theory and its applications, 2nd edn. Kluwer, Dordrecht

Download references

Funding

This study did not receive any funding.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Fahimeh Baroughi.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Ethical approval

This article does not contain any studies with human participants or animals performed by any of the authors.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Taghikhani, S., Baroughi, F. Fuzzy random classical and inverse median location problems. Soft Comput 27, 8821–8839 (2023). https://doi.org/10.1007/s00500-023-08042-x

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-023-08042-x

Keywords

Navigation