Loading [MathJax]/jax/element/mml/optable/GeneralPunctuation.js
Research article Special Issues

Dynamic modeling of discrete leader-following consensus with impulses

  • Received: 29 July 2019 Accepted: 16 August 2019 Published: 16 September 2019
  • MSC : 39A30, 92B20

  • A leader-following consensus of discrete-time multi-agent systems with nonlinear intrinsic dynamics and impulses is investigated. We propose and prove conditions ensuring a leader-following consensus. Numerical examples are given to illustrate effectiveness of the obtained results. Also, the necessity and sufficiency of the obtained conditions are shown.

    Citation: Snezhana Hristova, Kremena Stefanova, Angel Golev. Dynamic modeling of discrete leader-following consensus with impulses[J]. AIMS Mathematics, 2019, 4(5): 1386-1402. doi: 10.3934/math.2019.5.1386

    Related Papers:

    [1] Shahid Mubeen, Rana Safdar Ali, Iqra Nayab, Gauhar Rahman, Kottakkaran Sooppy Nisar, Dumitru Baleanu . Some generalized fractional integral inequalities with nonsingular function as a kernel. AIMS Mathematics, 2021, 6(4): 3352-3377. doi: 10.3934/math.2021201
    [2] Jian-Mei Shen, Saima Rashid, Muhammad Aslam Noor, Rehana Ashraf, Yu-Ming Chu . Certain novel estimates within fractional calculus theory on time scales. AIMS Mathematics, 2020, 5(6): 6073-6086. doi: 10.3934/math.2020390
    [3] Hari M. Srivastava, Artion Kashuri, Pshtiwan Othman Mohammed, Abdullah M. Alsharif, Juan L. G. Guirao . New Chebyshev type inequalities via a general family of fractional integral operators with a modified Mittag-Leffler kernel. AIMS Mathematics, 2021, 6(10): 11167-11186. doi: 10.3934/math.2021648
    [4] Shuang-Shuang Zhou, Saima Rashid, Erhan Set, Abdulaziz Garba Ahmad, Y. S. Hamed . On more general inequalities for weighted generalized proportional Hadamard fractional integral operator with applications. AIMS Mathematics, 2021, 6(9): 9154-9176. doi: 10.3934/math.2021532
    [5] Miguel Vivas-Cortez, Pshtiwan O. Mohammed, Y. S. Hamed, Artion Kashuri, Jorge E. Hernández, Jorge E. Macías-Díaz . On some generalized Raina-type fractional-order integral operators and related Chebyshev inequalities. AIMS Mathematics, 2022, 7(6): 10256-10275. doi: 10.3934/math.2022571
    [6] Shuang-Shuang Zhou, Saima Rashid, Saima Parveen, Ahmet Ocak Akdemir, Zakia Hammouch . New computations for extended weighted functionals within the Hilfer generalized proportional fractional integral operators. AIMS Mathematics, 2021, 6(5): 4507-4525. doi: 10.3934/math.2021267
    [7] Erhan Set, Ahmet Ocak Akdemir, Abdurrahman Gözpınar, Fahd Jarad . Ostrowski type inequalities via new fractional conformable integrals. AIMS Mathematics, 2019, 4(6): 1684-1697. doi: 10.3934/math.2019.6.1684
    [8] Miguel Vivas-Cortez, Muhammad Aamir Ali, Artion Kashuri, Hüseyin Budak . Generalizations of fractional Hermite-Hadamard-Mercer like inequalities for convex functions. AIMS Mathematics, 2021, 6(9): 9397-9421. doi: 10.3934/math.2021546
    [9] Fuat Usta, Hüseyin Budak, Mehmet Zeki Sarıkaya . Some new Chebyshev type inequalities utilizing generalized fractional integral operators. AIMS Mathematics, 2020, 5(2): 1147-1161. doi: 10.3934/math.2020079
    [10] Hu Ge-JiLe, Saima Rashid, Muhammad Aslam Noor, Arshiya Suhail, Yu-Ming Chu . Some unified bounds for exponentially tgs-convex functions governed by conformable fractional operators. AIMS Mathematics, 2020, 5(6): 6108-6123. doi: 10.3934/math.2020392
  • A leader-following consensus of discrete-time multi-agent systems with nonlinear intrinsic dynamics and impulses is investigated. We propose and prove conditions ensuring a leader-following consensus. Numerical examples are given to illustrate effectiveness of the obtained results. Also, the necessity and sufficiency of the obtained conditions are shown.


    Multi-attribute group decision-making (MAGDM) is a crucial component of contemporary decision theory, widely applied in various fields such as management, science and technology and the economy. Traditional MAGDM methods require decision data to be provided in the form of precise real numbers. However, due to the complex social environment, increasing uncertainty and the subjective nature of human thinking, solving practical decision problems using traditional MAGDM methods has become increasingly challenging. In order to solve this issue, scholars put forward fuzzy numbers as a measure of attributes. In 1965, Zadeh [1] introduced fuzzy sets (FS) and the utilization of membership degrees to resolve ambiguity in decision-making problems. Then, Atanassov [2] extended fuzzy sets to intuitionistic fuzzy sets (IFS), considering the degree of non-membership and hesitation. Yager [3] proposed the Pythagorean fuzzy set (PFS), which extends the range of membership and non-membership degrees to the sum of their squares not exceeding 1. Subsequently, Yager [4] proposed orthopair fuzzy sets (q-ROFS) as a new tool to deal with uncertainty on the basis of IFS and PFS, and extended membership and non-membership degrees to the space range where the sum of q powers does not exceed 1. Alrasheedi et al. [5] proposed q-rung orthopair fuzzy aggregation operators based on soft maximum, and applied them to material selection. Considering that the lack of available information prevents experts from quantifiable their judgments with an exact value when dealing with real life decision problems, Joshi et al. [6] proposed the concept of interval-valued q-rung orthopair fuzzy sets (q-RIVOFS), enabling decision makers to express their satisfaction and dissatisfaction with a set of alternatives in the form of intervals. Many scholars have done research on this issue. Wang et al. [7] examined the symmetry between attribute information and 4 distinct types of information aggregation operators applied to q-rung interval-valued orthopair fuzzy information in multi-attribute group decision-making. Zhang et al. [8] considered the interaction between decision makers and attributes, extending hesitant fuzzy sets to the q-rung interval-valued orthopair fuzzy environment. However, due to the complexity of decision environment and the uncertainty of decision information, it is necessary to further expand the application range of fuzzy sets, providing decision-makers with a more relaxed decision-making environment.

    In multi-attribute group decision making, the rational determination of attribute weights is a key problem. Due to the difficulty of accurately defining attribute weights in practical problems, various methods have been proposed by scholars to address this challenge. At present, there are three main methods for determining attribute weights: subjective weighting, objective weighting and combined weighting. The single subjective and objective methods often have subjective preferences or inconsistent objective laws, whereas the combined weighting method can integrate the advantages of both methods and mitigate their limitations. Common subjective weighting methods include the Best-Worst Method (BWM), Linear Barycentric Weighting Approach (LBWA), Full Consistency Method (FUCOM), ANP and so on. The BWM method [9,10,11] is relatively easy to understand and implement, but it may oversimplify complex decision scenarios, and only consider the best and worst attributes, possibly ignoring other crucial factors. The LBWA method [12,13] is simple, intuitive and easy to understand, but it heavily relies on attribute weights and ignores possible relationships and mutual influences among attributes. The FUCOM method [14,15] is a fuzzy compromise method that enables decision makers to better weigh different decision criteria in complex situations, but its calculation is relatively complex and easily affected by parameters, and the interpretation of the results may be relatively unintuitive. The ANP method [16,17] can be used to deal with complex decision-making environments involving the interdependence and feedback between criteria and alternatives. It enables decision-makers to obtain a clear understanding and analysis of the interdependencies among criteria, facilitating a more realistic and detailed decision-making process. It also helps overcome the uncertainty of outcomes caused by changes in personal preferences to some extent. The Entropy method [18,19,20] is a commonly used objective weighting method. It calculates the relative weight of each criterion based on the entropy value of each criterion, avoiding the problem of subjective weighting. This method allows for a more comprehensive assessment of the importance of each criterion, taking into account the amount of information it contains. Therefore, in order to consider the interaction between decision-makers and the relationship between attributes, the ANP method and entropy method are used in this paper to obtain subjective and objective weights, respectively. Additionally, considering the influence of subjective and objective weights on the combination weights, the deviation degree and dispersion degree of the subjective and objective weights are taken as objective functions to build a weight optimization model, and the optimal solution of the combination weights is iteratively solved by genetic algorithm. This approach aims to obtain more reasonable attribute weights by exploring the solution space through repeated selection, crossover, and mutation operations, gradually converging to the optimal or near-optimal solution.

    In order to better solve multi-attribute group decision problems, scholars have proposed various decision methods, such as VIKOR, Measurement of Alternatives and Ranking according to Compromise Solution (MARCOS), Multi-Attributive Border Approximation Area Comparison (MABAC), ELECTRE and so on. The VIKOR method [21,22,23] is a multi-criteria decision-making method that is relatively easy to understand and apply, allowing decision makers to combine their preferences and weights based on different criteria. However, it may not always provide a clear explanation of how to reach a compromise solution, which can hinder understanding of the decision-making process. The MARCOS method [24,25,26] is a decision-making method and software developed by Thomas L. Saaty. It provides a structured approach to decision-making, helping to organize and analyze decision-making factors effectively. However, it requires a comprehensive understanding of the method and its implementation, and obtaining accurate and reliable data can be challenging. The MABAC method [27,28] is a multi-criteria decision-making method for evaluating and ranking alternatives based on multiple criteria. It utilizes a geometric representation called the boundary approximation region, which facilitates visual comparison of alternatives and enhances understanding and communication in the decision-making process. However, it involves sequencing the boundary values and calculating the area of the boundary region, resulting in high computational complexity when dealing with large decision-making problems. Therefore, it may not be suitable for complex decision problems. The ELECTRE method, introduced by Almeida [29] in 2005, is a decision-making method that constructs a series of preference relationships and evaluates candidate solutions to determine the optimal solution. It can handle multiple criteria simultaneously, process large amounts of information and decision data, allow qualitative descriptions or ranking comparisons to express criteria relationships and provide clear decision results. It helps decision-makers understand and explain the final decision choices. Compared to VIKOR, MARCOS, and MABAC, the ELECTRE method has several advantages. Scholars have conducted research on the theory and application of the ELECTRE method. Chen [30] utilized a multi-criteria evaluation and selection approach using interval-valued intuitionistic fuzzy ELECTRE to analyze multi-criteria choices. Jagtap and Karande [31] proposed an improved Simos and AHP weight calculation method to improve the accuracy and consistency of weight calculation, and they applied it to the ELECTRE-I method based on M-polarity fuzzy sets to solve the selection problem of non-traditional machining processes. On the basis of existing research, it is evident that the ELECTRE method is an effective way to solve decision problems. Therefore, it is necessary to enhance and extend the ELECTRE method to a new fuzzy environment and propose a new multi-attribute group decision making method.

    To sum up, extensive research has been conducted on fuzzy sets and weights both domestically and internationally, resulting in significant achievements. Scholars have made important contributions to decision-making methods. However, further expansion of the desirable range of attribute values in existing studies is warranted. Additionally, there is a lack of research on decision-making situations that considers the interaction between decision-makers and the relationships between attributes. Exploring methods to enhance existing decision-making approaches is also a worthwhile area of study. Therefore, this paper proposes a multi-attribute group decision-making algorithm based on weight optimization and an improved ELECTRE method in the context of (p, q)-rung interval-valued orthopair fuzzy environment. The remainder of the paper is structured as follows. In Section 2, we introduce relevant definitions that will be utilized throughout this paper. In Section 3, the (p, q)-rung interval-valued orthopair fuzzy set is defined, along with its relevant concepts. In Section 4, we consider the mutual influence between decision-makers and the interrelationships between attributes and develop a weight optimization model. Based on the weight optimization model and the definition of the (p, q)-rung interval-valued orthopair fuzzy set, an improved (p, q)-rung interval-valued orthopair fuzzy ELECTRE method is presented. In Section 5, the efficacy and practicability of the proposed algorithm are validated via parametric analysis and contrastive analysis with related studies using the selection of investment companies as an illustration. In Section 6, we conclude this paper with a summary.

    This section provides an introduction to the fundamental concepts of fuzzy sets and the operational rules of fuzzy numbers.

    Definition 1. [2] Let Ω serve as the domain of discussion. An intuitionistic fuzzy set on Ω is denoted by I={<a,fI(a),hI(a)>|aΩ}, where fI:Ω[0,1] and hI:Ω[0,1] denote the membership and non-membership degrees, respectively, of an element a in Ω and satisfy the condition 0fI(a)+hI(a)1. The hesitation degree of element a belonging to set I is denoted by

    ψI(a)=1fI(a)hI(a).

    Definition 2. [32] Let Ω serve as the domain of discussion. A Pythagorean fuzzy set on Ω is denoted by R={<a,fR(a),hR(a)>|aΩ}, where fR:Ω[0,1] and hR:Ω[0,1] denote the membership and non-membership degrees, respectively, of an element a in Ω and satisfy the condition 0(fR(a))2+(hR(a))21. The hesitation degree of element a belonging to set R is denoted by

    ψR(a)=1(fR(a))2(hR(a))2.

    Definition 3. [4] Let Ω serve as the domain of discussion. A q-rung orthopair fuzzy set on Ω is denoted by Q={<a,fQ(a),hQ(a)>|aΩ}, where fQ:Ω[0,1] and hQ:Ω[0,1] denote the membership and non-membership degrees, respectively, of an element a in Ω and satisfy the condition 0(fQ(a))q+(hQ(a))q1, where q is a positive integer. The hesitation degree of element a belonging to set Q is denoted by

    ψQ(a)=q1(fQ(a))q(hQ(a))q,

    and for convenience, Q=(fQ,hQ) are called q-rung orthopair fuzzy numbers.

    Definition 4. [33] Let Ω serve as the domain of discussion. A Fermatean fuzzy set on Ω is denoted by F={<a,fF(a),hF(a)>|aΩ}, where fF:Ω[0,1] and hF:Ω[0,1] denote the membership and non-membership degrees, respectively, of an element a in Ω and satisfy 0(fF(a))3+(hF(a))31. The hesitation degree of element a belonging to set F is defined as

    ψF(a)=31(fF(a))3(hF(a))3.

    Definition 5. [6] Let Ω serve as the domain of discussion. A q-rung interval-valued orthopair fuzzy set on Ω is denoted by ˜Q={<a,f˜Q(a),h˜Q(a)>|aΩ}, where f˜Q:Ω[0,1] and h˜Q:Ω[0,1] denote the membership and non-membership degrees, respectively, of an element a in Ω, where f˜Q(a)=[fL˜Q(a),fR˜Q(a)][0,1] and h˜Q(a)=[hL˜Q(a),hR˜Q(a)][0,1], and for any aΩ, fq˜Q(a)0, hq˜Q(a)0, and for natural numbers q, we have 0(fR˜Q(a))q+(hR˜Q(a))q1. The hesitation degree that an element a belongs to set ˜Q is defined as

    ψ˜Q(a)=(ψL˜Q(a),ψR˜Q(a))=(q1(fR˜Q(a))q(hR˜Q(a))q,q1(fL˜Q(a))q(hL˜Q(a))q),

    and for convenience, ˜α=([fL˜Q,fR˜Q],[hL˜Q,hR˜Q]) is referred to as a q-rung interval-valued orthopair fuzzy number. Let Δ represent the set of all q-rung interval-valued orthopair fuzzy numbers.

    Given two q-rung interval-valued orthopair fuzzy numbers, denoted by ˜α=([fL˜α,fR˜α],[hL˜α,hR˜α])Δ and ˜β=([fL˜β,fR˜β],[hL˜β,hR˜β])Δ, their operational rules can be represented as below [4]:

    (1)˜α˜β=([((fL˜α)q+(hL˜β)q(fL˜α)q(hL˜β)q)1/1qq,((fR˜α)q+(hR˜β)q(fR˜α)q(hR˜β)q)1/1qq],[fL˜αhL˜β,fR˜αhR˜β]);

    (2)˜α˜β=([fL˜αhL˜β,fR˜αhR˜β],[((fL˜α)q+(hL˜β)q(fL˜α)q(hL˜β)q)1/1qq,((fR˜α)q+(hR˜β)q(fR˜α)q(hR˜β)q)1/1qq]);

    (3)λ˜α=([(1(1(fL˜α)q)λ)1/1qq,(1(1(fR˜α)q)λ)1/1qq],[(hL˜α)λ,(hR˜α)λ]),λ>0;

    (4)(˜α)λ=([(fL˜α)λ,(fR˜α)λ],[(1(1(hL˜α)q)λ)1/1qq,(1(1(hR˜α)q)λ)1/1qq]),λ>0;

    (5)˜αc=([hL˜α,hR˜α],[fL˜α,fR˜α]).

    Example 1 is used to illustrate the limitations of the existing q-rung interval-valued orthopair fuzzy set.

    Example 1. Suppose that ([0.71, 0.8], [0.61, 0.8]) is a q-rung interval-valued orthopair fuzzy number, where q is a positive real number. When applying definition 5, it is found that 0.83+0.83 > 1. This calculation reveals that the fuzzy number does not meet the value range defined by the q-rung interval-valued orthopair fuzzy set. This discrepancy indicates the need for expanding the desirable range of attribute values to effectively address real-world situations.

    Example 1 highlights the inadequacy of the existing definition and the limited desirable range of attribute values for q-rung interval-valued orthopair fuzzy sets. In the following, the definition of a (p, q)-rung interval-valued orthopair fuzzy set ((p, q)-RIVOFS) is proposed to make up for the deficiency, and its desirable range is further extended, which can deal with the uncertainty of multi-attribute group decision more effectively than a q-rung interval-valued orthopair fuzzy set.

    Definition 6. Let Ω serve as the domain of discussion. A (p, q)-rung interval-valued orthopair fuzzy set on Ω is denoted by ={<x,f(x),h(x)>|xΩ}, where f(x)=[fL(x),fR(x)] and h(x)=[hL(x),hR(x)] are interval numbers belonging to the interval [0, 1], denoting the membership and non-membership degrees, respectively, of an element x in Ω. For any xΩ, and for natural numbers p and q, we have 0(fR(x))p+(hR(x))q1. The hesitation degree that an element x belongs to set is defined as

    π(x)=[πL(x),πR(x)]=[k1(fR(x))p(hR(x))q,k1(fL(x))p(hL(x))q].

    For convenience, α=([fLα,fRα],[hLα,hRα]) is referred to as a (p, q)-rung interval-valued orthopair fuzzy number.

    If α=([fLα,fRα],[hLα,hRα]) and β=([fLβ,fRβ],[hLβ,hRβ]) are two (p, q)-rung interval-valued orthopair fuzzy numbers, then the following arithmetic rules hold:

    (1)αβ=([k(fLα)p+(hLβ)q(fLα)p(hLβ)q,k(fRα)p+(hRβ)q(fRα)p(hRβ)q],[fLαhLβ,fRαhRβ]);

    (2)αβ=([fLαhLβ,fRαhRβ],[k(fLα)p+(hLβ)q(fLα)p(hLβ)q,k(fRα)p+(hRβ)q(fRα)p(hRβ)q]);

    (3)λα=([(1(1(fLα)p)λ)1/1kk,(1(1(fRα)p)λ)1/1kk],[(hLα)λ,(hRα)λ]),λ>0;

    (4)αλ=([(fLα)λ,(fRα)λ],[(1(1(hLα)q)λ)1/1kk,(1(1(hRα)q)λ)1/1kk]),λ>0;

    (5)αc=([hLα,hRα],[fLα,fRα]).

    To illustrate the necessity of extending the desirable range of attribute values and the validity of definition 6, we provide an illustrative example.

    Example 2. Suppose that ([0.71, 0.8], [0.61, 0.8]) is the attribute value of an element on set . When computed using q-RIVOFS, it is found that 0.83+0.83 > 1. However, when computed using (p, q)-RIVOFS, it yields 0.83+0.84 < 1. This comparison shows that (p, q)-RIVOFS can deal with a wider range of attribute values than q-RIVOFS.

    It can be seen from example 2 that the value of this attribute is not satisfied with the desirable spatial range of the q-rung interval-valued orthopair fuzzy set. Consequently, this case cannot be adequately addressed by the q-RIVOFS. However, the (p, q)-rung interval-valued orthopair fuzzy set can successfully capture this set of attribute values. Therefore, it is apparent that incorporating the parameter p into the (p, q)-rung interval-valued orthopair fuzzy set enhances its effectiveness in dealing with the uncertainty of multi-attribute group decision problems encountered in real-life scenarios.

    The related properties of (p, q)-rung interval-valued orthopair fuzzy sets are described below.

    Their scoring functions and precision functions are constructed to compare the magnitudes of two (p, q)-rung interval-valued orthopair fuzzy numbers.

    Definition 7. For any (p, q)-rung interval-valued orthopair fuzzy number α=([fLα,fRα],[hLα,hRα]), the function (1) is called the score function of α.

    S(α)=12(1+(fLα)p+(fRα)p(hLβ)q(hRβ)q+(fLα)p+(fRα)p(hLβ)q(hRβ)q1+13((πLα)k+(πRα)k)). (1)
    H(α)=12(1+(fLα)p+(fRα)p+(hLβ)q+(hRβ)q+(fLα)p+(fRα)p+(hLβ)q+(hRβ)q1+13((πLα)k+(πRα)k)). (2)

    The function (2) is called the precision function of α.

    Given α1=([fLα1,fRα1],[hLα1,hRα1]), α2=([fLα2,fRα2],[hLα2,hRα2]), the following conditions hold:

    (1) If S(α1)>S(α2), then α1 is said to be greater than α2, as indicated by α1>α2.

    (2) If S(α1)=S(α2), then α1 is said to be equal to α2 when H(α1)=H(α2); otherwise, α1 is said to be less than α2 when H(α1)>H(α2).

    Definition 8. Let αj=([fLαj,fRαj],[hLαj,hRαj]) be a (p, q)-rung interval-valued orthopair fuzzy number, ω=(ω1,ω2,...,ωn)T be a vector of weights for αj, ωj[0,1] and nj=1ωj=1. If

    (p,q)RIVOFWA=nj=1ωjαj,

    (p, q)-RIVOFWA is then referred to as the (p, q)-rung interval-valued orthopair fuzzy weighted average operator.

    Theorem 1. Let αj=([fLαj,fRαj],[hLαj,hRαj]) be a (p, q)-rung interval-valued orthopair fuzzy number, ω=(ω1,ω2,...,ωn)T be a vector of weights for αj, ωj[0,1] and nj=1ωj=1. Then,

    (p,q)RIVOFWA(α1,α2,...,αn)=nj=1ωjαj=[fLαj,fRαj]j=1,2,...,n{[p1nj=1(1(fLαj)p)ωj,p1nj=1(1(fRαj)p)ωj]},[hLαj,hRαj]j=1,2,...,n{[qnj=1((hLαj)q)ωj,qnj=1((hRαj)q)ωj]} (3)

    Proof. Theorem 1 is demonstrated via mathematical induction.

    When n = 1, the theorem is visibly correct.

    When n = 2, we have

    ω1α1ω2α2=[fLαj,fRαj]j=1,2{[p12j=1(1(fLαj)p)ωj,p12j=1(1(fRαj)p)ωj]},[hLαj,hRαj]j=1,2{[q2j=1((hLαj)q)ωj,q2j=1((hRαj)q)ωj]}.

    Assuming the theorem holds when n = k, we have

    kj=1ωjαj=[fLαj,fRαj]j=1,2,...,k{[p1kj=1(1(fLαj)p)ωj,p1kj=1(1(fRαj)p)ωj]},[hLαj,hRαj]j=1,2,...,k{[qkj=1((hLαj)q)ωj,qkj=1((hRαj)q)ωj]}.

    When n = k+1, we have

    k+1j=1ωjαj=kj=1ωjαjωk+1αk+1=[fLαj,fRαj]j=1,2,...,k{[p1kj=1(1(fLαj)p)ωj,p1kj=1(1(fRαj)p)ωj]},[hLαj,hRαj]j=1,2,...,k{[qkj=1((hLαj)q)ωj,qkj=1((hRαj)q)ωj]}[fLαk+1,fRαk+1]{[p1(1(fLαk+1)p)ωj,p1(1(fRαk+1)p)ωj]},[hLαk+1,hRαk+1]{[q((hLαk+1)q)ωj,q((hRαk+1)q)ωj]}=[fLαj,fRαj]j=1,2,...,k+1{[p1k+1j=1(1(fLαj)p)ωj,p1k+1j=1(1(fRαj)p)ωj]},[hLαj,hRαj]j=1,2,...,k+1{[qk+1j=1((hLαj)q)ωj,qk+1j=1((hRαj)q)ωj]}.

    Therefore, when n = k+1, the equation holds, and hence it holds for any value of n. The proof is complete.

    The following are the relevant properties satisfied by the (p, q)-RIVOFWA operator:

    Theorem 2. (Boundedness) Let αj=([fLαj,fRαj],[hLαj,hRαj]), j = 1, 2, …, n, be (p, q)-rung interval-valued orthopair fuzzy numbers, where α=min(α1,α2,...,αn) and α+=max(α1,α2,...,αn). Then

    α(p,q)RIVOFWA(α1,α2,...,αn)α+.

    Theorem 3. (Idempotence) Let αj=([fLαj,fRαj],[hLαj,hRαj]), j = 1, 2, …, n, be (p, q)-rung interval-valued orthopair fuzzy numbers. If for any αj, αj=α and ω=(1n,1n,...,1n)T, then

    (p,q)RIVOFWA(α1,α2,...,αn)=α.

    Theorem 4. (Monotonicity) Let αj=([fLαj,fRαj],[hLαj,hRαj]) and αj=([fLαj,fRαj],[hLαj,hRαj]), j = 1, 2, …, n, be (p, q)-rung interval-valued orthopair fuzzy numbers such that j=1,2,...,n, αjαj, [fLαj,fRαj][fLαj,fRαj] and [hLαj,hRαj][hLαj,hRαj]. Then,

    (p,q)RIVOFWA(α1,α2,...,αn)(p,q)RIVOFWA(α1,α2,...,αn).

    In the context of fuzzy set theory and multi-attribute decision-making issues, entropy is a crucial measure of information that may be utilized to quantify the degree of fuzziness of attributes and establish attribute weights.

    Definition 9. A real function E: (p, q)-RIVOFS(X)→[0, 1] is referred to as the entropy of a (p, q)-rung interval-valued orthopair fuzzy set, if it satisfies the following criteria:

    (1) E()=0 if and only if the (p, q)-rung interval-valued orthopair fuzzy set is a crisp set.

    (2) E()=0 if and only if for all xX, f=h=[0,0].

    (3) When fL2(x)hL2(x) and fR2(x)hR2(x), there is fL1(x)fL2(x), fR1(x)fR2(x), hL1(x)hL2(x), hR1(x)hR2(x); when fL2(x)hL2(x) and fR2(x)hR2(x), there is fL1(x)fL2(x), fR1(x)fR2(x), hL1(x)hL2(x), hR1(x)hR2(x). Then, E(1)E(2) is established.

    (4) E()=E(C).

    Below is a formula for calculating the entropy of (p, q)-rung interval-valued orthopair fuzzy sets that satisfies the four constraints mentioned above:

    Definition 10. Let serve as a (p, q)-rung interval-valued orthopair fuzzy set on a fixed set Ω. Then, the formula

    E()=12nni=1[cos(2fLhL)2×(fLhL)22πcos(2fRhR)2×(fRhR)22π+2(fL+hL)(fR+hR)] (4)

    is a (p, q)-rung interval-valued orthopair fuzzy entropy formula that satisfies the axiomatic definition 9.

    Proof. (1) When is a definite set, that is, f=[1,1], h=[0,0] or f=[0,0], h=[1,1], E()=12(cosπ2cosπ2+211)=0. Conversely, if E()=0, we can conclude that either f=[1,1] or f=[0,0], which implies that VB is a definite set.

    (2) When f=h=[0,0], E()=12(cos0cos0+200)=1.

    (3) Let

    f(x1,y1,x2,y2)=12[cos(2x1x2)2×(x1x2)22πcos(2y1y2)2×(y1y2)22π+2(x1+x2)(y1+y2)]

    be a function defined as above, where x1,y1,x2,y2[0,1]. We will compute the partial derivatives of f(x1,y1,x2,y2) with respect to x1, y1, x2, y2:

    f(x1,y1,x2,y2)x1=(x1x2)(2x1x2)(1x1)sin(2x1x2)2×(x1x2)22π12,
    f(x1,y1,x2,y2)y1=(y1y2)(2y1y2)(1y1)sin(2y1y2)2×(y1y2)22π12,
    f(x1,y1,x2,y2)x2=(x1x2)(2x1x2)(x21)sin(2x1x2)2×(x1x2)22π12,
    f(x1,y1,x2,y2)y2=(y1y2)(2y1y2)(y21)sin(2y1y2)2×(y1y2)22π12.

    When x1x2, y1y2, f(x1,y1,x2,y2)x10, f(x1,y1,x2,y2)x20, f(x1,y1,x2,y2)y10 and f(x1,y1,x2,y2)y20, the function f(x1,y1,x2,y2) is monotonically increasing with respect to x1, y1, and monotonically decreasing with respect to x2, y2. Therefore, when fL2(x)hL2(x) and fR2(x)hR2(x), we have fL1(x)fL2(x), fR1(x)fR2(x), hL1(x)hL2(x), hR1(x)hR2(x). Then, E(1)E(2).

    Similarly, when fL2(x)hL2(x), fR2(x)hR2(x), we have fL1(x)fL2(x), fR1(x)fR2(x), hL1(x)hL2(x), hR1(x)hR2(x).

    (4) The proof of (4) is obvious.

    An essential tool in fuzzy set theory and a common application in decision-making problems is the distance measure between (p, q)-rung interval-valued orthopair fuzzy vectors.

    Definition 11. Let a=([fLa,fRa],[hLa,hRa]), b=([fLb,fRb],[hLb,hRb]) and c=([fLc,fRc],[hLc,hRc]) be three (p, q)-rung interval-valued orthopair fuzzy numbers. A function d is considered to be a (p, q)-rung interval-valued orthopair fuzzy distance measure between a and b if it satisfies the conditions outlined below:

    (1) d(a,b)0;

    (2) d(a,b)=d(b,a);

    (3) d(a,b)=0a=b;

    (4) If abc, then d(a,c)+d(c,b)d(a,b).

    Based on four conditions, this definition establishes a (p, q)-rung interval-valued fuzzy orthopair fuzzy distance measure between a and b, referred to as d(a, b). These conditions ensure that the distance measure satisfies basic properties such as non-negativity, symmetry and the triangle inequality.

    Among the various distance measures, Hamming distance and Euclidean distance are the most commonly used.

    Definition 12. Given two (p, q)-rung interval-valued orthopair fuzzy numbers a=([fLa,fRa],[hLa,hRa]) and b=([fLb,fRb],[hLb,hRb]), we have the following.

    (1) (p, q)-rung interval-valued orthopair fuzzy Hamming distance dH(a,b):

    dH(a,b)=16[|(fLa)p(fLb)p|+|(fRa)p(fRb)p|+|(hLa)q(hLb)q|+|(hRa)q(hRb)q|+|(πLa)k(πLb)k|+|(πRa)k(πRb)k|]. (5)

    (2) (p, q)-rung interval-valued orthopair fuzzy Euclidean distance dE(a,b):

    dE(a,b)=16[|(fLa)p(fLb)p|+|(fRa)p(fRb)p|+|(hLa)q(hLb)q|+|(hRa)q(hRb)q|+|(πLa)k(πLb)k|+|(πRa)k(πRb)k|]. (6)

    These distance measures provide a way to quantify the similarity or dissimilarity between (p, q)-rung interval-valued orthopair fuzzy numbers in decision-making questions.

    The purpose of this study is to demonstrate that the two distance measures presented satisfy the conditions of a distance measure as defined in Definition 12.

    The Hamming distance measure will be used as an example.

    Proof. (1) To prove the above, we will begin by showing that condition (1) is evident. The Hamming distance is defined as the number of elements that differ in two vectors in the same position. Therefore, the Hamming distance is always a non-negative value.

    (2)

    dH(a,b)=16[|(fLa)p(fLb)p|+|(fRa)p(fRb)p|+|(hLa)q(hLb)q|+|(hRa)q(hRb)q|+|(πLa)k(πLb)k|+|(πRa)k(πRb)k|]=16[|(fLb)p(fLa)p|+|(fRb)p(fRa)p|+|(hLb)q(hLa)q|+|(hRb)q(hRa)q|+|(πLb)k(πLa)k|+|(πRb)k(πRa)k|]=dH(b,a).

    From the nature of absolute value, dH(a,b)=dH(b,a). Therefore, condition (2) is proved.

    (3)

    dH(a,b)=016[|(fLa)p(fLb)p|+|(fRa)p(fRb)p|+|(hLa)q(hLb)q|+|(hRa)q(hRb)q|+|(πLa)k(πLb)k|+|(πRa)k(πRb)k|]=0|(fLa)p(fLb)p|=|(fRa)p(fRb)p|=0,|(hLa)q(hLb)q|=|(hRa)q(hRb)q|=0,|(πLa)k(πLb)k|=|(πRa)k(πRb)k|=0fLa=fLb,fRa=fRb,hLa=hLb,hRa=hRb,πLa=πLb,πRa=πRba=b.

    Therefore, condition (3) is proved.

    (4)

    dH(a,b)=16[|(fLa)p(fLb)p|+|(fRa)p(fRb)p|+|(hLa)q(hLb)q|+|(hRa)q(hRb)q|+|(πLa)k(πLb)k|+|(πRa)k(πRb)k|]=16[|(fLa)p(fLc)p+(fLc)p(fLb)p|+|(fRa)p(fRc)p+(fRc)p(fRb)p|+|(hLa)q(hLc)q+(hLc)q(hLb)q|+|(hRa)q(hRc)q+(hRc)q(hRb)q|+|(πLa)k(πLc)k+(πLc)k(πLb)k|+|(πRa)k(πRc)k+(πRc)k(πRb)k|]16[|(fLa)p(fLc)p|+|(fLc)p(fLb)p|+|(fRa)p(fRc)p|+|(fRc)p(fRb)p|+|(hLa)q(hLc)q|+|(hLc)q(hLb)q|+|(hRa)q(hRc)q|+|(hRc)q(hRb)q|+|(πLa)k(πLc)k|+|(πLc)k(πLb)k|+|(πRa)k(πRc)k|+|(πRc)k(πRb)k|]=16[|(fLa)p(fLc)p|+|(fRa)p(fRc)p|+|(hLa)q(hLc)q|+|(hRa)q(hRc)q|+|(πLa)k(πLc)k|+|(πRa)k(πRc)k|+|(fLc)p(fLb)p|+|(fRc)p(fRb)p|+|(hLc)q(hLb)q|+|(hRc)q(hRb)q|+|(πLc)k(πLb)k|+|(πRc)k(πRb)k|]=dH(a,c)+dH(c,a).

    Therefore, condition (4) is proved.

    By applying the same logic, it can be demonstrated that the Euclidean distance meets the criteria for a distance measure as specified in Definition 12.

    Definition 13. Assume α=(α1,α2,...,αn)T and β=(β1,β2,...,βn)T be (p, q)-rung interval-valued orthopair fuzzy vectors, where αi=([fLαi,fRαi],[hLαi,hRαi]) and βi=([fLβi,fRβi],[hLβi,hRβi]), i = 1, 2, …, n. The distance between α and β is thus specified as

    dH(α,β)=16nni=1[|(fLαi)p(fLβi)p|+|(fRαi)p(fRβi)p|+|(hLαi)q(hLβi)q|+|(hRαi)q(hRβi)q|+|(πLαi)k(πLβi)k|+|(πRαi)k(πRβi)k|]. (7)

    The term 'standard Hamming distance' for (p, q)-rung interval-valued orthopair fuzzy vectors refers to this distance.

    Theorem 5. Let α, β and γ be three (p, q)-rung interval-valued orthopair fuzzy vectors, and let dH(α,β), dH(β,γ) and dH(α,γ) denote the (p, q)-rung interval-valued orthopair fuzzy standard Hamming distances between α and β, β and γ and α and γ, respectively. Then,

    (1) dH(α,β)=dH(β,α), which implies that the distance measure is symmetric.

    (2) If αγβ, then dH(α,β)+dH(β,γ)dH(α,γ), which implies that the distance measure satisfies the triangle inequality.

    (3) dH(α,β)0, which implies that the distance measure is non-negative and zero only when comparing identical vectors.

    (4) If dH(α,β)=0, then α=β holds, indicating that the distance measure satisfies the identity of indiscernibles.

    These characteristics demonstrate that the (p, q)-rung interval-valued orthopair fuzzy standard Hamming distance is a valid distance measure for comparing (p, q)-rung interval-valued orthopair fuzzy vectors.

    This section primarily introduces the steps of a fuzzy multi-attribute group decision-making algorithm on the basis of weighted optimization and (p, q)-rung interval-valued orthopair fuzzy sets. First, each decision expert expresses the ambiguous evaluation information of alternative solutions under distinct attributes. Second, the subjective and objective weights are then determined using network analysis and entropy methods, and a model for weight optimization is developed. The (p, q)-RIVOFWA operator is then employed for transforming a (p, q)-rung interval-valued orthopair fuzzy decision information matrix into a comprehensive decision matrix. Finally, the improved ELECTRE method is used to calculate the total advantage value, total disadvantage value and total evaluation value of each solution. In order to determine the best option, the solutions are ranked based on the total evaluation value.

    Let A={A1,A2,...,Am} be the set of alternative solutions, M={M1,M2,...,Mn} be the set of attributes and there be t decision experts. Let c(k)ij denote the k-th expert's assessment value for the alternative solution Ai in attribute Mj, where c(k)ij=(fij(x)(k),hij(x)(k)) is a (p, q)-rung interval-valued orthopair fuzzy number. Let the weight vector for each index attribute be ω={ω1,ω2,,ωn}, where 0ωj1 and nj=1ωj=1. The following are the decision-making stages of the algorithm proposed in this paper:

    Step 1: Constructing the (p, q)-rung interval-valued orthopair fuzzy decision matrix.

    The fuzzy evaluations of the candidate alternatives by distinct decision makers under different attributes are represented using (p, q)-rung interval-valued orthopair fuzzy numbers α=([fLα,fRα],[hLα,hRα]), and the (p, q)-rung interval-valued orthopair fuzzy decision matrix C=(cij)m×n(i=1,2,...,m;j=1,2,...,n) is constructed on the basis of these evaluations.

    Step 2: Utilize the ANP/Entropy method for calculating the weights of each attribute.

    Using the ANP, the subjective weights of the decision-makers are determined for each attribute. ANP is an enhanced version of the AHP for making decisions. ANP substitutes a network structure for the hierarchical structure of AHP and establishes more complex influence relationships between decision elements, taking into account the interdependence of factors and levels and emphasizing subjectivity. The particular procedures are as follows:

    (1) Build the network simulation model. By systematically analyzing what factors were influential through a literature review and interviews with experts, the mutual influence relationships between elements are determined, and a network structure diagram for the ANP is constructed.

    (2) Build the evaluation matrix. The Delphi method is used to compile expert opinions, and the relative importance of each indicator is expressed as a matrix. In light of the 1–9 scale rule [34], the relative significance values are determined, and the priority vector is calculated.

    (3) Calculate the eigenvalue and eigenvector, and perform a consistency check. After completing the comparison matrix, the eigenvalue method and Eq (8) are utilized to calculate the eigenvector W, where λmax is the evaluation matrix's maximal eigenvalue.

    AW=λmaxW. (8)

    Based on Eq (9), the conformance of the judgment matrix is verified,

    CR=λmax1/n1RI (9)

    where n stands for the order of the evaluation matrix, CI stands for the consistency index, CR stands for the consistency ratio, and RI stands for an average random index. If CR0.1, the consistency check is passed. Otherwise, it requires rechecking.

    (4) Calculate the limit supermatrix W. The eigenvectors of each indication that passes the consistency test combine to form a supermatrix without weights. Normalizing the unweighted supermatrix results in the weighted supermatrix, and then stabilizing the weighted supermatrix results in the limit supermatrix, as computed by Eq (10). When i, the limit supermatrix is unique and convergent, and the evaluation indicator weights ωj can be determined.

    W=limk(W)k. (10)

    The entropy approach, a kind of objective weighing method that determines attribute weights on the basis of the quantity of decision information, is used to calculate the objective weights of each attribute. Entropy is a measurement of informational nondeterminacy. The indicator matrix X's degree of dispersion increases with decreasing entropy value, which has a stronger effect on the assessment as a whole. Consequently, the attribute objective weight model below is established using the entropy formula of (p, q)-rung interval-valued orthopair fuzzy sets:

    ωj (11)

    Due to the complexity of actual problems, the subjectivity and diversity of subjective understanding and the instability of data, the network analysis method has some subjective limitations, whereas the entropy method cannot make corresponding subjective judgments according to the actual situation and has some objective limitations based on the original data. Therefore, a method of combination weighting is required. The goal of the weight optimization model is to minimize the deviation and maximize the dispersion when taking into account the divergence between the combination weight and the subjective and objective weights and assuming that the combination weight equals {{ \omega }}_{{j}} .The model for weight optimization is

    \min F = \xi \sum\limits_{i = 1}^m {\sum\limits_{j = 1}^n {\left[ {{{(({\omega _j} - \omega _j^{'}){s_{ij}})}^2} + ({\omega _j} - \omega _j^{''}){s_{ij}}{)^2}} \right]} } - \varsigma {\sum\limits_{j = 1}^n {\sum\limits_{i = 1}^m {\sum\limits_{h = 1}^m {\left| {({s_{ij}} - {s_{hj}}){\omega _j}} \right|} } } ^2}
    s.t. \begin{array}{l} \sum\limits_{j = 1}^n {{\omega _j}} = 1 \hfill \\ {\omega _j} > 0, j = 1, 2, ..., n \hfill \\ \end{array} . (12)

    {ξ} and {ς} are constants, indicating the degree of importance, {{ \omega }}_{{j}}^{{'}} stands for the subjective weight, {{ \omega }}_{{j}}^{{''}} stands for the objective weight, and {{s}}_{{ij}} represents the evaluation value of the j-th attribute of the i-th evaluation object, while m stands for the total number of evaluation objects. We iteratively solve Eq (12) using a genetic algorithm since the optimization model is a nonlinear model, and genetic algorithms have the advantages of global optimization, rapid randomness and excellent convergence.

    Step 3: Calculate the exhaustive decision information matrix using the (p, q)-RIVOFWA operator.

    The (p, q)-rung interval-valued orthopair fuzzy decision information matrices C = {({c_{ij}})_{m \times n}} are aggregated into a comprehensive decision information matrix \Phi = {({\phi _{ij}})_{m \times n}} utilizing its (p, q)-RIVOFWA operator as described in Definition 3.

    Step 4: Calculate the score function.

    Using Eq (1), the scores \rho ({\phi _{ij}}) corresponding to each element of the exhaustive decision information matrix are calculated, and a score matrix {\rm P} = {(\rho ({\phi _{ij}}))_{m \times n}} is constructed. The scores of various schemes for a given attribute are sorted, and the median score is chosen as the reference point {{φ}}_{{ij}} .

    Step 5: Structure the weighted standard decision matrix.

    The distance d({\phi _{ij}}, {\varphi _{ij}}) between each scheme and the reference point under the same attribute is calculated using the standard Hamming distance Eq (7), and it is then used to produce a normalized decision matrix D = {({d_{ij}})_{m \times n}} , where

    {d_{ij}} = \left\{ \begin{array}{l} d\left( {{\phi _{ij}}, {\varphi _{ij}}} \right), {\phi _{ij}} \geqslant {\varphi _{ij}} \hfill \\ - d\left( {{\phi _{ij}}, {\varphi _{ij}}} \right), {\phi _{ij}} < {\varphi _{ij}} \hfill \\ \end{array} \right. . (13)

    The standardized decision matrix is multiplied by the weight { \omega } for obtaining the weighted standard decision matrix R = {({r_{ij}})_{m \times n}} .

    Step 6: Calculate the consistency matrix and inconsistency matrix.

    By comparing each pair of alternatives, the consensus set and the contradiction set are determined. For alternatives Ak and Al, the consensus set comprises all criteria for which the preference of Ak is not inferior to that of Al, i.e., R_{kl}^ + = \{ j|{r_{kj}} \geqslant {r_{lj}}\} , whereas the contradiction set comprises all criteria for which the preference of Ak is worse than that of Al, i.e., R_{kl}^ - = \{ j|{r_{kj}} < {r_{lj}}\} .

    Compute the consistency matrix {}{H = }{\left({{h}}_{{kl}}\right)}_{{m×m}} and the inconsistency matrix {}{T = }{\left({{t}}_{{kl}}\right)}_{{m×m}} using Eqs (14) and (15).

    {h_{kl}} = \frac{{\sum\nolimits_{j \in R_{kl}^ + } {{\omega _j}} }}{{\sum\nolimits_{j = 1}^n {{\omega _j}} }} (14)
    {t_{kl}} = \frac{{\mathop {\max }\limits_{j \in R_{kl}^ - } \left| {{d_{kj}} - {d_{lj}}} \right|}}{{\mathop {\max }\limits_{j \in J} \left| {{d_{kj}} - {d_{lj}}} \right|}} . (15)

    Step 7: Determine the comprehensive matrix.

    In light of the consistency matrix and the inconsistency matrix, one determines the comprehensive matrix {}{E = }{\left({{e}}_{{kl}}\right)}_{{m×m}} , which reflects the relative superiority or inferiority of each alternative under various criteria. The matrix element ekl is determined using the following equation:

    {e_{kl}} = {h_{kl}} - {t_{kl}} . (16)

    Step 8: Calculate the total advantages, total disadvantages and total dominance values of each alternative.

    The total advantage value and total disadvantage value of each alternative are calculated by adding the values in each row and column of the exhaustive matrix, separately:

    {\eta _k} = \sum\limits_{l = 1}^m {{e_{kl}}} , k = 1, 2, ..., m (17)
    {\chi _l} = \sum\limits_{k = 1}^m {{e_{kl}}} , l = 1, 2, ..., m (18)

    Then, each alternative's cumulative dominance value is computed using the formula:

    {\mu _k} = {\eta _k} - {\chi _l}, k = l . (19)

    Finally, the schemes are sorted by their cumulative dominance values.

    The multi-attribute group decision-making algorithm for (p, q)-rung interval-valued orthopair fuzzy sets can be summarized.

    Algorithm: Multiple attribute group decision-making algorithm
    Input parameters:
    D-Normalized decision matrix A-Set of alternative H-Consistency matrix
    R-Weighted decision matrix M-Set of attributes T-Inconsistency matrix
    ANP-Analytic Network Process C-Decision matrix E-Comprehensive matrix
    WA-Weighted average operator S-Score value G-Genetic algorithm
    w'-Subjective weight matrix P-Score matrix EM-Entropy method
    w"-Objective weight matrix φ- Reference point η-sum for rows of E
    w-Weight matrix Z-Sorting algorithm χ-sum for columns of E Z-Sorting algorithm
    μ-Cumulative dominance values Φ-Comprehensive decision information matrix
    1: For i = 1, …, m
    2:   For j = 1, ..., n
    3:     Set Cij based on Mj and Ai
    4:     Calculate Φij and Sij based on Cij and WA
    5:     Calculate Pij based on Φij
    6:   End For
    7:   Set φ based on P
    8: End For
    9:     Calculate w' and w" based on C by ANP and EM
    10:     Calculate w based on w', w" and S by G
    11:     Calculate R based on φ, Φ and D
    12: For k = 1, …, m
    13:     For l = 1, …, m
    14:       Update j based on R
    15:       Calculate Hkl and Tkl based on wj, Dkj and Dlj
    16:     End For
    17: End For
    18:     Calculate E based on H and T
    19:     Calculate μ based on η and χ
    20:     Update μ by Z
    21: Return μ

    Suppose that an investment company plans to select the best local enterprises in two cities (City 1 and City 2) respectively for investment, and select the one with the best development prospects from five companies in both cities: A1 Financial Company, A2 Food Company, A3 Real Estate Company, A4 Internet Company and A5 Automotive Company. The company evaluates the alternatives based on 4 attributes: M1 Economic Capability, M2 Social Evaluation, M3 Risk Resistance and M4 Development Potential. For the purpose of accurately describing the ambiguity of the evaluation information, the investment company invited three experts with extensive experience to evaluate the options from a variety of perspectives. The evaluation information was provided in the form of (p, q)-rung interval-valued orthopair fuzzy sets, and decision-makers' interactions with one another and the interrelationships between attributes were taken into account. On the basis of weight optimization, a (p, q)-rung interval-valued orthopair fuzzy multi-attribute group decision-making algorithm is used for evaluating the options. Without sacrificing generality, p = q = 5 is used in this instance. The following are the particular steps and results:

    Step 1: The experts assessed the candidate schemes based on different attributes and obtained the (p, q)-rung interval-valued orthopair fuzzy decision information matrix C = {({c_{ij}})_{m \times n}} (i = 1, 2, ..., m; j = 1, 2, ..., n) , as depicted in Table 1.

    Table 1.  The evaluation information of each project.
    Decision
    Matrix
    Attributes
    {M_1} {M_2} {M_3} {M_4}
    (1) {C^{\left(1 \right)}} {A_1} ([0.6, 0.7], [0.1, 0.2]) ([0.5, 0.6], [0.2, 0.3]) ([0.2, 0.3], [0.5, 0.6]) ([0.7, 0.8], [0.1, 0.2])
    {A_2} ([0.5, 0.6], [0.2, 0.3]) ([0.6, 0.7], [0.3, 0.4]) ([0.7, 0.8], [0.3, 0.4]) ([0.4, 0.5], [0.2, 0.3])
    {A_3} ([0.5, 0.7], [0.4, 0.5]) ([0.3, 0.4], [0.4, 0.5]) ([0.5, 0.6], [0.3, 0.4]) ([0.7, 0.8], [0.2, 0.3])
    {A_4} ([0.6, 0.7], [0.3, 0.4]) ([0.7, 0.8], [0.2, 0.3]) ([0.5, 0.6], [0.4, 0.5]) ([0.5, 0.6], [0.3, 0.4])
    {A_5} ([0.6, 0.7], [0.2, 0.3]) ([0.6, 0.7], [0.3, 0.4]) ([0.3, 0.4], [0.6, 0.7]) ([0.6, 0.7], [0.1, 0.2])
    {C^{\left(2 \right)}} {A_1} ([0.5, 0.6], [0.3, 0.4]) ([0.6, 0.7], [0.2, 0.3]) ([0.3, 0.4], [0.4, 0.5]) ([0.5, 0.6], [0.3, 0.4])
    {A_2} ([0.7, 0.8], [0.2, 0.3]) ([0.5, 0.6], [0.3, 0.4]) ([0.7, 0.8], [0.4, 0.5]) ([0.4, 0.5], [0.3, 0.5])
    {A_3} ([0.5, 0.6], [0.1, 0.2]) ([0.2, 0.3], [0.5, 0.6]) ([0.6, 0.7], [0.2, 0.3]) ([0.8, 0.9], [0.1, 0.2])
    {A_4} ([0.7, 0.8], [0.3, 0.4]) ([0.3, 0.4], [0.4, 0.5]) ([0.5, 0.6], [0.2, 0.4]) ([0.4, 0.5], [0.5, 0.6])
    {A_5} ([0.3, 0.4], [0.5, 0.6]) ([0.7, 0.8], [0.1, 0.2]) ([0.6, 0.8], [0.2, 0.3]) ([0.5, 0.6], [0.1, 0.2])
    {C^{\left(3 \right)}} {A_1} ([0.6, 0.7], [0.2, 0.3]) ([0.7, 0.8], [0.1, 0.2]) ([0.3, 0.4], [0.3, 0.4]) ([0.6, 0.7], [0.1, 0.2])
    {A_2} ([0.5, 0.6], [0.4, 0.5]) ([0.6, 0.7], [0.4, 0.5]) ([0.8, 0.9], [0.1, 0.2]) ([0.5, 0.6], [0.2, 0.3])
    {A_3} ([0.6, 0.7], [0.3, 0.4]) ([0.3, 0.4], [0.4, 0.6]) ([0.5, 0.6], [0.2, 0.3]) ([0.8, 0.9], [0.2, 0.3])
    {A_4} ([0.5, 0.5], [0.5, 0.6]) ([0.5, 0.6], [0.5, 0.6]) ([0.5, 0.7], [0.2, 0.4]) ([0.3, 0.4], [0.5, 0.6])
    {A_5} ([0.4, 0.5], [0.6, 0.7]) ([0.5, 0.6], [0.2, 0.3]) ([0.4, 0.5], [0.5, 0.6]) ([0.7, 0.8], [0.1, 0.2])
    (2) {C^{\left(1 \right)}} {A_1} ([0.6, 0.7], [0.3, 0.4]) ([0.5, 0.6], [0.2, 0.3]) ([0.6, 0.7], [0.1, 0.2]) ([0.5, 0.6], [0.3, 0.4])
    {A_2} ([0.3, 0.4], [0.2, 0.3]) ([0.6, 0.7], [0.3, 0.4]) ([0.5, 0.6], [0.2, 0.3]) ([0.4, 0.5], [0.3, 0.4])
    {A_3} ([0.7, 0.8], [0.2, 0.3]) ([0.6, 0.7], [0.4, 0.5]) ([0.6, 0.7], [0.4, 0.5]) ([0.7, 0.8], [0.2, 0.3])
    {A_4} ([0.5, 0.6], [0.3, 0.4]) ([0.7, 0.8], [0.2, 0.3]) ([0.6, 0.7], [0.3, 0.4]) ([0.5, 0.6], [0.4, 0.5])
    {A_5} ([0.4, 0.5], [0.2, 0.3]) ([0.6, 0.7], [0.3, 0.4]) ([0.6, 0.7], [0.2, 0.3]) ([0.3, 0.4], [0.2, 0.3])
    {C^{\left(2 \right)}} {A_1} ([0.7, 0.8], [0.2, 0.3]) ([0.6, 0.7], [0.2, 0.3]) ([0.5, 0.6], [0.3, 0.4]) ([0.7, 0.8], [0.3, 0.4])
    {A_2} ([0.4, 0.5], [0.3, 0.4]) ([0.5, 0.6], [0.3, 0.4]) ([0.7, 0.8], [0.2, 0.3]) ([0.5, 0.6], [0.3, 0.4])
    {A_3} ([0.5, 0.6], [0.3, 0.4]) ([0.7, 0.8], [0.5, 0.6]) ([0.5, 0.6], [0.1, 0.2]) ([0.5, 0.6], [0.3, 0.4])
    {A_4} ([0.6, 0.7], [0.4, 0.5]) ([0.3, 0.4], [0.4, 0.5]) ([0.7, 0.8], [0.3, 0.4]) ([0.6, 0.7], [0.5, 0.6])
    {A_5} ([0.7, 0.8], [0.2, 0.3]) ([0.7, 0.8], [0.1, 0.2]) ([0.3, 0.4], [0.5, 0.6]) ([0.4, 0.5], [0.5, 0.6])
    {C^{\left(3 \right)}} {A_1} ([0.5, 0.6], [0.2, 0.3]) ([0.7, 0.8], [0.1, 0.2]) ([0.6, 0.7], [0.2, 0.3]) ([0.5, 0.6], [0.3, 0.4])
    {A_2} ([0.6, 0.7], [0.3, 0.4]) ([0.6, 0.7], [0.4, 0.5]) ([0.5, 0.6], [0.4, 0.5]) ([0.3, 0.4], [0.2, 0.3])
    {A_3} ([0.5, 0.6], [0.4, 0.5]) ([0.5, 0.6], [0.4, 0.6]) ([0.6, 0.7], [0.3, 0.4]) ([0.5, 0.6], [0.2, 0.3])
    {A_4} ([0.7, 0.8], [0.2, 0.3]) ([0.5, 0.6], [0.5, 0.6]) ([0.5, 0.5], [0.5, 0.6]) ([0.7, 0.8], [0.3, 0.4])
    {A_5} ([0.6, 0.7], [0.3, 0.4]) ([0.5, 0.6], [0.2, 0.3]) ([0.4, 0.5], [0.6, 0.7]) ([0.5, 0.6], [0.3, 0.4])

     | Show Table
    DownLoad: CSV

    Step 2: Using the ANP and entropy weight method, the subjective weights of decision experts and the objective weights of each attribute were calculated. A genetic algorithm was utilized to optimize the weight and iteratively solve the model (12), taking into account the discrepancy within the combined weight and the subjective and objective weights. The initial population was set to 100, and the crossover operator was configured as two-point crossover with a probability of 0.6. The mutation operator was configured for uniform mutation with a 5% chance. As shown in Table 2, after 86 iterations, the calculation converged, and the optimal weight vector was obtained.

    Table 2.  The weight of each attribute.
    {M_1} {M_2} {M_3} {M_4}
    {\omega ^1} 0.4346 0.3404 0.0879 0.1374
    {\omega ^2} 0.3558 0.0916 0.2362 0.3164

     | Show Table
    DownLoad: CSV

    Step 3: The (p, q)-RIVOFWA operator was utilized to calculate the integrated decision information matrix, as illustrated in Table 3.

    Table 3.  Integrated decision information matrix.
    {M_1} {M_2} {M_3} {M_4}
    (1) {A_1} ([0.6405, 0.7075], [0.1082, 0.1977]) ([0.6259, 0.7260], [0.1527, 0.2547]) ([0.2147, 0.2892], [0.7809, 0.8300]) ([0.5252, 0.6135], [0.4501, 0.5666])
    {A_2} ([0.6334, 0.7358], [0.1658, 0.2598]) ([0.5767, 0.6765], [0.3225, 0.4233]) ([0.5789, 0.6727], [0.6779, 0.7536]) ([0.3724, 0.4557], [0.5446, 0.6531])
    {A_3} ([0.5713, 0.7075], [0.1463, 0.2469]) ([0.2814, 0.3789], [0.4233, 0.5578]) ([0.4171, 0.4958], [0.6779, 0.7466]) ([0.6605, 0.7633], [0.4683, 0.5758])
    {A_4} ([0.6555, 0.7478], [0.2598, 0.3612]) ([0.5901, 0.6871], [0.3343, 0.4406]) ([0.3839, 0.4958], [0.6953, 0.8009]) ([0.3605, 0.4414], [0.7005, 0.7662])
    {A_5} ([0.5250, 0.6226], [0.2944, 0.4065]) ([0.6259, 0.7260], [0.1753, 0.2809]) ([0.3826, 0.5196], [0.7809, 0.8335]) ([0.5252, 0.6135], [0.3871, 0.5151])
    (2) {A_1} ([0.6312, 0.7318], [0.2073, 0.3064]) ([0.4849, 0.5675], [0.6030, 0.6921]) ([0.5371, 0.6317], [0.2987, 0.4144]) ([0.5962, 0.6949], [0.3189, 0.4191])
    {A_2} ([0.5048, 0.5993], [0.2395, 0.3395]) ([0.4457, 0.5261], [0.7375, 0.7935]) ([0.5634, 0.6583], [0.3765, 0.4807]) ([0.4257, 0.5204], [0.2805, 0.3826])
    {A_3} ([0.6098, 0.7099], [0.2653, 0.3675]) ([0.4849, 0.5675], [0.7935, 0.8546]) ([0.5371, 0.6317], [0.3518, 0.4675]) ([0.5962, 0.6949], [0.2467, 0.3493])
    {A_4} ([0.6312, 0.7318], [0.2653, 0.3675]) ([0.4563, 0.5348], [0.7446, 0.8021]) ([0.5836, 0.6697], [0.4807, 0.5749]) ([0.6173, 0.7166], [0.4106, 0.5113])
    {A_5} ([0.6223, 0.7218], [0.2073, 0.3064]) ([0.4849, 0.5675], [0.6259, 0.7106]) ([0.4656, 0.5536], [0.5145, 0.6131]) ([0.4257, 0.5204], [0.3297, 0.4350])

     | Show Table
    DownLoad: CSV

    Step 4: The outcomes of the scoring function were sorted after being computed using Eq (1). The middle value was selected as the reference point. as can be seen in Table 4.

    Table 4.  Scoring matrix.
    (1) {M_1} {M_2} {M_3} {M_4}
    {A_1} 0.7103 0.7430 -0.0780 0.5407
    {A_2} 0.7595 0.6534 0.3460 0.3864
    {A_3} 0.6933 0.4533 0.2248 0.7485
    {A_4} 0.7861 0.6663 0.1209 0.1597
    {A_5} 0.5972 0.7424 -0.0510 0.5664
    Ranking {A_4} > {A_2} > {A_1} > {A_3} > {A_5} {A_1} > {A_5} > {A_4} > {A_2} > {A_3} {A_2} > {A_3} > {A_4} > {A_5} > {A_1} {A_3} > {A_5} > {A_1} > {A_2} > {A_4}
    The reference point {A_1} {A_4} {A_4} {A_1}
    (2) {M_1} {M_2} {M_3} {M_4}
    {A_1} 0.7517 0.3745 0.6059 0.6805
    {A_2} 0.5846 0.1011 0.6197 0.5339
    {A_3} 0.7097 -0.0903 0.5953 0.6886
    {A_4} 0.7478 0.0808 0.5933 0.6904
    {A_5} 0.7342 0.3422 0.4604 0.5263
    Ranking {A_1} > {A_4} > {A_5} > {A_3} > {A_2} {A_1} > {A_5} > {A_2} > {A_4} > {A_3} {A_2} > {A_1} > {A_3} > {A_4} > {A_5} {A_4} > {A_3} > {A_1} > {A_2} > {A_5}
    The reference point {A_5} {A_2} {A_3} {A_1}

     | Show Table
    DownLoad: CSV

    Step 5: Construct the weighted standard decision matrix. Calculate the distance according to Eq (7), construct the standardized decision matrix, and multiply it by the weights to obtain the weighted standard decision matrix illustrated in Table 5.

    Table 5.  Weighted standard decision matrix.
    (1) {M_1} {M_2} {M_3} {M_4} (2) {M_1} {M_2} {M_3} {M_4}
    {A_1} 0 0.0083 -0.0056 0 {A_1} 0.0025 0.0090 0.0010 0
    {A_2} 0.0088 -0.0026 0.0048 -0.0046 {A_2} -0.0212 0 0.0032 -0.0202
    {A_3} -0.0030 -0.0244 0.0034 0.0122 {A_3} -0.0029 -0.0081 0 0.0011
    {A_4} 0.0150 0 0 -0.0163 {A_4} 0.0031 -0.0010 -0.0093 0.0075
    {A_5} -0.0180 0.0083 -0.0061 0.0015 {A_5} 0 0.0078 -0.0075 -0.0195

     | Show Table
    DownLoad: CSV

    Step 6: Use Eqs (14) and (15) to calculate the consistency matrix and the inconsistency matrix, respectively. The results of the calculations are shown in Tables 6 and 7.

    Table 6.  The consistent matrix.
    (1) {A_1} {A_2} {A_3} {A_4} {A_5} (2) {A_1} {A_2} {A_3} {A_4} {A_5}
    {A_1} 0 0.4778 0.7750 0.4778 0.8629 {A_1} 0 0.7638 0.6836 0.3278 1.0000
    {A_2} 0.5225 0 0.8629 0.2253 0.5225 {A_2} 0.2362 0 0.3278 0.3278 0.2362
    {A_3} 0.2253 0.1374 0 0.2253 0.6599 {A_3} 0.3164 0.6722 0 0.2362 0.5526
    {A_4} 0.5225 0.7750 0.7750 0 0.5225 {A_4} 0.6722 0.6722 0.7638 0 0.6722
    {A_5} 0.1374 0.4778 0.3404 0.4778 0 {A_5} 0 0.7638 0.4474 0.3278 0

     | Show Table
    DownLoad: CSV
    Table 7.  The contradiction matrix.
    (1) {A_1} {A_2} {A_3} {A_4} {A_5} (2) {A_1} {A_2} {A_3} {A_4} {A_5}
    {A_1} 0 0.2805 0.9326 1.0000 1.0000 {A_1} 0 1.0000 1.0000 1.0000 1.0000
    {A_2} 1.0000 0 0.5238 1.0000 1.0000 {A_2} 0.6514 0 1.0000 0.6025 0.5308
    {A_3} 1.0000 1.0000 0 1.0000 1.0000 {A_3} 0.0181 0.7594 0 0.5087 0.3750
    {A_4} 0.5400 0.1687 0.3454 0 0.5886 {A_4} 0.2182 1.0000 1.0000 0 0.8877
    {A_5} 0.2563 0.3536 0.8855 1.0000 0 {A_5} 0 1.0000 1.0000 1.0000 0

     | Show Table
    DownLoad: CSV

    Step 7: Calculate the exhaustive matrix using Eq (16), as given in Table 8.

    Table 8.  Synthesis matrix.
    (1) {A_1} {A_2} {A_3} {A_4} {A_5} (2) {A_1} {A_2} {A_3} {A_4} {A_5}
    {A_1} 0 0.1973 -0.1576 -0.5222 -0.1371 {A_1} 0 -0.2362 -0.3164 -0.6722 0
    {A_2} -0.4775 0 0.3391 -0.7747 -0.4775 {A_2} -0.4152 0 -0.6722 -0.2747 -0.2946
    {A_3} -0.7747 -0.8626 0 -0.7747 -0.3401 {A_3} 0.2983 -0.0872 0 -0.2725 0.1776
    {A_4} -0.0175 0.6063 0.4296 0 -0.0661 {A_4} 0.4540 -0.3278 -0.2362 0 -0.2155
    {A_5} -0.1189 0.1242 -0.5451 -0.5222 0 {A_5} 0 -0.2362 -0.5526 -0.6722 0

     | Show Table
    DownLoad: CSV

    Step 8: Determine each option's total advantage value, total disadvantage value and total evaluation value using Eqs (17)–(19), respectively. As demonstrated in Table 9, the greater the total evaluation value is the better the option.

    Table 9.  Decision outcome.
    (1) {A_1} {A_2} {A_3} {A_4} {A_5} (2) {A_1} {A_2} {A_3} {A_4} {A_5}
    \eta -0.6196 -1.3906 -2.7521 0.9523 -1.0620 \eta -1.2248 -1.6566 0.1162 -0.3254 -1.4610
    \chi -1.3886 0.0652 0.0659 -2.5938 -1.0208 \chi 0.3372 -0.8874 -1.7774 -1.8916 -0.3324
    \mu 0.7690 -1.4559 -2.8180 3.5461 -0.0412 \mu -1.5620 -0.7692 1.8936 1.5662 -1.1286
    Ranking {A_4} > {A_1} > {A_5} > {A_2} > {A_3} Ranking {A_3} > {A_4} > {A_2} > {A_5} > {A_1}
    The optimal choice {A_4} The optimal choice {A_3}

     | Show Table
    DownLoad: CSV

    According to the proposed weighted optimization-based (p, q)-rung interval-valued orthopair fuzzy multi-attribute group decision-making algorithm described above, it can be seen that the ranking of 5 alternative schemes for City 1 is A4 > A1 > A5 > A2 > A3, with Internet company A4 being the optimal choice. The ranking of the five alternatives for City 2 is A3 > A4 > A2 > A5 > A1, in which Real Estate Company A3 is the best choice.

    To validate the efficacy of our research, we conduct sensitivity analysis on the parameters p and q in section 5.2. The outcomes are demonstrated in Tables 1013 and Figures 1 and 2, along with a concise analysis.

    Table 10.  Different p values correspond to the ranking results of each program (q = 5).
    Parameters \mu \left({{A_1}} \right) \mu \left({{A_2}} \right) \mu \left({{A_3}} \right) \mu \left({{A_4}} \right) \mu \left({{A_5}} \right) Ranking
    p=7 1.5034 -1.2264 -4.0689 3.7734 0.0185 {A_4} > {A_1} > {A_5} > {A_2} > {A_3}
    p =9 2.3397 -1.2818 -4.4914 3.8681 -0.4347 {A_4} > {A_1} > {A_5} > {A_2} > {A_3}
    p =11 2.7629 -1.2712 -4.6702 3.9270 -0.7485 {A_4} > {A_1} > {A_5} > {A_2} > {A_3}
    p =13 2.8024 -1.2966 -4.6584 3.9484 -0.7957 {A_4} > {A_1} > {A_5} > {A_2} > {A_3}
    p =15 2.8024 -1.3585 -4.6069 3.9645 -0.0815 {A_4} > {A_1} > {A_5} > {A_2} > {A_3}

     | Show Table
    DownLoad: CSV
    Table 11.  Different p values correspond to the ranking results of each program (q = 5).
    Parameters \mu \left({{A_1}} \right) \mu \left({{A_2}} \right) \mu \left({{A_3}} \right) \mu \left({{A_4}} \right) \mu \left({{A_5}} \right) Ranking of (2)
    p=7 -1.0441 -0.9375 2.3881 1.0526 -1.4591 {A_3} > {A_4} > {A_2} > {A_1} > {A_5}
    p =9 -1.2615 -1.1624 2.8060 0.4933 -0.8753 {A_3} > {A_4} > {A_5} > {A_2} > {A_1}
    p =11 -1.3977 -1.3085 3.0543 0.7143 -1.0624 {A_3} > {A_4} > {A_5} > {A_2} > {A_1}
    p =13 -1.1798 -0.5228 2.8793 0.0982 -1.2750 {A_3} > {A_4} > {A_2} > {A_1} > {A_5}
    p =15 -0.7101 -1.0968 2.9707 0.1056 -1.2694 {A_3} > {A_4} > {A_1} > {A_2} > {A_5}

     | Show Table
    DownLoad: CSV
    Table 12.  Different q values correspond to the ranking results of each program (p = 5).
    Parameters \mu \left({{A_1}} \right) \mu \left({{A_2}} \right) \mu \left({{A_3}} \right) \mu \left({{A_4}} \right) \mu \left({{A_5}} \right) Ranking
    q=7 0.6114 -1.4049 -2.3561 2.7922 0.3574 {A_4} > {A_1} > {A_5} > {A_2} > {A_3}
    q=9 0.7387 -1.3575 -2.1852 2.0133 0.7907 {A_4} > {A_5} > {A_1} > {A_2} > {A_3}
    q=11 0.6297 -1.2825 -2.1536 1.9152 0.8913 {A_4} > {A_5} > {A_1} > {A_2} > {A_3}
    q=13 0.5780 -1.2026 -2.1537 1.9108 0.8676 {A_4} > {A_5} > {A_1} > {A_2} > {A_3}
    q=15 -0.1387 -1.1343 -2.1537 1.9092 1.5175 {A_4} > {A_5} > {A_1} > {A_2} > {A_3}

     | Show Table
    DownLoad: CSV
    Table 13.  Different q values correspond to the ranking results of each program (p = 5).
    Parameters \mu \left({{A_1}} \right) \mu \left({{A_2}} \right) \mu \left({{A_3}} \right) \mu \left({{A_4}} \right) \mu \left({{A_5}} \right) Ranking of (2)
    q=7 -1.6980 -1.0379 2.1609 1.8643 -1.2893 {A_3} > {A_4} > {A_2} > {A_5} > {A_1}
    q=9 -1.6029 -0.9511 1.8325 1.6267 -0.9051 {A_3} > {A_4} > {A_5} > {A_2} > {A_1}
    q=11 -1.4615 -0.7443 1.4605 1.2737 -0.5284 {A_3} > {A_4} > {A_5} > {A_2} > {A_1}
    q=13 -1.2168 -0.5546 1.0502 0.8691 -0.1480 {A_3} > {A_4} > {A_5} > {A_2} > {A_1}
    q=15 -0.8620 -0.3997 0.5824 0.4804 0.1989 {A_3} > {A_4} > {A_5} > {A_2} > {A_1}

     | Show Table
    DownLoad: CSV
    Figure 1.  Different p values correspond to the results of the ranking of each scheme diagram.
    Figure 2.  Different q values correspond to the results of the ranking of each scheme diagram.

    According to Tables 1013 and Figures 1 and 2, the difference between the optimal and second-best solutions decreases as the other parameter increases when one parameter is held constant. The decision-maker's risk aversion is reflected in the values of p and q. This indicates that decision-makers become more risk-averse, and thus the parameters' values should be determined based on the decision-maker's preferences regarding risk. As shown in Figures 1 and 2, as the values of p and q vary, so do the total judgement value and ranking of each alternative. However, the optimal option is always the same, demonstrating the dependability of the decision results obtained in this investigation.

    This part evaluates the effectiveness and rationality of the proposed algorithm in comparison to existing multi-attribute decision-making methods. Wang et al. [35] combined fuzzy evaluation, weighted average and ranking methods to propose a q-rung orthopair fuzzy set based MABAC method to solve the multi-attribute group decision problem. Garg et al. [36] put forward the notion of a complex interval-valued q-rung orthopair fuzzy set and investigated the TOPSIS method in order to assess the work's dependability and efficacy. Ju et al. [37] proposed a definition of an interval-valued q-rung orthopair fuzzy set along with a few interval-valued q-rung orthopair weighted averaging operators and then developed an original method for resolving multiple-attribute decision-making problems. To make the algorithms' comparability better, this part sets the values of the parameters p and q to 3. As shown in Tables 14 and 15 and Figure 3, these two decision-making techniques are applied to the case study in this paper, and the resulting decision-making outcomes are compared to those of the proposed algorithm.

    Table 14.  Comparing the algorithm applied to City 1 with the decision-making results of [35,36,37].
    Result of (1) Ranking
    {A_1} {A_2} {A_3} {A_4} {A_5}
    Wang's [35] method 0.5089 0.5228 0.4574 0.6094 0.4839 {A_4} > {A_2} > {A_1} > {A_5} > {A_3}
    Garg's [36] method 0.6741 0.6203 0.6169 0.6914 0.6315 {A_4} > {A_1} > {A_5} > {A_2} > {A_3}
    Ju's [37] method 0.6278 0.5731 0.5295 0.6990 0.5560 {A_4} > {A_1} > {A_2} > {A_5} > {A_3}
    Our proposed method 0.1222 -0.6268 -1.4412 2.7097 -0.7639 {A_4} > {A_1} > {A_2} > {A_5} > {A_3}

     | Show Table
    DownLoad: CSV
    Table 15.  Comparing the algorithm applied to City 2 with the decision-making results of [35,36,37].
    Result of (2) Ranking
    {A_1} {A_2} {A_3} {A_4} {A_5}
    Wang's [35] method 0.3959 0.4858 0.5994 0.4857 0.4678 {A_3} > {A_2} > {A_4} > {A_5} > {A_1}
    Garg's [36] method 0.5286 0.5620 0.8369 0.7693 0.7463 {A_3} > {A_4} > {A_5} > {A_2} > {A_1}
    Ju's [37] method 0.5660 0. 6278 0.6921 0.6619 0.5831 {A_3} > {A_4} > {A_2} > {A_5} > {A_1}
    Our proposed method -1.5620 -0.7692 1.8936 1.5662 -1.1286 {A_3} > {A_4} > {A_2} > {A_5} > {A_1}

     | Show Table
    DownLoad: CSV
    Figure 3.  Comparing the algorithm with the decision-making results of literature [35,36,37].

    The data in Tables 14 and 15 and Figure 3 may be used to derive the following conclusions:

    (1) Tables 14 and 15 present the decision results obtained using the proposed algorithm and existing decision methods for City 1 and City 2, respectively. The ranking results in both tables may not be exactly the same, but all three decision-making methods ultimately arrive at the same final choice. This consistency demonstrates that the effectiveness of the proposed algorithm is not accidental; it holds true universally. Consequently, the proposed algorithm provides a novel and reliable approach to solving multi-attribute group decision-making problems.

    (2) Although there may be slight differences in the ranking results between the approaches described in [35,36,37] and the method proposed in this work, the optimal solution remains the same. This observation confirms the feasibility of the suggested algorithm. Given the inherent fuzziness of the decision-making environment, the ranking outcomes of the proposed method may vary for different parameter values. Figure 3 illustrates that the discrepancy between the optimal solution and the next-best solution obtained by the proposed algorithm is greater, indicating that the decision-making results are more discernible and persuasive.

    (3) In comparison to the existing MABAC method, TOPSIS method and weighted average operator decision method, this paper not only further expands the desirable range of attribute values to provide a broader decision-making environment for decision makers but also takes into account the interaction between decision makers and the relationship between attributes, optimizes the weights and improves the ELECTRE method based on these considerations to make the decision results more reasonable. Therefore, the decision method proposed in this paper is more suitable for solving real-world decision problems. The accuracy and robustness of the proposed algorithm are also verified by two sets of data and comparison with existing decision-making methods.

    Overall, the proposed algorithm not only addresses the limitations of existing methods but also enhances the decision-making process by incorporating a wider range of attribute values and considering the interaction between decision-makers and attributes. The results validate the effectiveness and applicability of the proposed algorithm, making it a valuable tool for decision-makers facing complex and uncertain decision-making scenarios.

    In this paper, the (p, q)-rung interval-valued orthopair fuzzy multi-attribute group decision-making algorithm based on weight optimization was proposed and verified. The main contributions of this paper are summarized as follows: (1) The definition of (p, q)-rung interval-valued orthopair fuzzy sets is proposed. The scoring function, entropy, weighted average operator and distance measure are defined, and their properties are studied. (2) A weight optimization model is established to determine the optimal weight. It mainly includes considering the interaction between decision-makers and the relationship between attributes, and the ANP and entropy method are used to solve the subjective and objective weights, respectively. Considering the influence of subjective and objective weights on combination weights, a genetic algorithm is used to iteratively find the optimal solution of combination weights, taking the deviation degree and dispersion degree of subjective and objective weights as objective functions. (3) An improved (p, q)-rung interval-valued orthopair fuzzy ELECTRE method is proposed. This method integrates the optimal weights obtained from the weight optimization model with the relevant definitions of (p, q)-rung interval-valued orthopair fuzzy sets, building a novel multi-attribute decision model. Finally, the accuracy and robustness of the proposed algorithm are verified by the analysis of two datasets and comparisons with existing decision-making methods. To sum up, the above research content has demonstrated certain advantages and can find widespread applications in fields such as investment decision-making, supply chain management, environmental management and human resource management. However, it should be noted that the genetic algorithm employed in the weight optimization model may encounter the issue of local optima, potentially resulting in some deviation from the proposed algorithm. Future research will focus on combining deep learning with genetic algorithms to further improve the accuracy of the algorithm. In addition, future research goals of this work include applying improved decision methods to semantic environments [38,39,40,41,42].

    The authors declare they have not used artificial intelligence (AI) tools in the creation of this article.

    The authors would like to thank the National Natural Science Foundation of China for supporting this work by Grant Code: 11371174, 11301227. The authors would like to thank the anonymous reviewers and the editor for their valuable and fruitful comments which greatly improved the manuscript quality.

    The authors declare no conflicts of interest.



    [1] R. Agarwal, Difference Equations and Inequalities: Theory, Methods, and Applications, 2 Eds, New York: CRC Press, 2000.
    [2] R. Agarwal, S. Hristova, A. Golev, et al., Monotone-iterative method for mixed boundary value problems for generalized difference equations with "maxima", J. Appl. Math. Comput., 43 (2013), 213-233.
    [3] L. J. S. Allen, Some discrete-time SI, SIR, and SIS epidemic models, Math. Biosci., 124 (1994), 83-105.
    [4] J. Almeida, C. Silvestre, A. Pascoa, Continuous-time consensus with discrete-time communications, Syst. Control Lett., 61 (2012), 788-796.
    [5] S. Elaydi, An Introduction to Difference Equations, 3 Eds., Springer, 2005.
    [6] W. Hu, Q. Zhu, Moment exponential stability of stochastic nonlinear delay systems with impulse effects at random times, Intern. J. Robust Nonl. Contr., 29 (2019), 3809-3820.
    [7] G. Jing, Y. Zheng, L. Wang, Consensus of multiagent systems with distance-dependent communication networks, IEEE T. Neur. Net. Lear., 28 (2017), 2712-2726.
    [8] W. G. Kelley, A. C. Peterson, Difference Equations: An Introduction with Applications, 2 Eds., Academic Press, 2001.
    [9] U. Krause, A discrete nonlinear and non-autonomous model of consensus formation, Commun. Differ. Equations, 2000 (2000), 227-236.
    [10] J. L. Li, J. H. Shen, Positive solutions for first order difference equations with impulses, Int. J. Differ. Equations, 1 (2006), 225-239.
    [11] B. Liu, W. Lu, L. Jiao, et al., Consensus in networks of multi-agents with stochastically switching topology and time-varying delays, SIAM J. Control Optim., 56 (2018), 1884-1911.
    [12] J. Ma, Y. Zheng, L. Wang, LQR-based optimal topology of leader following consensus, J. Robust Nonlinear Control, 25 (2015), 3404-3421.
    [13] A. B. Malinowska, E. Schmeidel, M. Zdanowicz, Discrete leader-following consensus, Math. Meth. Appl. Sci., 40 (2017), 7307-7315.
    [14] S. Mohamad, K. Gopalsamy, Exponential stability of continuoustime and discrete-time cellular neural networks with delays, Appl. Math. Comput., 135 (2003), 17-38.
    [15] R. Olfati-Saber, J. Fax, R. Murray, Consensus and cooperation in networked multi-agent systems, Proc. of the IEEE, 95 (2007), 215-233.
    [16] L. Wang, F. Xiao, A new approach to consensus problems in discrete-time multi-agent systems with time-delays, F. Sci. China Ser. F, 50 (2007), 625-635.
    [17] W. Ni, D. Z. Cheng, Leader-following consensus of multi-agent systems under fixed and switching topologies, Syst. Control Lett., 59 (2010), 209-217.
    [18] Z. Yu, H. Jiangn, C. Hu, Leader-following consensus of fractional-order multi-agent systems under fixed topology, Neurocomputing, 149 (2015), 613-620.
    [19] Q. Zhu, pth Moment exponential stability of impulsive stochastic functional differential equations with Markovian switching, J. Franklin Inst., 351 (2014), 3965-3986.
    [20] Q. Zhu, J. Cao, Stability analysis of Markovian jump stochastic BAM neural networks with impulse control and mixed time delays, IEEE T. Neur. Net. Lear., 23 (2012), 467-479.
    [21] Q. Zhu, J. Cao, R. Rakkiyappan, Exponential input-to-state stability of stochastic CohenGrossberg neural networks with mixed delays, Nonlinear Dyn., 79 (2015), 1085-1098.
    [22] Q. Zhu, B. Song, Exponential stability of impulsive nonlinear stochastic differential equations with mixed delays, Nonlinear Anal. Real World Appl., 12 (2011), 2851-2860.
    [23] W. Zou, P. Shi, Z. Xiang, et al., Consensus tracking control of switched stochastic nonlinear multiagent systems via event-triggered strategy, IEEE T. Neur. Net. Lear., DOI: 10.1109/TNNLS.2019.2917137.
    [24] W. Zou, Z. Xiang, C. K. Ahn, Mean square leader-following consensus of second-order nonlinear multi-agent systems with noises and unmodeled dynamics, IEEE T. Sys. Man Cybern., DOI: 10.1109/TSMC.2018.2862140.
  • This article has been cited by:

    1. Humaira Kalsoom, Zareen A. Khan, Hermite-Hadamard-Fejér Type Inequalities with Generalized K-Fractional Conformable Integrals and Their Applications, 2022, 10, 2227-7390, 483, 10.3390/math10030483
    2. MAYSAA AL-QURASHI, SAIMA RASHID, YELIZ KARACA, ZAKIA HAMMOUCH, DUMITRU BALEANU, YU-MING CHU, ACHIEVING MORE PRECISE BOUNDS BASED ON DOUBLE AND TRIPLE INTEGRAL AS PROPOSED BY GENERALIZED PROPORTIONAL FRACTIONAL OPERATORS IN THE HILFER SENSE, 2021, 29, 0218-348X, 2140027, 10.1142/S0218348X21400272
    3. Asha B. Nale, Vaijanath L. Chinchane, Satish K. Panchal, Christophe Chesneau, Pólya–Szegö Integral Inequalities Using the Caputo–Fabrizio Approach, 2022, 11, 2075-1680, 79, 10.3390/axioms11020079
    4. Zhiqiang Zhang, Ghulam Farid, Sajid Mehmood, Kamsing Nonlaopon, Tao Yan, Generalized k-Fractional Integral Operators Associated with Pólya-Szegö and Chebyshev Types Inequalities, 2022, 6, 2504-3110, 90, 10.3390/fractalfract6020090
    5. Zhiqiang Zhang, Ghulam Farid, Sajid Mehmood, Chahn-Yong Jung, Tao Yan, Generalized k-Fractional Chebyshev-Type Inequalities via Mittag-Leffler Functions, 2022, 11, 2075-1680, 82, 10.3390/axioms11020082
    6. Shuang-Shuang Zhou, Saima Rashid, Erhan Set, Abdulaziz Garba Ahmad, Y. S. Hamed, On more general inequalities for weighted generalized proportional Hadamard fractional integral operator with applications, 2021, 6, 2473-6988, 9154, 10.3934/math.2021532
    7. Tariq A. Aljaaidi, Deepak B. Pachpatte, Mohammed S. Abdo, Thongchai Botmart, Hijaz Ahmad, Mohammed A. Almalahi, Saleh S. Redhwan, (k, ψ)-Proportional Fractional Integral Pólya–Szegö- and Grüss-Type Inequalities, 2021, 5, 2504-3110, 172, 10.3390/fractalfract5040172
  • Reader Comments
  • © 2019 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(3797) PDF downloads(446) Cited by(3)

Figures and Tables

Figures(12)  /  Tables(5)

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog