Research article

Data-driven two-stage sparse distributionally robust risk optimization model for location allocation problems under uncertain environment

  • Robust optimization is a new modeling method to study uncertain optimization problems, which is to find a solution with good performance for all implementations of uncertain input. This paper studies the optimal location allocation of processing plants and distribution centers in uncertain supply chain networks under the worst case. Considering the uncertainty of the supply chain and the risk brought by the uncertainty, a data-driven two-stage sparse distributionally robust risk mixed integer optimization model is established. Based on the complexity of the model, a distribution-separation hybrid particle swarm optimization algorithm (DS-HPSO) is proposed to solve the model, so as to obtain the optimal location allocation scheme and the maximum expected return under the worst case. Then, taking the fresh-food supply chain under the COVID-19 as an example, the impact of uncertainty on location allocation is studied. This paper compares the data-driven two-stage sparse distributionally robust risk mixed integer optimization model with the two-stage sparse risk optimization model, and the data results show the robustness of this model. Moreover, this paper also discusses the impact of different risk weight on decision-making. Different decision makers can choose different risk weight and obtain corresponding benefits and optimal decisions. In addition, the DS-HPSO is compared with distribution-separation hybrid genetic algorithm and distributionally robust L-shaped method to verify the effectiveness of the algorithm.

    Citation: Zhimin Liu. Data-driven two-stage sparse distributionally robust risk optimization model for location allocation problems under uncertain environment[J]. AIMS Mathematics, 2023, 8(2): 2910-2939. doi: 10.3934/math.2023152

    Related Papers:

    [1] Rana Muhammad Zulqarnain, Xiao Long Xin, Muhammad Saeed . Extension of TOPSIS method under intuitionistic fuzzy hypersoft environment based on correlation coefficient and aggregation operators to solve decision making problem. AIMS Mathematics, 2021, 6(3): 2732-2755. doi: 10.3934/math.2021167
    [2] Atiqe Ur Rahman, Muhammad Saeed, Hamiden Abd El-Wahed Khalifa, Walaa Abdullah Afifi . Decision making algorithmic techniques based on aggregation operations and similarity measures of possibility intuitionistic fuzzy hypersoft sets. AIMS Mathematics, 2022, 7(3): 3866-3895. doi: 10.3934/math.2022214
    [3] Changlin Xu, Yaqing Wen . New measure of circular intuitionistic fuzzy sets and its application in decision making. AIMS Mathematics, 2023, 8(10): 24053-24074. doi: 10.3934/math.20231226
    [4] Le Fu, Jingxuan Chen, Xuanchen Li, Chunfeng Suo . Novel information measures considering the closest crisp set on fuzzy multi-attribute decision making. AIMS Mathematics, 2025, 10(2): 2974-2997. doi: 10.3934/math.2025138
    [5] Muhammad Arshad, Muhammad Saeed, Atiqe Ur Rahman, Sanaa A. Bajri, Haifa Alqahtani, Hamiden Abd El-Wahed Khalifa . Modeling uncertainties associated with multi-attribute decision-making based evaluation of cooling system using interval-valued complex intuitionistic fuzzy hypersoft settings. AIMS Mathematics, 2024, 9(5): 11396-11422. doi: 10.3934/math.2024559
    [6] Muhammad Arshad, Muhammad Saeed, Khuram Ali Khan, Nehad Ali Shah, Wajaree Weera, Jae Dong Chung . A robust MADM-approach to recruitment-based pattern recognition by using similarity measures of interval-valued fuzzy hypersoft set. AIMS Mathematics, 2023, 8(5): 12321-12341. doi: 10.3934/math.2023620
    [7] Nadia Khan, Sehrish Ayaz, Imran Siddique, Hijaz Ahmad, Sameh Askar, Rana Muhammad Zulqarnain . Sustainable practices to reduce environmental impact of industry using interaction aggregation operators under interval-valued Pythagorean fuzzy hypersoft set. AIMS Mathematics, 2023, 8(6): 14644-14683. doi: 10.3934/math.2023750
    [8] Admi Nazra, Jenizon, Yudiantri Asdi, Zulvera . Generalized hesitant intuitionistic fuzzy N-soft sets-first result. AIMS Mathematics, 2022, 7(7): 12650-12670. doi: 10.3934/math.2022700
    [9] Doaa Al-Sharoa . (α1, 2, β1, 2)-complex intuitionistic fuzzy subgroups and its algebraic structure. AIMS Mathematics, 2023, 8(4): 8082-8116. doi: 10.3934/math.2023409
    [10] T. M. Athira, Sunil Jacob John, Harish Garg . A novel entropy measure of Pythagorean fuzzy soft sets. AIMS Mathematics, 2020, 5(2): 1050-1061. doi: 10.3934/math.2020073
  • Robust optimization is a new modeling method to study uncertain optimization problems, which is to find a solution with good performance for all implementations of uncertain input. This paper studies the optimal location allocation of processing plants and distribution centers in uncertain supply chain networks under the worst case. Considering the uncertainty of the supply chain and the risk brought by the uncertainty, a data-driven two-stage sparse distributionally robust risk mixed integer optimization model is established. Based on the complexity of the model, a distribution-separation hybrid particle swarm optimization algorithm (DS-HPSO) is proposed to solve the model, so as to obtain the optimal location allocation scheme and the maximum expected return under the worst case. Then, taking the fresh-food supply chain under the COVID-19 as an example, the impact of uncertainty on location allocation is studied. This paper compares the data-driven two-stage sparse distributionally robust risk mixed integer optimization model with the two-stage sparse risk optimization model, and the data results show the robustness of this model. Moreover, this paper also discusses the impact of different risk weight on decision-making. Different decision makers can choose different risk weight and obtain corresponding benefits and optimal decisions. In addition, the DS-HPSO is compared with distribution-separation hybrid genetic algorithm and distributionally robust L-shaped method to verify the effectiveness of the algorithm.



    Making decisions and problem-solving are the most complicated states in our life. So, we must identify the best of multiple choices to tackle these. In this account, multi-attribute decision making helps us to make a selection. However, it is possible to accumulate unreliable facts during decision-making. In different stages of life, decisions involve factors such as uncertainty, vagueness and unreliability in data, which are the most crucial components in tackling the complications. To pursue these issues, various mathematical theories have been introduced, like probability theory, fuzzy sets, soft sets, fuzzy soft sets, intuitionistic soft sets, etc. Fuzzy set theory (FS) was proposed by Zadeh [1] in 1965. After that, the interval value fuzzy set (IVFS) and others were compared by Lee et al. in [2]. It is a structural method for dealing with issues involving inconsistency, ambiguity and inaccuracy of assessments. In correspondence to probability theory, the fuzzy set theory suggested a unique transformation for analyzing available evidence and preferences in group decision-making. Moreover, Pappis [3] presented the applications of fuzzy set theory. In 1983, Atanassov [4] put forward the theory of the intuitionistic fuzzy set (IFS), which is an extension of FS. It was an alternative approach to sort out these uncertainties, vagueness and fuzziness and described the degree of satisfiability and non-satisfiability. However, it is worth noting that single membership and non-membership degrees did not deal precisely with these situations. Then, vague set (VS) theory was introduced by Liu et al. [5]. This theory was like the IFS, which is a generalization of FS. In a VS, interval-based membership is used instead of point-base membership, and it is more effective in capturing the vagueness of the data. IFS and VS are considered equivalent in the literature. In this way, IFS is isomorphic to VS. After that, Smarandache [6] proposed the concept of a neutrosophic set (NS), which is formed by adding indeterminacy in intuitionistic sets. A NS is used to rank the possibilities and helps us to select an appropriate alternative. It involves truthfulness, indeterminacy and falseness, which give us direction to overcome these imprecisions. Molodtsov, a Russian analyst, was the first to suggest soft set (SS) theory [7] in 1999. It is a parameterized subset of a universal set and a wide mathematical tool for managing uncertainty and ill-defined things which is hassle-free from the above complexities. He effectively applied soft set theory in a variety of areas involving smoothness of functions, game theory etc. In the past few years, there has been strong interest in the algebraic structure of soft set theory. Aktas and Cagman [8] presented the idea of soft matrices, which are the characterization of soft sets. They also linked soft sets with the theory of fuzzy and rough sets by illustrating the difference. Soft semi-rings were originated by Ali et al. [9] by applying soft set theory and discussing their properties. Zou and Xiao [10] demonstrated the data interpretation using a soft set under incomplete information. In 2001, Maji et al. [11] suggested the idea of the fuzzy soft set (FSS), which gave a more generalized conclusion and a combination of fuzzy set and soft set. Moreover, they discussed the applications of soft sets in analyzing problems and making the best decisions. Majumdar et al. [12] generalized the FSS by associating a degree with the parameters of FS. It was the most suitable concept, as it includes the uncertainty corresponding to each value of the parameter. The concept of an intuitionistic fuzzy soft set (IFSS) [13] is modified and reformulated as a composition of intuitionistic fuzzy and soft sets. It involves the parameters which reflect the validity of the data which is provided and helps us to choose the best among them. Additionally, using an intuitionistic set, many theories have been proposed, including similarity measure, distance measure and entropy measure; and their applications have been presented in medical diagnosis, HR selection and pattern recognition. Liang et al. [14] proposed the similarities measure by using IFS. De et al. [15] used the intuitionistic set for medical diagnosis. Ejegwa et al. [16] suggested career determination by using an intuitionistic set. Li, Deng-Feng [17] suggested the similarities measure and pattern recognition. Szmidt et al. [18] suggested group decision making using IFS. Wei et al. [19] gave an approach to entropy similarity measure using IFS. Jafar et al. [20] discussed the comprehensive study of the application of IFSM. Mitchell [21] discussed the similarity measure and its application to pattern recognition.

    Then, Smarandache [22] enhanced the concept of a soft set and proposed a hypersoft set theory in 2018. It is a more generalized theory than the soft sets, tackles vagueness and assists us in making the best decision. Zulqarnain et al. [23] gave an inclusive study on the applications of intuitionistic hypersoft sets. Yolcu and Ozturk [24] presented the fuzzy hypersoft sets and their application for decision-making. Debnath [25] presented the fuzzy hypersoft sets and their weightage operator for decision making. Yolcu et al. [26] proposed intuitionistic fuzzy hypersoft sets (IFHSS). Zulqarnain et al. [27,28] proposed the aggregate operators of IFHSS and interval-valued intuitionistic fuzzy hypersoft sets (IVIFHSS) with application to multi-criteria decisoin making (MCDM) problems. Some more definitions and operators on the set structures, like picture fuzzy, interval-valued picture fuzzy, FP-intuitionistic multi fuzzy N-soft sets.raphs on interval-valued Fermatean neutrosophic graphs, single-valued pentapartitioned neutrosophic graphs, with applications have been proposed by [29,30,31,32,33].

    One of the most significant environmental parameters is the air quality index (AQI), which evaluates the quality of the air in any particular region. A variety of air quality indices have been established to evaluate the health effects of air pollution due to the continuously rising levels of air pollution in the majority of the world's areas. Air pollution is caused by a variety of factors, including industrial and transportation emissions, brick kiln smoke, agricultural waste and biomass burning and construction site dust. Another source of air pollution includes large-scale tree-cutting to create room for new roads and structures. All these air pollutants (i.e., CO, SO2, O3, and NO2), benzene, toluene, ethyl benzene, xylene, and 1, 3-butadiene were included in the suggested index because of their severe effects on human health. Experts have given the criteria that described which AQI level is best for human health. Many researchers used different techniques to analyze the air quality index. For example, Sowlat et al. [34] discussed the fuzzy-based air quality index, and Kumar and Goyal [35] presented the forecasting of daily AQI. Zhan et al. [36] suggested the driving factors of AQI. Saqlain et al. [37] gave similarity measures for NHSSs, and Jafar et al. [38] proposed trigonometric similarity measures for NHSSs with application to renewable energy source selection. Linear Diophantine fuzzy sets [39] and spherical linear Diophantine fuzzy sets [40] are new fuzzy extensions for modeling uncertainties in real-life circumstances. The idea of cubic bipolar fuzzy-VIKOR method using new distance and entropy measures and Einstein averaging aggregation operators with application to renewable energy was presented in [41].

    Intuitionistic hypersoft set theory is highly beneficial in solving decision-making issues, but it only deals with attributes of alternatives about characteristics, and thus direct comparison of two sets of variables is not easy. If a DM wants to analyze the comparison between two sets, it can be done with the help of similarity measures and distance measures, for which [26] introduced the intuitionistic hypersoft set. Using the definition, we have proposed the similarity measures and distance measures under the intuitionistic hypersoft set environment.

    The intuitionistic soft set theory is restricted with membership and non-membership grades in selecting the optimal alternative in a decision-making problem. To deal with a decision analysis problem that possesses some attributes which can be further categorized, the idea of intuitionistic hypersoft set theory is more effective and reliable. The advantages of the proposed theory are the following:

    (1) The proposed method is a new approach for any multi-attribute decision making (MADM) problem, particularly with a large number of attributes, along with a simple computing approach.

    (2) The proposed operators are more consistent and accurate when compared to existing approaches for MADM problems in an intuitionistic context, demonstrating their applicability.

    (3) New distance and similarity measures for IFHSS are developed with the help of aggregate operators. Proposed information measures are designed to cover certain drawbacks of extension techniques.

    (4) The suggested method also analyzes the interrelationship of qualities in practical application, while existing approaches cannot.

    The paper is organized as follows. In Section 2, we review some basic definitions to understand the rest of the article, i.e., intuitionistic set, soft set, hypersoft set and intuitionistic fuzzy hypersoft set (IFHSS), and necessary results. In Section 3, distance measures of IFHSS with theorems and propositions and their desirable properties are established. In Section 4, similarity measures of IFHSS are developed. In Section 5, by using these distance and similarity measures, a decision-making problem (application/case study) is presented. In Section 6, results, discussion and comparison are given. Finally, the conclusion and future directions are presented in the last section.

    In this section, we discuss the definitions of intuitionistic set, soft set, hypersoft set and intuitionistic hypersoft set.

    Definition 2.1. [4] Intuitionistic set theory was proposed by Atanassove in 1983 and shows the degree of belongingness and non-belongingness. Let Ȗ be the universe of discourse and Yint be the intuitionistic set, defined as

    Υint:Ȗ[0,1]2.

    Definition 2.2. [7] In 1999, the term soft set was introduced by Molodtsov to make decisions in parametric family of alternatives. Let ξ={ξ1,ξ2,ξ3,.ξn} be the set of alternatives and Ʀ be the set of attributes. Let P(ξ) denote the power set of ξ and ӼƦ; then, a pair (η, Ӽ) is called a soft set over ξ as it follows the following mapping.

    η:ӼP(ξ).

    Definition 2.3. [22] The term hypersoft set was introduced by Smarandache in 2018 to deal with sub-attributions. Let ξ={ξ1,ξ2,ξ3,.ξn} be the set of alternatives, Ʀ={Ʀ1,Ʀ2,..,Ʀn} be the set of attributes and {ϰ1,ϰ2,ϰ3,,ϰn}Ʀ be the set of attributive values. Then, a pair (η,Ʀ1×Ʀ2×..×Ʀn) is called a hypersoft set over;

    η:Ʀ1×Ʀ2×..×ƦnP(ξ).

    Definition 2.4. [26] Let ξ={ξ1,ξ2,ξ3,.ξn} be the finite set of alternatives, and P(ξ) denotes the power set of ξ. Let Ʀ={Ʀ1,Ʀ2,..,Ʀn} be the well-defined attributions, whose corresponding attributive values Ӽ are the set of {ϰ1,ϰ2,ϰ3,,ϰn} having distinct elements. The mapping can be defined as η:PP(ξ). Then, the pair (η,P) is called IFHSS over ξ, such that η(P)={ξ,(ϐ(η(P)),ғϐ(η(P))}, where ,ғ are the truthfulness and falseness deals with the membership and non-membership value, respectively.

    Definition 2.5. [26] Let ϐ and ϔ be the two IFHSS where ϐ={ξ,ϐ(η(P)),ғϐ(η(P))} and ϔ={ξ,ϔ(η(P)),ғϔ(η(P))}, and then following operations are defined.

    Addition:

    ϐ+ϔ={ѵ,ϐ(η(P))+ϔ(η(P))ϐ(η(P)).ϔ(η(P)),ғϐ(η(P))ғϔ(η(P))}

    Multiplication:

    ϐ×ϔ={ѵ,ϐ(η(P))ϔ(η(P)),ғϐ(η(P))+ғϔ(η(P))ғϐ(η(P))ғϔ(η(P))}.

    Subtraction:

    ϐϔ={ѵ,ϐ(η(P))ϔ(η(P))1ϔ(η(P)),ғϐ(η(P))ғϔ(η(P))}

    holds only when ϐϔ,ϔ(η(P))1,ғϔ(η(P))0.

    Division:

    ϐ/ϔ={ѵ,ϐ(η(P))ϔ(η(P)),ғϐ(η(P))ғϔ(η(P))1ғϔ(η(P))}

    holds only when ϐϔ,ϔ(P(ξ))0,ғϔ(P(ξ))1.

    Definition 2.6. [26] Consider ϐ and ϔ to be the two IFHSS where

    ϐ={ξ,ϐ(η(P)),ғϐ(η(P))}andϔ={ξ,ϔ(η(P)),ғϔ(η(P))}

    and then the following operations are defined.

    Complement:

    ϐc={ѵ,ғϐ(η(P)),ϐ(η(P))}.

    It is based on the dependency intuitionistic theory, all the truthfulness and falseness are dependent, and ϐc={ѵ,1ϐ(η(P)),1ғϐ(η(P))}.

    This case is based on the independency intuitionistic theory, and all the truthfulness and falseness are dependent.

    Inclusion: ϐϔiffϐ(η(P))ϔ(η(P)),ғϐ(η(P))ғϔ(η(P)).

    Equality: ϐ=ϔiffϐϔ and ϔϐ.

    Union: If ϐ and ϔ are the two IFHSS, then the union of ϐ and ϔ is

    {ѵ,ϐ(η(P))ϔ(η(P)),ғϐ(η(P))ғϔ(η(P))}.

    Intersection: If ϐ and ϔ are the two IFHSS, then intersection of ϐ and ϔ is

    {ѵ,ϐ(η(P))ϔ(η(P)),ғϐ(η(P))ғϔ(η(P))}.

    Definition 2.7. [26] Let Ȗ be the universe discourse and ϐ be an IFHSS. Then, ϐ is said to be an absolute IFHSS if

    ϐ(η(P))=1  and  ғϐ(η(P))=0.

    Let ϐ be the single value IFHSS. Then, ϐ is said to be empty IFHSS if

    ϐ(η(P))=0  and  ғϐ(η(P))=1.

    In this section, we propose distance measures of IFHSS with theorems, propositions and their desirable properties.

    The similarity measure determines how similar two items are. The similarity measure is based on the direct operation of membership, non-membership, hesitation and upper bound of membership function. Similarities measure is used to broaden the theories and suggests many real-life applications, including medical diagnosis, physics education, pattern recognition, defect detection and multi-attribute decision making.

    Definition 3.1. Let a mapping 𝔇 defined as D:Ѐ()×Ѐ()[0,1] be called a distance measure if 𝔇 satisfies the following axioms for ϐ, ϔ (two IFHSS) and ϦЀ().

    • 𝔇1: 0D(ϐ,ϔ)1

    • 𝔇2: 𝔇 (ϐ, ϔ) = 0 iff ϐ = ϔ

    • 𝔇3: 𝔇 (ϐ, ϔ) = 𝔇 (ϔ, ϐ)

    • 𝔇4: ϐ ⊆ ϔ ⊆ Ɽ

    D(ϐ,ϔ)=1nn=1max{|ʈϐ(ƴ(Ϧ))ʈϔ(ƴ(Ϧ))|,|ƒϐ(ƴ(Ϧ))ƒϔ(ƴ(Ϧ))|}
    ʈϐ(ƴ(Ϧ))ʈϔ(ƴ(Ϧ))ʈ(ƴ(Ϧ))
    ƒϐ(ƴ(Ϧ))ƒϔ(ƴ(Ϧ))ƒ(ƴ(Ϧ)), (A)

    where ʈ and ƒ represent the truthfulness and falsity degree, and ={1,2,3,,n} represent the sub-attributes.

    Remark: In Definition 3.1, the axiom shows that these mappings will define a metric space, and further, this can be extended to the topic of topology on it.

    We have to prove that D(ϐ,)D(ϐ,ϔ). For this, we will discuss two cases.

    Case 1. Consider D(ϐ,):

    |ʈϐ(ƴ(Ϧ))ʈ(ƴ(Ϧ))||ƒϐ(ƴ(Ϧ))ƒ(ƴ(Ϧ))|,
    D(ϐ,)=|ʈϐ(ƴ(Ϧ))iʈ(ƴ(Ϧ))i|i,
    |ƒϐ(ƴ(Ϧ))iƒϔ(ƴ(Ϧ))i||ƒϐ(ƴ(Ϧ))iƒ(ƴ(Ϧ))i||ʈϐ(ƴ(Ϧ))iʈ(ƴ(Ϧ))i|. (1)
    |ƒϔ(ƴ(Ϧ))iƒ(ƴ(Ϧ))i||ƒϐ(ƴ(Ϧ))iƒ(ƴ(Ϧ))i||ʈϐ(ƴ(Ϧ))iʈ(ƴ(Ϧ))i|. (2)

    On the other hand,

    |ʈϐ(ƴ(Ϧ))iʈϔ(ƴ(Ϧ))i||ʈϐ(ƴ(Ϧ))iʈ(ƴ(Ϧ))i|

    and

    |ʈϔ(ƴ(Ϧ))iʈ(ƴ(Ϧ))i||ʈϐ(ƴ(Ϧ))iʈ(ƴ(Ϧ))i|

    Combining (1) and (2), we get

    1nn=1max{|ʈϐ(ƴ(Ϧ))iʈϔ(ƴ(Ϧ))i|,|ƒϐ(ƴ(Ϧ))iƒϔ(ƴ(Ϧ))i|}1nn=1max{|ʈϐ(ƴ(Ϧ))iʈ(ƴ(Ϧ))i|,|ƒϐ(ƴ(Ϧ))iƒ(ƴ(Ϧ))i|}

    and

    1nn=1max{|ʈϔ(ƴ(Ϧ))iʈ(ƴ(Ϧ))i|,|ƒϔ(ƴ(Ϧ))iƒ(ƴ(Ϧ))i|}1nn=1max{|ʈϐ(ƴ(Ϧ))iʈ(ƴ(Ϧ))i|,|ƒϐ(ƴ(Ϧ))iƒ(ƴ(Ϧ))i|}. (B)

    So, we conclude that

    D(ϐ,)D(ϐ,ϔ)  and  D(ϐ,)D(ϔ,).

    Case 2. Consider D(ϐ,):

    |ʈϐ(ƴ(Ϧ))iʈ(ƴ(Ϧ))i||ƒϐ(ƴ(Ϧ))iƒ(ƴ(Ϧ))i|,
    D(ϐ,)=|ƒϐ(ƴ(Ϧ))iƒ(ƴ(Ϧ))i|.

    However, i,

    |ʈϐ(ƴ(Ϧ))iʈϔ(ƴ(Ϧ))i||ʈϐ(ƴ(Ϧ))iʈ(ƴ(Ϧ))i||ƒϐ(ƴ(Ϧ))iƒ(ƴ(Ϧ))i|. (1')
    |ʈϔ(ƴ(Ϧ))iʈ(P(v))i||ʈϐ(ƴ(Ϧ))iʈ(ƴ(Ϧ))i||ƒϐ(P(v))iƒ(ƴ(Ϧ))i|. (2')

    Combining (1') and (2'), we get

    1nn=1max{|ʈϐ(ƴ(Ϧ))iʈϔ(ƴ(Ϧ))i|,|ƒϐ(ƴ(Ϧ))iƒϔ(ƴ(Ϧ))i|}1nn=1max{|ʈϐ(ƴ(Ϧ))iʈ(ƴ(Ϧ))i|,|ƒϐ(ƴ(Ϧ))iƒ(ƴ(Ϧ))i|}

    and

    1nn=1max{|ʈϔ(ƴ(Ϧ))iʈ(ƴ(Ϧ))i|,|ƒϔ(ƴ(Ϧ))iƒ(ƴ(Ϧ))i|}1nn=1max{|ʈϐ(ƴ(Ϧ))iʈ(ƴ(Ϧ))i|,|ƒϐ(ƴ(Ϧ))iƒ(ƴ(Ϧ))i|}.

    So, we conclude that

    D(ϐ,)D(ϐ,ϔ)  and  D(ϐ,)D(ϔ,).

    Theorem 3.2. Let ϐ and ϔ be two IFHSS, and then dm (ϐ, ϔ) for m = 1, 2, .., 5 is a distance between IFHSS defined as the following:

    1) d1 (ϐ, ϔ) =

    12|Ϧ|(|ʈ2ϐ(ƴ(Ϧ))ʈ2ϔ(ƴ(Ϧ))|+|ƒ2ϐ(ƴ(Ϧ))ƒ2ϔ(ƴ(Ϧ))|)

    2) d2 (ϐ, ϔ) =

    1|Ϧ|(|ʈ2ϐ(ƴ(Ϧ))ʈ2ϔ(ƴ(Ϧ))||ƒ2ϐ(ƴ(Ϧ))ƒ2ϔ(ƴ(Ϧ))|)

    3) d3 (ϐ, ϔ) =

    (|ʈ2ϐ(ƴ(Ϧ))ʈ2ϔ(ƴ(Ϧ))||ƒ2ϐ(ƴ(Ϧ))ƒ2ϔ(ƴ(Ϧ))|)(1+|ʈ2ϐ(ƴ(Ϧ))ʈ2ϔ(ƴ(Ϧ))||ƒ2ϐ(ƴ(Ϧ))ƒ2ϔ(ƴ(Ϧ))|)

    4) d4 (ϐ, ϔ) =

    1λ(|ʈ2ϐ(ƴ(Ϧ))ʈ2ϔ(ƴ(Ϧ))|)(|ʈ2ϐ(ƴ(Ϧ))ʈ2ϔ(ƴ(Ϧ))|)μ(|ƒ2ϐ(ƴ(Ϧ))ƒ2ϔ(ƴ(Ϧ))|)(|ƒ2ϐ(ƴ(Ϧ))ƒ2ϔ(ƴ(Ϧ))|)

    where λ, 𝜇 [0, 1].

    5) d5 (ϐ, ϔ) =

    1λ|Ϧ|(|ʈ2ϐ(ƴ(Ϧ))ʈ2ϔ(ƴ(Ϧ))|)(|2ϐ(ƴ(Ϧ))ʈ2ϔ(ƴ(Ϧ))|)μ|ξ|(|ƒ2ϐ(ƴ(Ϧ))ƒ2ϔ(ƴ(Ϧ))|)(|ƒ2ϐ(ƴ(Ϧ))ƒ2ϔ(ƴ(Ϧ))|)

    where, 𝜇 [0, 1].

    If dm (ϐ, ϔ) for m = 1, 2, .., 5 satisfied all the axioms of distance, i.e., D1–D4, then they are suitable for validity.

    Theorem 3.3. Let ϐ and ϔ be two IFHSS then dm (ϐ, ϔ) for m = 1, 2, .., 5 is a distance between IFHSS holds the followings:

    a) dm(ϐ,ϔc)=dm(ϐc,ϔ)

    b) dm(ϐ,ϔ)=dm(ϐϔ,ϐϔ)

    c) dm(ϐ,ϐϔ)=dm(ϔ,ϐϔ)

    d) dm(ϐ,ϐϔ)=dm(ϔ,ϐϔ)

    Proof:

    a. d1(ϐ,ϔc)=d1(ϐc,ϔ)

    Let

    ϐ={ѵ,ʈϐ(ƴ(Ϧ)),ƒϐ(ƴ(Ϧ))};
    ϔ={ѵ,ʈϔ(ƴ(Ϧ)),ƒϔ(ƴ(Ϧ))}};
    ϔc={ѵ,(ƒϔ(ƴ(Ϧ)),ʈϔ(ƴ(Ϧ))}.

    Then, by distance d1(ϐ,ϔ), we have

    d1(ϐ,ϔ)=12|Ϧ|(|ʈ2ϐ(ƴ(Ϧ))ʈ2ϔ(ƴ(Ϧ))|+|ƒ2ϐ(ƴ(Ϧ))ƒ2ϔ(ƴ(Ϧ))|).

    Then,

    d1(ϐ,ϔc)=12|Ϧ|(|ʈ2ϐ(ƴ(Ϧ))ƒ2ϔ(ƴ(Ϧ))|+|ƒ2ϐ(ƴ(Ϧ))ʈ2ϔ(ƴ(Ϧ))|)
    =12|Ϧ|(|ƒ2ϐ(ƴ(Ϧ))ʈ2ϔ(ƴ(Ϧ))|+|ʈ2ϐ(ƴ(Ϧ))ƒ2ϔ(ƴ(Ϧ)))
    =d1(ϐc,ϔ)

    b. d1(ϐ,ϔ)=d1(ϐϔ,ϐϔ)

    =12|Ϧ|(|(min(ʈϐ(ƴ(Ϧ)),ʈϔ(ƴ(Ϧ)))2(max(ʈϐ(ƴ(Ϧ)),ʈϔ(ƴ(Ϧ))))2|+|(max(ƒϐ(ƴ(Ϧ)),ƒϔ(ƴ(Ϧ)))2(min(ƒϐ(ƴ(Ϧ)),ƒϔ(ƴ(Ϧ)))2|)
    =12|Ϧ|(|ʈ2ϐ(ƴ(Ϧ))ʈ2ϔ(ƴ(Ϧ))|+ƒ2ϐ(ƴ(Ϧ))ƒ2ϔ(ƴ(Ϧ)))=d1(ϐ,ϔ).

    In this Section 4, similarity measures of IFHSS have been developed.

    The distance measure determines how attributes are closely related to each other. The distance measure is based on the direct operation of membership, and non-membership.

    Definition 4.1. Let ϐ and ϔ be two IFHSS. A mapping Ƴ defined as Ƴ: Ѐ (ầ) × Ѐ (ầ) [0, 1] is called a similarity measure between ϐ and ϔ if Ƴ holds these axioms:

    1) Ƴ1 :0Ƴ(ϐ,ϔ)1

    2) Ƴ2: Ƴ(ϐ, ϔ) = 0 iff ϐ = ϔ

    3) Ƴ3: Ƴ(ϐ, ϔ) = Ƴ(ϔ, ϐ)

    4) Ƴ4: ϐ ⊆ ϔ ⊆ Ɽ

    Ƴ(ϐ,)Ƴ(ϐ,ϔ)  and  Ƴ(ϐ,)Ƴ(ϔ,).

    Theorem 4.2. Let ϐ and ϔ be two IFHSS. Then, Ƴm(ϐ,ϔ) for m = 1, 2, ..., 5 are the similarity measure between IFHSS holds the followings:

    1) Ƴ1(ϐ,ϔ)=112|Ϧ|(|ʈ2ϐ(ƴ(Ϧ))ʈ2ϔ(ƴ(Ϧ))|+|ƒ2ϐ(ƴ(Ϧ))ƒ2ϔ(ƴ(Ϧ))|);

    2) Ƴ2(ϐ,ϔ)=11|Ϧ|(|ʈ2ϐ(ƴ(Ϧ))ʈ2ϔ(ƴ(Ϧ))||ƒ2ϐ(ƴ(Ϧ))ƒ2ϔ(ƴ(Ϧ))|);

    3) Ƴ3(ϐ,ϔ)=(1|ʈ2ϐ(ƴ(Ϧ))ʈ2ϔ(ƴ(Ϧ))||ƒ2ϐ(ƴ(Ϧ))ƒ2ϔ(ƴ(Ϧ))|)(1+|ʈ2ϐ(ƴ(Ϧ))ʈ2ϔ(ƴ(Ϧ))||ƒ2ϐ(ƴ(Ϧ))ƒ2ϔ(ƴ(Ϧ))|);

    4) Ƴ4(ϐ,ϔ)=λ(|ʈ2ϐ(ƴ(Ϧ))ʈ2ϔ(ƴ(Ϧ))|)(|ʈ2ϐ(ƴ(Ϧ))ʈ2ϔ(ƴ(Ϧ))|)+μ(|ƒ2ϐ(ƴ(Ϧ))ƒ2ϔ(ƴ(Ϧ))|)(|ƒ2ϐ(ƴ(Ϧ))ƒ2ϔ(ƴ(Ϧ))|),

    where λ,μ[0,1];

    5) Ƴ5(ϐ,ϔ)=λ|Ϧ|(|ʈ2ϐ(ƴ(Ϧ))ʈ2ϔ(ƴ(Ϧ))|)(|ʈ2ϐ(ƴ(Ϧ))ʈ2ϔ(ƴ(Ϧ))|)+μ|Ϧ|(|ƒ2ϐ(ƴ(Ϧ))ƒ2ϔ(ƴ(Ϧ))|)(|ƒ2ϐ(Ƥ(υ))ƒ2ϔ(ƴ(Ϧ))|),

    where λ,μ[0,1].

    Now, we verify the Ƴ1–Ƴ4 axioms.

    Ƴ1(ϐ,ϔ)=112|Ϧ|(||ʈ2ϐ(ƴ(Ϧ))ʈ2ϔ(ƴ(Ϧ))|+|ƒ2ϐ(ƴ(Ϧ))ƒ2ϔ(ƴ(Ϧ))||)
    Ƴ1(ϐ,ϔ)=1iffϐ=ϔ.
    112|Ϧ|(|ʈ2ϐ(ƴ(Ϧ))ʈ2ϔ(ƴ(Ϧ))|+|ƒ2ϐ(ƴ(Ϧ))ƒ2ϔ(ƴ(Ϧ))|)=1
    (|ʈ2ϐ(ƴ(Ϧ))ʈ2ϔ(ƴ(Ϧ))|+|ƒ2ϐ(ƴ(Ϧ))ƒ2ϔ(ƴ(Ϧ))|)=0.

    This is possible when

    (|ʈ2ϐ(ƴ(Ϧ))ʈ2ϔ(ƴ(Ϧ))|+|ƒ2ϐ(ƴ(Ϧ))ƒ2ϔ(ƴ(Ϧ))|)=0

    ⇒ ∣ ʈ2ϐ(ƴ(Ϧ))ʈ2ϔ(ƴ(Ϧ))|=0;|ƒ2ϐ(ƴ(Ϧ))ƒ2ϔ(ƴ(Ϧ))|=0

    ʈ2ϐ(ƴ(Ϧ))=ʈ2ϔ(ƴ(Ϧ));ƒ2ϐ(ƴ(Ϧ))=ƒ2ϔ(ƴ(Ϧ))

    ʈϐ(ƴ(Ϧ))=ʈϔ(ƴ(Ϧ)),ƒϐ(ƴ(Ϧ))=ƒϔ(ƴ(Ϧ))

    ⇒ ϐ = ϔ.

    Conversely, we have to prove that Ƴ1(ϐ,ϔ)=1.

    Since ϐ = ϔ,

    ʈϐ(ƴ(Ϧ))=ʈϔ(ƴ(Ϧ)),ƒϐ(ƴ(Ϧ))=ƒϔ(ƴ(Ϧ))
    ʈ2ϐ(ƴ(Ϧ))=ʈ2ϔ(ƴ(Ϧ)),ƒ2ϐ(ƴ(Ϧ))=ƒ2ϔ(ƴ(Ϧ))
    ʈ2ϐ(ƴ(Ϧ))ʈ2ϔ(ƴ(Ϧ))=0,ƒ2ϐ(ƴ(Ϧ))ƒ2ϔ(ƴ(Ϧ))=0
    (|ʈ2ϐ(ƴ(Ϧ))ʈ2ϔ(ƴ(Ϧ))|=0,|ƒ2ϐ(ƴ(Ϧ))ƒ2ϔ(ƴ(Ϧ))|)=0
    12|Ϧ|(|ʈ2ϐ(ƴ(Ϧ))ʈ2ϔ(ƴ(Ϧ))|+|ƒ2ϐ(ƴ(Ϧ))ƒ2ϔ(ƴ(Ϧ))|)=0
    112|Ϧ|(|ʈ2ϐ(ƴ(Ϧ))ʈ2ϔ(ƴ(Ϧ))|+|ƒ2ϐ(ƴ(Ϧ))ƒ2ϔ(ƴ(Ϧ))|)=10
    Ƴ1(ϐ,ϔ)=1.

    Theorem 4.3. Let ϐ and ϔ be two IFHSS. Then, Ƴm(ϐ,ϔ) for m=1,2,..,5 are the similarity measures in between IFHSS ϐ and ϔ, we have:

    a) Ƴm(ϐ,ϔc)=Ƴm(ϐc,ϔ)

    b) Ƴm(ϐ,ϔ)=Ƴm(ϐϔ,ϐϔ)

    c) Ƴm(ϐ,ϐϔ)=Ƴm(ϔ,ϐϔ)

    d) Ƴm(ϐ,ϐϔ)=Ƴm(ϔ,ϐϔ)

    Proof:

    a. Ƴ1(ϐ,ϔc)=Ƴ1(ϐc,ϔ).

    Consider the following:

    ϐ={ѵ,ʈϐ(ƴ(Ϧ)),ƒϐ(ƴ(Ϧ))};
    ϔ={ѵ,ʈϔ(ƴ(Ϧ)),ƒϔ(ƴ(Ϧ))};
    ϔc={ѵ,ƒϔ(ƴ(Ϧ)),ʈϔ(ƴ(Ϧ))}.

    By definition,

    Ƴ1(ϐ,ϔ)=112|Ϧ|(|ʈ2ϐ(ƴ(Ϧ))ʈ2ϔ(ƴ(Ϧ))|+|ƒ2ϐ(ƴ(Ϧ))ƒ2ϔ(ƴ(Ϧ))|).

    Then,

    Ƴ1(ϐ,ϔc)=112|Ϧ|(|ʈ2ϐ(ƴ(Ϧ))ƒ2ϔ(ƴ(Ϧ))|+|ƒ2ϐ(ƴ(Ϧ))ʈ2ϔ(ƴ(Ϧ))|)
    =112|Ϧ|(|ƒ2ϐ(ƴ(Ϧ))ʈ2ϔ(ƴ(Ϧ))|+|ʈ2ϐ(ƴ(Ϧ))ƒ2ϔ(ƴ(Ϧ))|)
    =Ƴ1(ϐc,ϔ).

    b. Ƴ1(ϐ,ϔ)=Ƴ1(ϐϔ,ϐϔ)

    =112|Ϧ|(|(min(ʈϐ(ƴ(Ϧ)),ʈϔ(ƴ(Ϧ))|)2(max(ʈϐ(ƴ(Ϧ)),ʈϔ(ƴ(Ϧ)))2|+|(max(ƒϐ(ƴ(Ϧ)),ƒϔ(ƴ(Ϧ)))2(min(ƒϐ(ƴ(Ϧ)),ƒϔ(ƴ(Ϧ)))2|)
    =112|Ϧ|(|ʈ2ϐ(ƴ(Ϧ))ʈ2ϔ(ƴ(Ϧ))|+ƒ2ϐ(ƴ(Ϧ))ƒ2ϔ(ƴ(Ϧ)))=Ƴ1(ϐ,ϔ).

    c. Ƴ1(ϐ,ϐϔ)=Ƴ1(ϔ,ϐϔ)

    =112|Ϧ|(|ʈ2ϐ(ƴ(Ϧ))(min(ʈϐ(ƴ(Ϧ)),ʈϔ(ƴ(Ϧ))))2|+|ƒ2ϐ(ƴ(Ϧ))(max(ƒϐ(ƴ(Ϧ)),ƒϔ(ƴ(Ϧ))))2|)
    =12|Ϧ|((|ʈ2ϔ(ƴ(Ϧ))(max(ʈϐ(ƴ(Ϧ)),ʈϔ(ƴ(Ϧ))))2|+|ƒ2ϔ(ƴ(Ϧ))(min(ƒϐ(ƴ(Ϧ)),ƒϔ(ƴ(Ϧ))))2|)=Ƴ1(ϔ,ϐϔ).

    Let ϸ = {ϸ1, ϸ2, ϸ3, …, ϸn} represent the regions (different geographical areas), ᵹ = {ᵹ1, ᵹ2, ᵹ3, …, ᵹn} represents human activities, and Ϥ = {Ϥ1, Ϥ2, Ϥ3, …, Ϥn} and ζ = {ζ1, ζ2, ζ3, …., ζn } show the humidity level and air pollution at that particular area, respectively. A decision-maker determines ϸ region and the factors ᵹ, Ϥ, ζ which enhance the AQI by applying a decision-making technique. This analysis can be used to determine whether a geographical area has good, moderate or hazardous AQI.

    Let ϸ = {ϸ1, ϸ2, ϸ3… ϸn} and

    Ŭ={Ŭ1(air  pollutants)Ŭ2(humana  ctivities)Ŭ3(humidity  level)}
    Ŭ1={(sulfur  dioxide)SO2,(ozone)O3,(nitrogen)NO2,(carbon  monoxide)CO,(particulate  matter)PM2.5}
    Ŭ2={smoking,transport  exhaust,airbone  dust}
    Ŭ3={temprature,pressure}

    Now, we computed the IFHSS by using the attributive values through the following mapping: ϐ :Ŭ ϸ and ϔ : Ŭ ϸ.

    In this example, we have calculated the AQI of the different cities based on the data set having different pollutant factors and presented in Tables 1 and 2. Using the proposed distance and similarity measure, we calculated the values of the attributes and alternatives, as shown in Tables 37, and Table 8 represents the mean of the affective factors to geographical region which deteriorate the quality of air. The air quality index of each region has been calculated in Table 9, and its graphical order is represented in Figure 1, which shows that ϸ1 region has good air quality as compared to ϸ2 and n3. The AQI of geographical region ϸ3 is very high and can indicate adverse effects on human health. We found that our technique for calculating the air quality index of various regions is helpful for selection. The AQI of various regions can easily be calculated by using this mathematical technique.

    Table 1.  Decision-making matrix from affective factors to geographical region.
    Regions (ϸ) Air pollutant
    (SO2)
    Human activities (transport exhaust) Humidity
    (level)
    ϸ1
    ϸ2
    ϸ3
    (0.99, 0.50)
    (0.60, 0.40)
    (0.20, 0.70)
    (1.00, 0.10)
    (0.60, 0.23)
    (0.40, 0.50)
    (0.06, 0.10)
    (0.10, 0.20)
    (0.20, 0.10)

     | Show Table
    DownLoad: CSV
    Table 2.  Decision-making matrix from ideal affective factors to geographical region.
    Regions (ϸ) Air pollutant
    (SO2)
    Human activities (transport exhaust) Humidity
    (level)
    ϸ1
    ϸ2
    ϸ3
    (0.06, 0.02)
    (0.04, 0.01)
    (0.01, 0.00)
    (0.40, 0.00)
    (0.30, 0.10)
    (0.10, 0.00)
    (0.26, 0.20)
    (0.28, 0.30)
    (0.30, 0.10)

     | Show Table
    DownLoad: CSV
    Table 3.  Distance similarity measures using Ƴ1(ϐ,ϔ).
    Similarity measures Regions (ϸ) Air pollutant
    (SO2)
    Human activities (transport exhaust) Humidity
    (level)
    Ƴ1(ϐ,ϔ) ϸ1
    ϸ2
    ϸ3
    0.8915
    0.9586
    0.9583
    0.8853
    0.9525
    0.9521
    0.8841
    0.9483
    0.9510

     | Show Table
    DownLoad: CSV
    Table 4.  Distance similarity measures using Ƴ2(ϐ,ϔ).
    Similarity measures Regions (ϸ) Air pollutant
    (SO2)
    Human activities (transport exhaust) Humidity
    (level)
    Ƴ2(ϐ,ϔ) ϸ1
    ϸ2
    ϸ3
    0.8119
    0.9386
    0.9230
    0.8031
    0.9303
    0.9190
    0.7943
    0.9210
    0.9210

     | Show Table
    DownLoad: CSV
    Table 5.  Distance similarity measures using Ƴ3(ϐ,ϔ).
    Similarity measures Regions (ϸ) Air pollutant
    (SO2)
    Human activities (transport exhaust) Humidity
    (level)
    Ƴ3(ϐ,ϔ) ϸ1
    ϸ2
    ϸ3
    0.2293
    0.6602
    0.5916
    0.2076
    0.6230
    0.5748
    0.1866
    0.5831
    0.5831

     | Show Table
    DownLoad: CSV
    Table 6.  Distance similarity measures using Ƴ4(ϐ,ϔ).
    Similarity measures Regions (ϸ) Air pollutant
    (SO2)
    Human activities (transport exhaust) Humidity
    (level)
    Ƴ4(ϐ,ϔ) ϸ1
    ϸ2
    ϸ3
    0.0675
    0.2022
    0.5365
    0.0496
    0.1387
    0.3381
    0.0157
    0.0292
    0.1249

     | Show Table
    DownLoad: CSV
    Table 7.  Distance similarity measures using Ƴ5(ϐ,ϔ).
    Similarity measures Regions (ϸ) Air pollutant
    (SO2)
    Human activities (transport exhaust) Humidity
    (temperature)
    Ƴ5(ϐ,ϔ) ϸ1
    ϸ2
    ϸ3
    0.0067
    0.0202
    0.0536
    0.0049
    0.0138
    0.0338
    0.0016
    0.0029
    0.0124

     | Show Table
    DownLoad: CSV
    Table 8.  Mean of distance similarity measures.
    Regions (ϸ) Air pollutant
    (SO2)
    Human activities (transport exhaust) Humidity
    (temperature)
    ϸ1
    ϸ2
    ϸ3
    0.4014
    0.5559
    0.6126
    0.3901
    0.5316
    0.5635
    0.3765
    0.4969
    0.5185

     | Show Table
    DownLoad: CSV
    Table 9.  Ranking of regions according to AQI.
    Regions (ϸ) AQI Ranking
    ϸ1
    ϸ2
    ϸ3
    0.3893
    0.5281
    0.5649
    1
    2
    3

     | Show Table
    DownLoad: CSV
    Figure 1.  Ranking of AQI for different geographical locations (cities).

    A company is recruiting a new candidate who works in HR. The job is to maintain the policies, understand the needs of the organization and make sure these needs are fulfilled on time. They have published the advertisement in the newspaper, and many candidates apply for it. Assume that there is a set of ȵ={ȵ1,ȵ2,ȵ3ȵn} candidates (alternative) chosen for an interview. To find the best HR manager for the organization, the group of decision-makers has been assigned tasks to select the candidates {ȵ1,ȵ2,ȵ3ȵn} based on ɱ different criteria { ɱ1,ɱ2,ɱ3,,ɱn } involving managing employee attitude {a1,a2,,an}, production booster {1,2,,n} and traditional personnel HRM {1,2,,n}. Consider ȵ={ȵ1,ȵ2,ȵ3ȵn} and

    ɱ={ɱ1(managing  employee  attitute)ɱ2(production  booster)ɱ3(traditional  personnel  HRM)}

    where

    ɱ1={resolve  conflicts,management  survey}
    ɱ2={problem  solving  groups,information  sharing,organization  development}
    ɱ3={hiring,promotion,change  managment}

    Now, we construct the IFHSS by using the attributive values with the following mappings: ƙ:ɱP(ȵ) and Ƴ:ɱP(ȵ).

    In this example, by using the proposed distance similarity measure, we calculated the similarity measures Ƴ(ƙ,Ƴ) shown in Tables 1017, and Table 18 represents the means of the respective attributes corresponding to each candidate. The attributive values corresponding to each candidate are presented in Table 18, and ranking of the candidates is made in descending order of the similarity values, which shows that ȵ2 is the best candidate who is eligible for HR manager.

    Table 10.  Decision-making matrix from criteria to alternatives.
    Candidates (ȵ) Managing Employee
    Attitude (resolve  conflicts)
    Production Booster (problem  solving
    groups)
    Traditional Personnel
    HRM
    (hiring)
    ȵ 1
    ȵ 2
    ȵ 3
    (0.70, 0.10)
    (0.60, 0.20)
    (0.55, 0.35)
    (0.99, 0.10)
    (0.45, 0.27)
    (0.65, 0.20)
    (0.36, 0.10)
    (0.40, 0.20)
    (0.30, 0.10)

     | Show Table
    DownLoad: CSV
    Table 11.  Decision-making matrix from ideal affective criteria to alternatives.
    Candidates (ȵ) Managing Employee
    Attitude (resolve  conflicts)
    Production Booster (problem  solving
    groups)
    Traditional Personnel
    HRM
    (hiring)
    ȵ 1
    ȵ 2
    ȵ 3
    (0.80, 0.02)
    (0.60, 0.25)
    (0.50, 0.30)
    (0.30, 0.25)
    (0.40, 0.15)
    (0.50, 0.00)
    (0.40, 0.20)
    (0.30, 0.28)
    (0.20, 0.10)

     | Show Table
    DownLoad: CSV
    Table 12.  Distance similarity measures using Ƴ1(ƙ,Ƴ).
    Similarity measures Candidates (ȵ) Managing Employee
    Attitude (resolve  conflicts)
    Production Booster (problem  solving
    groups)
    Traditional Personnel
    HRM
    (hiring)
    Ƴ1(ƙ,Ƴ) ȵ 1
    ȵ 2
    ȵ 3
    0.9408
    0.9778
    0.9542
    0.9523
    0.9888
    0.9767
    0.9510
    0.9784
    0.9826

     | Show Table
    DownLoad: CSV
    Table 13.  Distance similarity measures using Ƴ2(ƙ,Ƴ).
    Similarity measures Candidates (ȵ) Managing Employee
    Attitude (resolve  conflicts)
    Production Booster (problem  solving
    groups)
    Traditional Personnel
    HRM
    (hiring)
    Ƴ2(ƙ,Ƴ) ȵ 1
    ȵ 2
    ȵ 3
    0.8909
    0.9607
    0.9260
    0.9151
    0.9857
    0.9609
    0.9110
    0.9697
    0.9725

     | Show Table
    DownLoad: CSV
    Table 14.  Distance similarity measures using Ƴ3(ƙ,Ƴ).
    Similarity measures Candidates (ȵ) Managing Employee
    Attitude (resolve  conflicts)
    Production Booster (problem  solving
    groups)
    Traditional Personnel
    HRM
    (hiring)
    Ƴ3(ƙ,Ƴ) ȵ 1
    ȵ 2
    ȵ 3
    0.4668
    0.7686
    0.6042
    0.5590
    0.9090
    0.7694
    0.5425
    0.8165
    0.8320

     | Show Table
    DownLoad: CSV
    Table 15.  Distance similarity measures using Ƴ4(ƙ,Ƴ).
    Similarity measures Candidates (ȵ) Managing Employee
    Attitude (resolve  conflicts)
    Production Booster (problem  solving
    groups)
    Traditional Personnel
    HRM
    (hiring)
    Ƴ4(ƙ,Ƴ) ȵ 1
    ȵ 2
    ȵ 3
    0.3303
    0.6278
    0.3434
    0.3537
    0.7348
    0.5615
    0.3189
    0.5216
    0.6377

     | Show Table
    DownLoad: CSV
    Table 16.  Distance similarity measures using Ƴ5(ƙ,Ƴ).
    Similarity measures Candidates (ȵ) Managing Employee
    Attitude (resolve  conflicts)
    Production Booster (problem  solving
    groups)
    Traditional Personnel
    HRM
    (hiring)
    Ƴ5(ƙ,Ƴ) ȵ 1
    ȵ 2
    ȵ 3
    0.0330
    0.0627
    0.0343
    0.0353
    0.0734
    0.0561
    0.0319
    0.0521
    0.0637

     | Show Table
    DownLoad: CSV
    Table 17.  Means of distance similarity measures.
    Candidates (ȵ) Managing Employee
    Attitude (resolve  conflicts)
    Production
    Booster (problem  solving
    groups)
    Traditional Personnel
    HRM
    (hiring)
    ȵ 1
    ȵ 2
    ȵ 3
    0.5323
    0.6795
    0.5724
    0.5630
    0.7383
    0.6649
    0.5510
    0.6676
    0.6977

     | Show Table
    DownLoad: CSV
    Table 18.  Ranking of candidates by distance similarity measures.
    Candidates (ȵ) Mean similarity value Ranking
    ȵ 1
    ȵ 2
    ȵ 3
    0.5487
    0.6951
    0.6450
    3
    1
    2

     | Show Table
    DownLoad: CSV

    Intuitionistic hypersoft set theory is highly beneficial in solving decision-making issues, but it only deals with attributes of alternatives about characteristics. Thus, direct comparison of two sets of variables is not easy, and if a DM wants to analyze the comparison between two sets, then it can be done with the help of similarity measures and distance measures. In this regard, [26] introduces the intuitionistic hypersoft set. Using the definition, we have proposed the similarity measures and distance measures under the intuitionistic hypersoft set environment. To discuss the effectiveness and applicability of the proposed study, two case studies have been considered. Comparison with the existing techniques is presented in Table 19. The result shows that proposed distance and similarity measures are helpful for selection when an attribute is further sub-divided. Furthermore, if the DM increases the number of the parameters and sub-divided sets, this technique can be employed in the same manner easily. The suggested method analyzes the interrelationships of qualities in practical application, while existing approaches cannot.

    Table 19.  Comparison of the current and prior studies.
    Researcher Set Structure Membership
    value
    Non-membership value Based on
    Distance, Similarity measure
    Weighted measurement of distance Computation of max-min distance measure
    Yolcu, A. et al. and Debnath, S. [24,25] FHS yes no no no no
    Yolcu, A. et al. [26] IFHS yes yes no no no
    Saqlain M. et al. and Jafar et al. [37,38] NHSS yes yes yes yes no
    Musa S. Y., & Asaad B. A. [42] BPHS yes yes no no no
    Smarandache, F. [43] Indetermhypersoft set yes yes no no no
    Saqlain, M. et al. (proposed) IFHSS yes yes yes yes yes

     | Show Table
    DownLoad: CSV

    The superiority of the proposed technique is presented below:

    (1) To obtain accuracy and precision in an uncertain environment, we cannot ignore the sub-attributive values, and the hypersoft set structure is the only set in which sub-attributes are considered to account.

    (2) IFHSS is practical for sorting out the uncertainty and fuzziness within the problems and describing the degrees of membership and non-membership values.

    (3) Comparison of two sets is difficult when the DM has to consider the importance of attributive values. Then, similarity and distance measures can be used.

    A comparison has been made in Table 19, which presents the hybrids of hypersoft set structures with distance measure, weighted distance measure and distance based on min-max. The results of the Table 19 show that the distance measures based on the min-max approach are new and practical.

    Intuitionistic hypersoft set theory is highly beneficial in solving decision-making issues, but it only deals with attributes of alternatives about characteristics. Thus, direct comparison of two sets of variables is not easy, and if a DM wants to analyze the comparison between two sets, then it can be done with the help of similarity measures and distance measures. To cope with situations involving multiple criteria and multiple-attribute decision-making problems, we suggested several distances and similarity measures for IFHSS by using aggregate operators. Also, we have proved some new results, theorems and axioms to check the validity of the defined study and discussed a real-life problem. The direction of this research work can be extended to the neutrosophic hypersoft set, m-polar hypersoft set, bipolar hypersoft set [42], indetermhypersoft set [43] and other uncertain environments.

    The authors are highly thankful to the Editor-in-chief and the referees for their valuable comments and suggestions for improving the quality of our paper. This work is supported in part by the National Natural Science Foundation of China under Grant 11971384.

    The authors declare that they have no competing interests.



    [1] L. Cooper, Location-allocation problems, Oper. Res., 11 (1963), 331–343. https://doi.org/10.1287/opre.11.3.331 doi: 10.1287/opre.11.3.331
    [2] L. F. Gelders, L. M. Pintelon, L. N. V. Wassenhove, A location-allocation problem in a large Belgian brewery, Eur. J. Oper. Res., 28 (1987), 196–206. https://doi.org/10.1016/0377-2217(87)90218-9 doi: 10.1016/0377-2217(87)90218-9
    [3] L. Nick, A. V. Felipe, Points of distribution location and inventory management model for post-disaster humanitarian logistics, Transport. Res. Part E: Logist. Transport. Rev., 116 (2018), 1–24. https://doi.org/10.1016/j.tre.2018.05.003 doi: 10.1016/j.tre.2018.05.003
    [4] A. Moreno, D. Alem, D. Ferreira, A. Clark, An effective two-stage stochastic multi-trip location-transportation model with social concerns in relief supply chains, Eur. J. Oper. Res., 269 (2018), 1050–1071. https://doi.org/10.1016/j.ejor.2018.02.022 doi: 10.1016/j.ejor.2018.02.022
    [5] C. A. Irawan, D. Jones, Formulation and solution of a two-stage capacitated facility location problem with multilevel capacities, Ann. Oper. Res., 272 (2019), 41–67. https://doi.org/10.1007/s10479-017-2741-7 doi: 10.1007/s10479-017-2741-7
    [6] Z. M. Liu, R. P. Huang, S. T. Shao, Data-driven two-stage fuzzy random mixed integer optimization model for facility location problems under uncertain environment, AIMS Math., 7 (2022), 13292–13312. https://doi.org/10.3934/math.2022734 doi: 10.3934/math.2022734
    [7] N. Noyan, Risk-averse two-stage stochastic programming with an application to disaster management, Comput. Oper. Res., 39 (2012), 541–559. https://doi.org/10.1016/j.cor.2011.03.017 doi: 10.1016/j.cor.2011.03.017
    [8] N. Ricciardi, R. Tadei, A. Grosso, Optimal facility location with random throughput costs, Comput. Oper. Res., 29 (2002), 593–607. https://doi.org/10.1016/S0305-0548(99)00090-8 doi: 10.1016/S0305-0548(99)00090-8
    [9] S. Baptista, M. I. Gomes, A. P. Barbosa-Povoa, A two-stage stochastic model for the design and planning of a multi-product closed loop supply chain, Comput. Aided Chem. Eng., 30 (2012), 412–416. https://doi.org/10.1016/B978-0-444-59519-5.50083-6 doi: 10.1016/B978-0-444-59519-5.50083-6
    [10] J. Qin, H. Xiang, Y. Ye, L. L. Ni, A simulated annealing methodology to multiproduct capacitated facility location with stochastic demand, Sci. World J., 2015, 1–9. https://doi.org/10.1155/2015/826363 doi: 10.1155/2015/826363
    [11] I. Litvinchev, M. Mata, L. Ozuna, Lagrangian heuristic for the two-stage capacitated facility location problem, Appl. Comput. Math., 11 (2012), 137–146.
    [12] Z. M. Liu, S. J. Qu, Z. Wu, D. Q. Qu, J. H. Du, Two-stage mean-risk stochastic mixed integer optimization model for location-allocation problems under uncertain environment, J. Ind. Manag. Optim., 17 (2021), 2783–2804. https://doi.org/10.3934/jimo.2020094 doi: 10.3934/jimo.2020094
    [13] A. L. Soyster, Convex programming with set-inclusive constraints and applications to inexact linear programming, Oper. Res., 21 (1973), 1154–1157.
    [14] A. Ben-Tal, L. E. Ghaoui, A. Nemirovski, Robust optimization, Princeton: Princeton University Press, 2009.
    [15] D. Bertsimas, D. B. Brown, C. Caramanis, Theory and applications of robust optimization, SIAM Rev., 53 (2011), 464–501. https://doi.org/10.1137/080734510 doi: 10.1137/080734510
    [16] Z. Liu, Z. Wu, Y. Ji, S. J. Qu, H. Raza, Two-stage distributionally robust mixed-integer optimization model for three-level location-allocation problems under uncertain environment, Phys. A: Stat. Mech. Appl., 572 (2021), 125872. https://doi.org/10.1016/j.physa.2021.125872 doi: 10.1016/j.physa.2021.125872
    [17] X. J. Chen, A. Shapiro, H. L. Sun, Convergence analysis of sample average approximation of two-stage stochastic generalized equation, SIAM J. Optim., 29 (2019), 135–161. https://doi.org/10.1137/17M1162822 doi: 10.1137/17M1162822
    [18] X. J. Chen, H. L. Sun, H. F. Xu, Discrete approximation of two-stage stochastic and distributionally robust linear complementarity problems, Math. Program., 177 (2019), 255–289. https://doi.org/10.1007/s10107-018-1266-4 doi: 10.1007/s10107-018-1266-4
    [19] R. P. Huang, S. J. Qu, X. G. Yang, Z. M. Liu, Multi-stage distributionally robust optimization with risk aversion, J. Ind. Manag. Optim., 17 (2021), 233–259. https://doi.org/10.3934/jimo.2019109 doi: 10.3934/jimo.2019109
    [20] A. Klose, An LP-based heuristic for two-stage capacitated facility location problems, J. Oper. Res. Soc., 50 (1999), 157–166. https://doi.org/10.1057/palgrave.jors.2600675 doi: 10.1057/palgrave.jors.2600675
    [21] B. Li, Q. Xun, J. Sun, K. L. Teo, C. J. Yu, A model of distributionally robust two-stage stochastic convex programming with linear recourse, Appl. Math. Model., 58 (2018), 86–97. https://doi.org/10.1016/j.apm.2017.11.039 doi: 10.1016/j.apm.2017.11.039
    [22] B. Li, J. Sun, H. L. Xu, M. Zhang, A class of two-stage distributionally robust games, J. Ind. Manag. Optim., 15 (2019), 387–400. https://doi.org/10.3934/jimo.2018048 doi: 10.3934/jimo.2018048
    [23] Z. M. Liu, S. J. Qu, M. Goh, Z. Wu, R. P. Huang, G. Ma, Two-stage mean-risk stochastic optimization model for port cold storage capacity under pelagic fishery yield uncertainty, Phys. A: Stat. Mech. Appl., 541 (2020), 123338. https://doi.org/10.1016/j.physa.2019.123338 doi: 10.1016/j.physa.2019.123338
    [24] V. Rico-Ramirez, G. A. Iglesias-Silva, F. Gomez-De la Cruz, S. Hernandez-Castro, Two-stage stochastic approach to the optimal location of booster disinfection stations, Ind. Eng. Chem. Res., 46 (2007), 6284–6292. https://doi.org/10.1021/ie070141a doi: 10.1021/ie070141a
    [25] J. Sun, L. Z. Liao, B. Rodrigues, Quadratic two-stage stochastic optimization with coherent measures of risk, Math. Program., 168 (2018), 599–613. https://doi.org/10.1007/s10107-017-1131-x doi: 10.1007/s10107-017-1131-x
    [26] M. Dillon, F. Oliveira, B. Abbasi, A two-stage stochastic programming model for inventory management in the blood supply chain, Int. J. Prod. Econ., 187 (2017), 27–41. https://doi.org/10.1016/j.ijpe.2017.02.006 doi: 10.1016/j.ijpe.2017.02.006
    [27] K. L. Liu, Q. F. Li, Z. H. Zhang, Distributionally robust optimization of an emergency medical service station location and sizing problem with joint chance constraints, Transport. Res. Part B-Meth., 119 (2019), 79–101. https://doi.org/10.1016/j.trb.2018.11.012 doi: 10.1016/j.trb.2018.11.012
    [28] F. Maggioni, F. A. Potra, M. Bertocchi, A scenario-based framework for supply planning under uncertainty: stochastic programming versus robust optimization approaches, Comput. Manag. Sci., 14 (2017), 5–44. https://doi.org/10.1007/s10287-016-0272-3 doi: 10.1007/s10287-016-0272-3
    [29] R. Venkitasubramony, G. K. Adil, Designing a block stacked warehouse for dynamic and stochastic product flow: a scenario-based robust approach, Int. J. Prod. Res., 57 (2019), 1345–1365. https://doi.org/10.1080/00207543.2018.1472402 doi: 10.1080/00207543.2018.1472402
    [30] C. L. Hu, X. Liu, J. Lu, A bi-objective two-stage robust location model for waste-to-energy facilities under uncertainty, Decis. Support Syst., 99 (2017), 37–50. https://doi.org/10.1016/j.dss.2017.05.009 doi: 10.1016/j.dss.2017.05.009
    [31] S. Mišković, Z. Stanimirović, I. Grujičić, Solving the robust two-stage capacitated facility location problem with uncertain transportation costs, Optim. Lett., 11 (2017), 1169–1184. https://doi.org/10.1007/s11590-016-1036-2 doi: 10.1007/s11590-016-1036-2
    [32] J. Portilla, Image restoration through l0 analysis-based sparse optimization in tight frames, 2009 16th IEEE International Conference on Image Processing (ICIP), 2009, 3909–3912. https://doi.org/10.1109/ICIP.2009.5413975 doi: 10.1109/ICIP.2009.5413975
    [33] M. Zibulevsky, M. Elad, L1-L2 optimization in signal and image processing, IEEE Signal Proc. Mag., 27 (2010), 76–88. https://doi.org/10.1109/MSP.2010.936023 doi: 10.1109/MSP.2010.936023
    [34] L. Xu, S. C. Zheng, J. Y. Jia, Unnatural l0 sparse representation for natural image deblurring, Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2013, 1107–1114.
    [35] B. Y. Liu, L. Yang, J. Z. Huang, P. Meer, L. G. Gong, C. Kulikowski, Robust and fast collaborative tracking with two stage sparse optimization, In: K. Daniilidis, P. Maragos, N. Paragios, Computer vision–ECCV 2010, Lecture Notes in Computer Science, Vol. 6314, Springer, Berlin, Heidelberg, 2010. https://doi.org/10.1007/978-3-642-15561-1_45
    [36] X. F. Zhu, X. L. Li, S. C. Zhang, Block-row sparse multiview multilabel learning for image classification, IEEE Trans. Cybern., 46 (2016), 450–461. https://doi.org/10.1109/TCYB.2015.2403356 doi: 10.1109/TCYB.2015.2403356
    [37] H. Zhang, V. M. Patel, Convolutional sparse and low-rank coding-based image decomposition, IEEE Trans. Image Proc., 27 (2018), 2121–2133. https://doi.org/10.1109/TIP.2017.2786469 doi: 10.1109/TIP.2017.2786469
    [38] D. Bertsimas, R. Cory-Wright, A scalable algorithm for sparse portfolio selection, INFORMS J. Comput., 34 (2022), 1489–1511. https://doi.org/10.1287/ijoc.2021.1127 doi: 10.1287/ijoc.2021.1127
    [39] M. Dyer, L. Stougie, Computational complexity of stochastic programming problems, Math. Program., 106 (2006), 423–432. https://doi.org/10.1007/s10107-005-0597-0 doi: 10.1007/s10107-005-0597-0
    [40] M. Bansal, K. L. Huang, S. Mehrotra, Decomposition algorithms for two-stage distributionally robust mixed binary programs, SIAM J. Optim., 28 (2018), 2360–2383. https://doi.org/10.1137/17M1115046 doi: 10.1137/17M1115046
    [41] M. Bansal, S. Mehrotra, On solving two-stage distributionally robust disjunctive programs with a general ambiguity set, Eur. J. Oper. Res., 279 (2019), 296–307. https://doi.org/10.1016/j.ejor.2019.05.033 doi: 10.1016/j.ejor.2019.05.033
    [42] L. R. Medsker, Hybrid intelligent systems, Boston: Kluwer Academic Publishers, 1995.
    [43] M. Rahman, N. S. Chen, M. M. Islam, A. Dewand, H. R. Pourghasemie, R. M. A. Washakh, et al., Location-allocation modeling for emergency evacuation planning with GIS and remote sensing: a case study of Northeast Bangladesh, Geosci. Front., 12 (2021), 101095. https://doi.org/10.1016/j.gsf.2020.09.022 doi: 10.1016/j.gsf.2020.09.022
    [44] M. Y. Qi, R. W. Jiang, S. Q. Shen, Sequential competitive facility location: exact and approximate algorithms, Oper. Res., 2022. https://doi.org/10.1287/opre.2022.2339 doi: 10.1287/opre.2022.2339
    [45] M. Rahbari, S. H. R. Hajiagha, H. A. Mahdiraji, F. R. Dorcheh, J. A. Garza-Reyes, A novel location-inventory-routing problem in a two-stage red meat supply chain with logistic decisions: evidence from an emerging economy, Int. J. Syst. Cybern., 4 (2022), 1498–1531.
    [46] Y. J. Yang, Y. Q. Yin, D. J. Wang, J. Ignatius, T. C. E. Cheng, L. Dhamotharan, Distributionally robust multi-period location-allocation with multiple resources and capacity levels in humanitarian logistics, Eur. J. Oper. Res., 2022. https://doi.org/10.1016/j.ejor.2022.06.047 doi: 10.1016/j.ejor.2022.06.047
    [47] T. Q. Liu, F. Saldanha-da-Gama, S. M. Wang, Y. C. Mao, Robust stochastic facility location: sensitivity analysis and exact solution, INFORMS J. Comput., 34 (2022), 2776–2803. https://doi.org/10.1287/ijoc.2022.1206 doi: 10.1287/ijoc.2022.1206
    [48] K. S. Shehadeh, Distributionally robust optimization approaches for a stochastic mobile facility fleet sizing, routing, and scheduling problem, Transport. Sci., 2022. https://doi.org/10.1287/trsc.2022.1153 doi: 10.1287/trsc.2022.1153
    [49] H. Soleimani, P. Chhetri, A. M. Fathollahi-Fard, S. M. J. Mirzapour Al-e-Hashem, S. Shahparvari, Sustainable closed-loop supply chain with energy efficiency: lagrangian relaxation, reformulations, and heuristics, Ann. Oper. Res., 318 (2022), 531–556. https://doi.org/10.1007/s10479-022-04661-z doi: 10.1007/s10479-022-04661-z
    [50] S. Kim, S. Weber, Simulation methods for robust risk assessment and the distorted mix approach, Eur. J. Oper. Res., 298 (2022), 380–398. https://doi.org/10.1016/j.ejor.2021.07.005 doi: 10.1016/j.ejor.2021.07.005
    [51] P. Embrechts, A. Schied, R. D. Wang, Robustness in the optimization of risk measures, Oper. Res., 70 (2021), 95–110. https://doi.org/10.1287/opre.2021.2147 doi: 10.1287/opre.2021.2147
    [52] W. Liu, L. Yang, B. Yu, Distributionally robust optimization based on kernel density estimation and mean-Entropic value-at-risk, INFORMS J. Optim., 2022. https://doi.org/10.1287/ijoo.2022.0076 doi: 10.1287/ijoo.2022.0076
    [53] A. M. Fathollahi-Fard, M. A. Dulebenets, M. Hajiaghaei-Keshteli, R. Tavakkoli-Moghaddam, M. Safaeian, H. Mirzahosseinian, Two hybrid meta-heuristic algorithms for a dual-channel closed-loop supply chain network design problem in the tire industry under uncertainty, Adv. Eng. Inform., 50 (2021), 101418. https://doi.org/10.1016/j.aei.2021.101418 doi: 10.1016/j.aei.2021.101418
    [54] N. Noyan, Risk-Averse stochastic modeling and optimization, INFORMS TutORials Oper. Res., 2018,221–254. https://doi.org/10.1287/educ.2018.0183 doi: 10.1287/educ.2018.0183
    [55] P. Artzner, F. Delbaen, J. M. Eber, D. Heath, Coherent measures of risk, Math. Finance, 9 (1999), 203–228. https://doi.org/10.1111/1467-9965.00068 doi: 10.1111/1467-9965.00068
    [56] W. Ogryczak, A. Ruszczynski, Dual stochastic dominance and related mean-risk models, SIAM J. Optim., 13 (2002), 60–78. https://doi.org/10.1137/S1052623400375075 doi: 10.1137/S1052623400375075
    [57] R. T. Rockafellar, S. Uryasev, Optimization of conditional value-at-risk, J. Risk, 2 (2000), 21–41.
    [58] P. M. Esfahani, D. Kuhn, Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations, Math. Program., 171 (2018), 115–166. https://doi.org/10.1007/s10107-017-1172-1 doi: 10.1007/s10107-017-1172-1
    [59] M. Clerc, The swarm and queen: towards a deterministic and adaptive particle swarm optimization, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99, 3 (1999), 1951–1957. https://doi.org/10.1109/CEC.1999.785513 doi: 10.1109/CEC.1999.785513
    [60] M. Clerc, J. Kennedy, The particle swarm-explosion, stability, and convergence in a multidimensional complex space, IEEE T. Evolut. Comput., 6 (2002), 58–73. https://doi.org/10.1109/4235.985692 doi: 10.1109/4235.985692
    [61] J. Kennedy, R. C. Eberhart, A discrete binary version of the particle swarm algorithm, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation, 5 (1997), 4104–4108. https://doi.org/10.1109/ICSMC.1997.637339 doi: 10.1109/ICSMC.1997.637339
    [62] Z. Ji, H. L. Liao, Q. H. Wu, Particle swarm optimization algorithm and its application, Science Press, 2009.
    [63] S. Gao, K. Tang, X. Jiang, J. Yang, Convergence analysis of particle swarm optimization algorithm, Sci. Technol. Eng., 6 (2006), 1625–1627.
    [64] J. Nocedal, S. Wright, Numerical optimization, Springer, 2006.
    [65] J. Moosavi, A. M. Fathollahi-Fard, M. A. Dulebenets, Supply chain disruption during the COVID-19 pandemic: recognizing potential disruption management strategies, Int. J. Disast. Risk Re., 75 (2022), 102983. https://doi.org/10.1016/j.ijdrr.2022.102983 doi: 10.1016/j.ijdrr.2022.102983
  • This article has been cited by:

    1. Tareq M. Al-shami, Abdelwaheb Mhemdi, A weak form of soft α-open sets and its applications via soft topologies, 2023, 8, 2473-6988, 11373, 10.3934/math.2023576
    2. Muhammad Imran Harl, Muhammad Saeed, Muhammad Haris Saeed, Sanaa Ahmed Bajri, Alhanouf Alburaikan, Hamiden Abd El-Wahed Khalifa, Development of an Investment Sector Selector Using a TOPSIS Method Based on Novel Distances and Similarity Measures for Picture Fuzzy Hypersoft Sets, 2024, 12, 2169-3536, 45118, 10.1109/ACCESS.2024.3380025
    3. Liting Jing, Xiaoyan Fan, Di Feng, Congda Lu, Shaofei Jiang, A patent text-based product conceptual design decision-making approach considering the fusion of incomplete evaluation semantic and scheme beliefs, 2024, 157, 15684946, 111492, 10.1016/j.asoc.2024.111492
    4. Tareq M. Al-shami, Zanyar A. Ameen, Abdelwaheb Mhemdi, The connection between ordinary and soft σ-algebras with applications to information structures, 2023, 8, 2473-6988, 14850, 10.3934/math.2023759
    5. Anam Habib, Zareen A. Khan, Muhammad Riaz, Dragan Marinkovic, Performance Evaluation of Healthcare Supply Chain in Industry 4.0 with Linear Diophantine Fuzzy Sine-Trigonometric Aggregation Operations, 2023, 11, 2227-7390, 2611, 10.3390/math11122611
    6. Hanan Alolaiyan, Abdul Razaq, Humaira Ashfaq, Dilshad Alghazzawi, Umer Shuaib, Jia-Bao Liu, Improving Similarity Measures for Modeling Real-World Issues With Interval-Valued Intuitionistic Fuzzy Sets, 2024, 12, 2169-3536, 10482, 10.1109/ACCESS.2024.3351205
    7. Jeevitha Kannan, Vimala Jayakumar, Mahalakshmi Pethaperumal, Nithya Sri Shanmugam, Linear diophantine multi-fuzzy soft similarity measures: An analysis on alternative-fuel, 2024, 10641246, 1, 10.3233/JIFS-219415
    8. Jawad Ali, Norm-based distance measure of q-rung orthopair fuzzy sets and its application in decision-making, 2023, 42, 2238-3603, 10.1007/s40314-023-02313-x
    9. Sijia Zhu, Zhe Liu, Atiqe Ur Rahman, Novel Distance Measures of Picture Fuzzy Sets and Their Applications, 2024, 49, 2193-567X, 12975, 10.1007/s13369-024-08925-7
    10. Sijia Zhu, Zhe Liu, Distance measures of picture fuzzy sets and interval-valued picture fuzzy sets with their applications, 2023, 8, 2473-6988, 29817, 10.3934/math.20231525
    11. Yuchen Wu, Ziwen Wang, Lei Zhang, A Novel Clark Distance-Based Decision-Making Algorithm on Intuitionistic Fuzzy Sets, 2024, 13, 2079-9292, 3481, 10.3390/electronics13173481
    12. Muhammad Ahsan, Lixin Tian, Ruijin Du, Amel Ali Alhussan, El-Sayed M. El-kenawy, Enhancing environmental sustainability through code-driven process integration in the petrochemical industry, 2024, 12, 2296-665X, 10.3389/fenvs.2024.1389639
    13. Gitesh Suri, Neeraj Gandotra, Abhishek Guleria, Namita Saini, Novel distance measure for q-rung orthopair fuzzy sets and its application, 2025, 1327-2314, 10.1177/13272314241297273
  • Reader Comments
  • © 2023 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(2022) PDF downloads(168) Cited by(2)

Figures and Tables

Figures(7)  /  Tables(11)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog