Next Article in Journal
Accelerated Subgradient Extragradient Algorithm for Solving Bilevel System of Equilibrium Problems
Next Article in Special Issue
Analysis of the Impact of Big Data and Artificial Intelligence Technology on Supply Chain Management
Previous Article in Journal
A Systematic Literature Review on Identifying Patterns Using Unsupervised Clustering Algorithms: A Data Mining Perspective
Previous Article in Special Issue
Fuzzy Model Parameter and Structure Optimization Using Analytic, Numerical and Heuristic Approaches
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

q-Rung Orthopair Fuzzy Archimedean Aggregation Operators: Application in the Site Selection for Software Operating Units

by
Mijanur Rahaman Seikh
*,† and
Utpal Mandal
*,†
Department of Mathematics, Kazi Nazrul University, Asansol 713340, India
*
Authors to whom correspondence should be addressed.
These authors contributed equally to this work.
Symmetry 2023, 15(9), 1680; https://doi.org/10.3390/sym15091680
Submission received: 21 July 2023 / Revised: 26 August 2023 / Accepted: 29 August 2023 / Published: 31 August 2023
(This article belongs to the Special Issue Recent Advances in Fuzzy Optimization Methods and Models)

Abstract

:
The q-rung orthopair fuzzy (q-ROF) set is an efficient tool for dealing with uncertain and inaccurate data in real-world multi-attribute decision-making (MADM). In MADM, aggregation operators play a significant role. The majority of well-known aggregation operators are formed using algebraic, Einstein, Hamacher, Frank, and Yager t-conorms and t-norms. These existing t-conorms and t-norms are some special cases of Archimedean t-conorms (ATCNs) and Archimedean t-norms (ATNs). Therefore, this article aims to extend the ATCN and ATN operations under the q-ROF environment. In this paper, firstly, we present some new operations for q-ROF sets based on ATCN and ATN. After that, we explore a few desirable characteristics of the suggested operational laws. Then, using these operational laws, we develop q-ROF Archimedean weighted averaging (geometric) operators, q-ROF Archimedean order weighted averaging (geometric) operators, and q-ROF Archimedean hybrid averaging (geometric) operators. Next, we develop a model based on the proposed aggregation operators to handle MADM issues. Finally, we elaborate on a numerical problem about site selection for software operating units to highlight the adaptability and dependability of the developed model.

1. Introduction

We have plenty of options today for every single decision we make in our daily lives. However, choosing the best option from the available alternatives is extremely difficult if each option satisfies a different viewpoint. Multi-attribute decision-making (MADM) is a modern procedure to identify the most desirable alternative that maximizes our profit according to the attribute values. The theory and methods of MADM are used to make several important decisions, such as personnel selection, industrialization, waste management, site selection, and so on. Three critical steps comprise the MADM procedure. The first step is to collect information about alternatives based on various attributes. The second step is to aggregate the collected information to produce the overall decision value of the target. The best option must be chosen in the final step after ranking the alternatives in order of preference. The ambiguity and uncertainty of real-life scenarios emanate from an absence of appropriate knowledge and information.
The most significant aspect of decision-making problems is displaying attribute values more efficiently and precisely. In the real world, we frequently have to make decisions. However, it can be challenging to fully prepare for the task. In everyday life, it is more appropriate to elicit attribute values by fuzzy numbers [1] rather than exact values because of insufficient information and the complexity of the MADM issues. However, the fuzzy set is only defined by the membership degree (MD), which is insufficient for making several real-life decisions. The decision-makers also provide the nonmembership degree (NMD) to assess the attribute values. Attansov [2] initiated the intuitionistic fuzzy set (IFS) associated with MD and NMD, whose sum is constrained to 1 . Many studies have been recently developed to address various MADM issues with IFSs [3,4]. Seikh and Mandal [5] established Dombi aggregation operators (AOs) for fusing job information and selecting the most preferable job using intuitionistic fuzzy (IF) data. Senapati et al. [6] developed IF Aczel-Alsina operators and applied them to choose sustainable transportation-sharing practices. Gohain, Chutia, and Dutta [7] introduced a symmetric distance in the IF environment and applied it to solving pattern recognition and clustering problems. Ke et al. [8] developed a ranking method for IFSs and applied it in selecting sites for photovoltaic poverty alleviation projects. Wan and Yi [9] proposed the power average operators of trapezoidal intuitionistic fuzzy numbers using strict t-norms and t-conorms.
However, IFS is insufficient to handle situations when the sum of the MD and NMD values is greater than 1. To address this issue, Yager [10] introduced the Pythagorean fuzzy set (PyFS). The total value of the squares of MD and NMD in PyFS is limited to 1. The PyFSs have been utilized to solve several complex MADM problems [11,12]. Combining SWARA and CODAS methods, Ayyildiz [13] established a decision-making approach and applied it to select e-scooter charging station locations. Ertemel et al. [14] presented an integrated MADM methodology based on PyFSs by combining the CRITIC and TOPSIS methods and using them to assess adolescents’ smartphone addiction levels. Giri, Molla, and Biswas [15] presented the DEMATEL method using PyFSs and utilized it for supplier selection problems.
Later, Yager [16] introduced q-ROFSs as an expansion of IFSs and PyFSs. The q-ROFSs is an effective approach to modeling ambiguity and uncertainty. In q-ROFSs, the total value of the qth power of the MD and NMD is constrained to 1 . The concept of q-ROFSs has been implemented effectively for a variety of MADM problems. Mandal and Seikh [17] proposed an improved score function for the ROFSs and developed the EDAS method with q-rung orthopair fuzzy data to select a vacant post of a company. Peng and Liu [18] introduced some novel formulae for information measures of q-ROFSs and applied them to several decision-making problems. Wang et al. [19] introduced a q-ROF environment-based MABAC model and utilized it in solving MADM problems. Seikh and Mandal [20] developed q-ROF Frank AOs and utilized them in solving MADM problems. Wang et al. [21] introduced Muirhead mean AOs for fusing q-ROF information. Wang et al. [22] defined q-ROF Hamy mean operators and used them in their work on enterprise resource planning systems. Kausar et al. [23] expanded the CODAS approach to the q-ROF framework and applied it to assess cancer risk.
The second step of the MADM method requires integrating the evaluation information of the attributes to select the most promising one. We are accustomed to two methods for obtaining the best option. The first is a traditional evaluation method that can only determine the ranking of alternatives. The second approach involves an information aggregation approach which supplies comprehensive evaluation values for all the alternatives. AOs are mathematical tools to aggregate or combine information. AOs can combine some finite numerical values into a single datum. Therefore, to enhance feasibility while dealing with MADM problems, the second approach shows more efficiency, which motivates us to research further. As a result, the second approach provides greater efficiency in dealing with MADM problems, motivating us to conduct additional research.
Generally, the AOs under various fuzzy environments are established with the help of algebraic, Einstein, Hamacher, and Frank t-norm (TN) and t-conorm (TCN) methods. However, these existing TCNs and TNs are some particular cases of ATCNs and ATNs [24,25]. By changing the value of the additive generator, the ATCN, and ATN can be converted into different forms. As a result, the ATCN and ATN are more adaptable, powerful, and generalized. Many scholars have proposed AOs in a variety of fuzzy environments using ATCN and ATN for integrating ambiguous data, for example, complex IF environment [26], interval type-2 fuzzy environment [27], Pythagorean hesitant fuzzy [28], dual hesitant fuzzy linguistic [29], hesitant trapezoidal fuzzy environment [30], interval-valued dual hesitant fuzzy [31], and t-spherical fuzzy environment [32]. According to the above literature review, many authors have developed AOs based on ATCN and ATN in several fuzzy environments. However, no authors have utilized ATCN and ATN to construct AOs under the q-ROF environment. Therefore, this paper aims to present AOs utilizing ATCN and ATN to combine q-ROF information. Inspired by the ATCN and ATN-based AOs under an intuitionistic fuzzy environment [33], in this paper, our goals are:
  • To develop q-ROF Archimedean weighted averaging (q-ROFAWA), q-ROF Archimedean order weighted averaging (q-ROFAOWA) and q-ROF Archimedean hybrid averaging (q-ROFAHA) AOs.
  • To develop q-ROF Archimedean weighted geometric (q-ROFAWG), q-ROF Archimedean order weighted geometric (q-ROFAOWG) and q-ROF Archimedean hybrid geometric (q-ROFAHG) AOs.
  • To discuss some desirable characteristics of the suggested operators and to show our proposed operators are the generalizations of algebraic, Einstein, Hamacher, Frank, Yager TCN, and TN-based AO.
  • To present a model for dealing with MADM problems that depend on the suggested q-ROFAWA and q-ROFAWG operators.
  • To illustrate the potency and supremacy of the suggested model by emphasizing a numerical problem about site selection for software operating units.
The remaining portions of this article proceed as follows: several fundamental preliminaries are described in Section 2. We define a few novel operational rules for q-ROFNs based on ATCN and ATN in Section 3. In Section 4, some new AOs are established under a q-ROF environment, and their desirable characteristics are discussed based on ATCN and ATN. In Section 5, we utilize the q-ROFAWA and q-ROFAWG operators to develop some approaches for handling MADM problems. In Section 6, we elaborate on a numerical problem about site selection for software operating units to illustrate the adaptability and viability of our suggested approach. Then in Section 7, our model is compared with some well-known methods. Finally, Section 8 presents the conclusions of the paper.

2. Preliminaries

Here, we will have a look at some basic preliminaries.
Definition 1
([16]). The q-ROFS σ over the universal set P is interpreted as
σ = { < , μ σ ( ) , ν σ ( ) > | P } .
Here, μ σ : P [ 0 , 1 ] and ν σ : P [ 0 , 1 ] are identified as the MD and the NMD to the set σ , respectively, where ( μ σ ( ) ) q + ( ν σ ( ) ) q 1 , q 1 for every P . For clarity, Liu and Wang [34] defined σ = ( μ σ , ν σ ) a q-ROF number (q-ROFN).
Definition 2
([34]). The score and the accuracy functions of the q-ROFN σ = ( μ σ , ν σ ) can be illustrated as
Φ ( σ ) = μ σ q ν σ q
and
Ψ ( σ ) = μ σ q + ν σ q ,
respectively. Here, Φ ( σ ) [ 0 , 1 ] , and Ψ ( σ ) [ 0 , 1 ] .
According to Definition 2, if σ 1 = ( μ σ 1 , ν σ 1 ) and σ 2 = ( μ σ 2 , ν σ 2 ) be any two q-ROFNs then
  • σ 1 > σ 2 if Φ ( σ 1 ) > Φ ( σ 2 ) ,
  • σ 1 < σ 2 if Φ ( σ 1 ) < Φ ( σ 2 ) ,
  • If Φ ( σ 1 ) = Φ ( σ 2 ) , and
    • If Ψ ( σ 1 ) > Ψ ( σ 2 ) , then σ 1 > σ 2 ,
    • If Ψ ( σ 1 ) = Ψ ( σ 2 ) , then σ 1 = σ 2 .

ATCN and ATN

Here, we recall some basic properties of ATCN and ATN which will be utilized later.
Definition 3
([28]). Let f , g : [ 0 , 1 ] R be strictly decreasing and increasing continuous functions, respectively, with f ( 1 ) = 0 and g ( 0 ) = 0 , then f and g are called decreasing generator and increasing generator, respectively.
Definition 4
([35]). With the assistance of a decreasing generator f , strict ATN and strict ATCN are elicited as T ( h 1 , h 2 ) = f 1 ( f ( h 1 ) + f ( h 2 ) ) and S ( h 1 , h 2 ) = g 1 ( g ( h 1 ) + g ( h 2 ) ) , respectively with g ( v ) = f ( 1 v ) , h 1 , h 2 , v [ 0 , 1 ] .
In Table 1, we exhibit some renowned classes of TCN and TN as a special case of ATCN and ATN by considering different forms f .

3. ATCN and ATN Operations for q -ROFNs

Here, we develop a couple of fundamental set operations of q-ROFNs using ATCN and ATN.
Definition 5.
If σ c = ( μ σ c , ν σ c ) ( c = 1 , 2 ) are two q-ROFNs then we have
1. 
σ 1 σ 2 = g 1 ( g ( μ σ 1 q ) + g ( μ σ 2 q ) ) q , f 1 ( f ( ν σ 1 q ) + f ( ν σ 2 q ) ) q .
2. 
σ 1 σ 2 = f 1 ( f ( μ σ 1 q ) + f ( μ σ 2 q ) ) q , g 1 ( g ( ν σ 1 q ) + g ( ν σ 2 q ) ) q .
3. 
ξ σ 1 = g 1 ( ξ g ( μ σ 1 q ) ) q , f 1 ( ξ f ( ν σ 1 q ) ) q , ξ > 0 .
4. 
σ 1 ξ = f 1 ( ξ f ( ν σ 1 q ) ) q , g 1 ( ξ g ( μ σ 1 q ) ) q , ξ > 0 .
Now, we define some specific relations among the operational laws in the following portion.
Proposition 1.
The following operations for two q-ROFNs σ c = ( μ σ c , ν σ c ) ( c = 1 , 2 ) and ξ , ξ 1 , ξ 2 > 0 are valid.
1. 
σ 1 σ 2 = σ 2 σ 1 .
2. 
σ 1 σ 2 = σ 2 σ 1 .
3. 
ξ ( σ 1 σ 2 ) = ξ σ 1 ξ σ 2 .
4. 
ξ 1 σ 1 ξ 2 σ 1 = ( ξ 1 + ξ 2 ) σ 1 .
5. 
σ 1 ξ σ 2 ξ = ( σ 1 σ 2 ) ξ .
6. 
σ 1 ξ 1 σ 1 ξ 2 = σ 1 ξ 1 + ξ 2 .
Proof. 
  • σ 1 σ 2 = g 1 ( g ( μ σ 1 q ) + g ( μ σ 2 q ) ) q , f 1 ( f ( ν σ 1 q ) + f ( ν σ 2 q ) ) q
    = g 1 ( g ( μ σ 2 q ) + g ( μ σ 1 q ) ) q , f 1 ( f ( ν σ 2 q ) + f ( ν σ 1 q ) ) q = σ 2 σ 1 .
  • σ 1 σ 2 = f 1 ( f ( ν σ 1 q ) + f ( ν σ 2 q ) ) q , g 1 ( g ( μ σ 1 q ) + g ( μ σ 2 q ) ) q
    = f 1 ( f ( ν σ 2 q ) + f ( ν σ 1 q ) ) q , g 1 ( g ( μ σ 2 q ) + g ( μ σ 1 q ) ) q = σ 2 σ 1 .
  • ξ ( σ 1 σ 2 ) = ξ g 1 ( g ( μ σ 1 q ) + g ( μ σ 2 q ) ) q , f 1 ( f ( ν σ 1 q ) + f ( ν σ 2 q ) ) q
    = g 1 ( ξ ( g ( μ σ 1 q ) + g ( μ σ 2 q ) ) ) q , f 1 ( ξ ( f ( ν σ 1 q ) + f ( ν σ 2 q ) ) ) q
    ξ σ 1 ξ σ 2 = g 1 ( ξ g ( μ σ 1 q ) ) q , f 1 ( ξ f ( ν σ 1 q ) ) q g 1 ( ξ g ( μ σ 2 q ) ) q , f 1 ( ξ f ( ν σ 2 q ) ) q
    = g 1 ( ξ ( g ( μ σ 1 q ) + g ( μ σ 2 q ) ) ) q , f 1 ( ξ ( f ( ν σ 1 q ) + f ( ν σ 2 q ) ) ) q
    Therefore, ξ ( σ 1 σ 2 ) = ξ σ 1 ξ σ 2 .
  • ξ 1 σ 1 ξ 2 σ 1 = g 1 ( ξ 1 g ( μ σ 1 q ) ) q , f 1 ( ξ 1 f ( ν σ 1 q ) ) q g 1 ( ξ 2 g ( μ σ 1 q ) ) q , f 1 ( ξ 2 f ( ν σ 1 q ) ) q
    = g 1 ( ( ξ 1 + ξ 2 ) g ( μ σ 1 q ) ) q , f 1 ( ( ξ 1 + ξ 2 ) f ( ν σ 1 q ) ) q
    = ( ξ 1 + ξ 2 ) σ 1 .
  • σ 1 ξ σ 2 ξ = f 1 ( ξ f ( ν σ 1 q ) ) q , g 1 ( ξ g ( μ σ 1 q ) ) q f 1 ( ξ f ( ν σ 2 q ) ) q , g 1 ( ξ g ( μ σ 2 q ) ) q
    = f 1 ( ξ ( f ( μ σ 1 q ) + f ( μ σ 2 q ) ) ) q , g 1 ( ξ ( g ( ν σ 1 q ) + g ( ν σ 2 q ) ) ) q
    ( σ 1 σ 2 ) ξ = ξ f 1 ( f ( μ σ 1 q ) + f ( μ σ 2 q ) ) q , g 1 ( g ( ν σ 1 q ) + g ( ν σ 2 q ) ) q
    = f 1 ( ξ ( f ( μ σ 1 q ) + f ( μ σ 2 q ) ) ) q , g 1 ( ξ ( g ( ν σ 1 q ) + g ( ν σ 2 q ) ) ) q
    Therefore, σ 1 ξ σ 2 ξ = ( σ 1 σ 2 ) ξ .
  • σ 1 ξ 1 σ 1 ξ 2 = f 1 ( ξ 1 f ( ν σ 1 q ) ) q , g 1 ( ξ 1 g ( μ σ 1 q ) ) q f 1 ( ξ 2 f ( ν σ 1 q ) ) q , g 1 ( ξ 2 g ( μ σ 1 q ) ) q
    = f 1 ( ( ξ 1 + ξ 2 ) f ( ν σ 1 q ) ) q , g 1 ( ( ξ 1 + ξ 2 ) g ( μ σ 1 q ) ) q
    = σ 1 ξ 1 + ξ 2 .
Proposition 2.
Let h 1 = σ 1 σ 2 , h 2 = σ 1 σ 2 , h 3 = ξ σ 1 , h 4 = ( σ 1 ) ξ for two q-ROFNs σ c = ( μ σ c , ν σ c ) ( c = 1 , 2 ) where ξ ( R ) > 0 . Then h 1 , h 2 , h 3 and h 4 are also q-ROFNs.
Proof. 
Since g ( v ) = f ( 1 v ) , and f : [ 0 , 1 ] [ 0 , ] is a strictly decreasing function, then g ( v ) is a strictly increasing function, which implies that 0 f 1 ( f ( μ σ 1 ) + f ( μ σ 2 ) ) 1 and 0 g 1 ( g ( μ σ 1 ) + g ( μ σ 2 ) ) 1 . Additionally,
g 1 ( g ( μ σ 1 q ) + g ( μ σ 2 q ) ) q q + f 1 ( f ( ν σ 1 q ) + f ( ν σ 2 q ) ) q q = g 1 ( g ( μ σ 1 q ) + g ( μ σ 2 q ) ) + f 1 ( f ( ν σ 1 q ) + f ( ν σ 2 q ) ) f 1 ( f ( ν σ 1 q ) + f ( ν σ 2 q ) ) + g 1 ( g ( 1 ν σ 1 q ) + g ( 1 ν σ 2 q ) ) [ μ σ i q 1 ν σ i q ] = f 1 ( f ( ν σ 1 q ) + f ( ν σ 2 q ) ) + g 1 ( f ( ν σ 1 q ) + f ( ν σ 2 q ) ) [ g ( v ) = f ( 1 v ) ] = f 1 ( f ( ν σ 1 q ) + f ( ν σ 2 q ) ) + 1 f 1 ( f ( ν σ 1 q ) + f ( ν σ 2 q ) ) [ g 1 ( v ) = 1 f 1 ( v ) ] = 1 .
Therefore, h 1 = σ 1 σ 2 and h 2 = σ 1 σ 2 are q-ROFNs.
Proceeding similarly we obtain h 3 = ξ σ 1 and h 4 = ( σ 1 ) ξ which are also q-ROFNs. □

4. ATCN and ATN Based q -ROF AOs

Here, we develop the q-ROFAWA, q-ROFAOWA, q-ROFAHA, q-ROFAWG, q-ROFAOWG and q-ROFAHG AOs based on ATCN and ATN to aggregate q-ROF information.

4.1. q-ROFAWA and q-ROFAWG Operators

Definition 6.
Let σ c = ( μ σ c , ν σ c ) ( c = 1 ( 1 ) u ) be the q-ROFNs with their associated weight vector δ = ( δ 1 , δ 2 , , δ u ) T , where δ c [ 0 , 1 ] and c = 1 u δ c = 1 . Based on ATCN and ATN the q-ROFAWA operator and q-ROFAWG operator are mappings from σ u to σ and are given by
q -ROFAWA ( σ 1 , σ 2 , , σ u ) = c = 1 u δ c σ c
and
q -ROFAWG ( σ 1 , σ 2 , , σ u ) = c = 1 u δ c σ c ,
respectively.
Theorem 1.
The aggregated result of the q-ROFNs σ c = ( μ σ c , ν σ c ) ( c = 1 ( 1 ) u ) using q-ROFAWA and q-ROFAWG operators are also q-ROFNs and are defined as follows
q -ROFAWA ( σ 1 , σ 2 , , σ u ) = c = 1 u δ c σ c = g 1 c = 1 u δ c g ( μ σ c q ) q , f 1 c = 1 u δ c f ( ν σ c q ) q
and
q -ROFAWG ( σ 1 , σ 2 , , σ u ) = c = 1 u δ c σ c = f 1 c = 1 u δ c f ( μ σ c q ) q , g 1 c = 1 u δ c g ( ν σ c q ) q .
Here, f is an additive generator of continuous ATN.
Proof. 
We have established the above theorem by applying the mathematical induction principle.
For two q-ROFNs σ 1 and σ 2 , we obtain
q -ROFAWA ( σ 1 , σ 2 ) = c = 1 2 δ c σ c = δ 1 σ 1 δ 2 σ 2 = g 1 δ 1 g ( μ σ 1 q ) q , f 1 δ 1 f ( ν σ 1 q ) q g 1 δ 2 g ( μ σ 2 q ) q , f 1 δ 2 f ( ν σ 2 q ) q = g 1 c = 1 2 δ c g ( μ σ c q ) q , f 1 c = 1 2 δ c f ( ν σ c q ) q .
As a result, the outcome exists for u = 2 .
We presume that the outcome is effective when u = x .
Therefore q -ROFAWA ( σ 1 , σ 2 , , σ x ) = g 1 c = 1 x δ c g ( μ σ c q ) q , f 1 c = 1 x δ c f ( ν σ c q ) q .
Now, q -ROFAWA σ 1 , σ 2 , , σ x , σ x + 1 ) = c = 1 x + 1 δ c σ c = c = 1 x δ c σ c δ x + 1 σ x + 1
= g 1 c = 1 x δ c g ( μ σ c q ) q , f 1 c = 1 x δ c f ( ν σ c q ) q g 1 δ x + 1 g ( μ σ x + 1 q ) q , f 1 δ x + 1 f ( ν σ x + 1 q ) q
= g 1 c = 1 x + 1 δ c g ( μ σ c q ) q , f 1 c = 1 x + 1 δ c f ( ν σ c q ) q .
As a result, the result is valid when u = x + 1 .
Hence, the outcome is effective for all natural numbers u .
The other part of this theorem can be proved similarly.
Next, we show that our proposed q-ROFAWA and q-ROFAWG operators met the subsequent characteristics:
Theorem 2.
(Idempotency property). If the collection of q-ROFNs σ c = ( μ σ c , ν σ c ) ( c = 1 ( 1 ) u ) are equal, i.e., if σ c = σ = ( μ σ , ν σ ) , c , then
q -ROFAWA ( σ 1 , σ 2 , , σ u ) = σ and q -ROFAWG ( σ 1 , σ 2 , , σ u ) = σ .
Proof. 
Let σ c = σ , c = 1 , 2 u . Then μ σ c = μ σ and ν σ c = ν σ , c = 1 ( 1 ) u .
q -ROFAWA ( σ 1 , σ 2 , , σ u ) = g 1 c = 1 u δ c g ( μ σ c q ) q , f 1 c = 1 u δ c f ( ν σ c q ) q = g 1 c = 1 u δ c g ( μ σ q ) q , f 1 c = 1 u δ c f ( ν σ q ) q = g 1 g ( μ σ q ) q , f 1 f ( ν σ q ) q = ( μ σ , ν σ ) = σ .
The other part can be proven in a similar manner.
Theorem 3.
(Monotonicity property). Let { σ 1 , σ 2 , , σ u } and { σ ^ 1 , σ ^ 2 , , σ ^ u } be two sets of q-ROFNs, where σ c = ( μ σ c , ν σ c ) and σ ^ c = ( μ σ ^ c , ν σ ^ c ) for c = 1 , 2 , , u . If μ σ c μ σ ^ c and ν σ c ν σ ^ c for all c, then, q-ROFAWA ( σ 1 , σ 2 , , σ u ) q-ROFAWA ( σ ^ 1 , σ ^ 2 , , σ ^ u ) and q-ROFAWG ( σ 1 , σ 2 , , σ u ) q-ROFAWG ( σ ^ 1 , σ ^ 2 , , σ ^ u ) .
Proof. 
Since μ σ c μ σ ^ c and ν σ c ν σ ^ c for all c = 1 , 2 , , u , then, μ σ c μ σ ^ c μ σ c q μ σ ^ c q g ( μ σ c q ) g ( μ σ ^ c q ) δ c g ( μ σ c q ) δ c g ( μ σ ^ c q ) c = 1 u δ c g ( μ σ c q ) c = 1 u δ c g ( μ σ ^ c q ) g 1 c = 1 u δ c g ( μ σ c q ) q g 1 c = 1 u δ c g ( μ σ ^ c q ) q .
Similarly, it can be shown that f 1 c = 1 u δ c f ( ν σ c q ) q f 1 c = 1 u δ c f ( ν σ ^ c q ) q .
Thus,
g 1 c = 1 u δ c g ( μ σ c q ) q q f 1 c = 1 u δ c f ( ν σ c q ) q q g 1 c = 1 u δ c g ( μ σ ^ c q ) q q f 1 c = 1 u δ c f ( ν σ ^ c q ) q q .
Let σ = q -ROFAWA ( σ 1 , σ 2 , , σ u ) and σ ^ = q -ROFAWA ( σ ^ 1 , σ ^ 2 , , σ ^ u ) . Then by Definition 2, we have, Φ ( σ ) Φ ( σ ^ ) .
(I)
If Φ ( σ ) < Φ ( σ ^ ) then we have,
σ < σ ^ i.e., q -ROFAWA ( σ 1 , σ 2 , , σ u ) < q -ROFAWA ( σ 1 , σ 2 , , σ u ) .
(II)
If Φ ( σ ) = Φ ( σ ^ ) then, we obtain
g 1 c = 1 u δ c g ( μ σ c q ) q q f 1 c = 1 u δ c f ( ν σ c q ) q q = g 1 c = 1 u δ c g ( μ σ ^ c q ) q q f 1 c = 1 u δ c f ( ν σ ^ c q ) q q ,
then, by the condition μ σ c μ σ ^ c and ν σ c ν σ ^ c for all c = 1 ( 1 ) u , we have
g 1 c = 1 u δ c g ( μ σ c q ) q q = g 1 c = 1 u δ c g ( μ σ ^ c q ) q q and
f 1 c = 1 u δ c f ( ν σ c q ) q q = f 1 c = 1 u δ c f ( ν σ ^ c q ) q q .
So, from Definition 2, we have
Ψ ( σ ) = g 1 c = 1 u δ c g ( μ σ c q ) q q + f 1 c = 1 u δ c f ( ν σ c q ) q q
= g 1 c = 1 u δ c g ( μ σ ^ c q ) q q + f 1 c = 1 u δ c f ( ν σ ^ c q ) q q = Ψ ( σ ^ ) .
Therefore, from (I) and (II), q -ROFAWA ( σ 1 , σ 2 , , σ u ) q -ROFAWA ( σ ^ 1 , σ ^ 2 , , σ ^ u ) .
The other part can be proven in a similar fashion.
Theorem 4.
(Boundedness property). For a number of q-ROFNs σ c = ( μ σ c , ν σ c ) ( c = 1 , 2 , , u ) , let σ = ( min c μ σ c , max c ν σ c ) , σ + = ( max c μ σ c , min c ν σ c ) . Then
σ q -ROFAWA ( σ 1 , σ 2 , , σ u ) σ + and σ q -ROFAWG ( σ 1 , σ 2 , , σ u ) σ + .
Proof. 
For every c ( c = 1 , 2 , , u ) , we have min c μ σ c μ σ c max c μ σ c   and   min c ν σ c ν σ c max c ν σ c which implies that
g 1 c = 1 u δ c g ( ( min c μ σ c ) q ) q g 1 c = 1 u δ c g ( μ σ c q ) q g 1 c = 1 u δ c g ( ( max c μ σ c ) q ) q and f 1 c = 1 u δ c f ( ( min c μ σ c ) q ) q f 1 c = 1 u δ c f ( μ σ c q ) q f 1 c = 1 u δ c f ( ( max c μ σ c ) q ) q .
Therefore, σ q -ROFAWA ( σ 1 , σ 2 , , σ u ) σ + .
The rest of the theorem can be proved similarly.
Deduction 1.
If we assign different forms of the additive generator f , then we obtain some particular forms of q -ROFAWA and q -ROFAWG operators. Table 2 illustrates these particular forms of f .
Deduction 2.
If we put different values for the parameter q , we obtain the following cases:
1. 
For q = 1 the q-ROFAWA and q-ROFAWG operators are transformed into intuitionistic fuzzy Archimedian weighted averaging (IFAWA) [37] and IF Archimedian weighted geometric (IFAWG) [37] operators, respectively. Therefore
I F A W A ( σ 1 , σ 2 , , σ u ) = c = 1 u δ c σ c = g 1 c = 1 u δ c g ( μ σ c ) , f 1 c = 1 u δ c f ( ν σ c )
I F A W G ( σ 1 , σ 2 , , σ u ) = c = 1 u δ c σ c = f 1 c = 1 u δ c f ( μ σ c ) , g 1 c = 1 u δ c g ( ν σ c ) .
Remark 1.
For the different form of the additive generator f , we obtain some special cases of IFAWA and IFAWG operators. For example, If f ( t ) = l o g ( t ) , IFAWA and IFAWG operators are transformed into intuitionistic fuzzy weighted averaging (IFWA) [38] and intuitionistic fuzzy weighted geometric (IFWG) [39] operators, respectively. If f ( t ) = l o g ( 2 t t ) ,  IFAWA and IFAWAoperators are transformed into Einstein intuitionistic fuzzy weighted averaging (EIFWA) [37,40] and Einstein intuitionistic fuzzy weighted geometric (EIFWG) [41] operators, respectively, etc.
2. 
If q = 2 , then q-ROFAWA and q-ROFAWG operators are transformed into Pythagorean fuzzy Archimedian weighted averaging (PFAWA) operators and Pythagorean fuzzy Archimedian weighted geometric (PFAWG) operators, respectively, and they are given by
P F A W A ( σ 1 , σ 2 , , σ u ) = c = 1 u δ c σ c = g 1 c = 1 u δ c g ( μ σ c 2 ) , f 1 c = 1 u δ c f ( ν σ c 2 )
P F A W G ( σ 1 , σ 2 , , σ u ) = c = 1 u δ c σ c = f 1 c = 1 u δ c f ( μ σ c 2 ) , g 1 c = 1 u δ c g ( ν σ c 2 ) ,
respectively.
Remark 2.
If the additive generator f is taken in different forms, then we obtain some special cases of PFAWA operator. For example, If f ( t ) = l o g ( t ) , PFAWA and PFAWG operators are transformed into Pythagorean fuzzy weighted averaging (PFWA) [42] and Pythagorean fuzzy weighted geometric (PFWG) [42] operators. If f ( t ) = l o g ( 2 t t ) , PFAWA and PFAWA operators are transformed into Pythagorean fuzzy Einstein weighted averaging (PFEWA) operator [43] and Pythagorean fuzzy Einstein weighted geometric (PFEWA) operator [43], respectively, etc.
Next, we define the q-ROFAOWA and q-ROFAOWG operators as follows:

4.2. q-ROFAOWA and q-ROFAOWG Operators

Definition 7.
Let σ c = ( μ σ c , ν σ c ) ( c = 1 ( 1 ) u ) be the q-ROFNs with their associated weight vector δ = ( δ 1 , δ 2 , , δ u ) T , where δ c [ 0 , 1 ] and c = 1 u δ c = 1 . Based on ATCN and ATN the q-ROFAOWA and q-ROFAOWG operators are mappings from σ u to σ and are given by
q -ROFAOWA ( σ 1 , σ 2 , , σ u ) = c = 1 u δ c σ ϕ ( c )
q -ROFAOWG ( σ 1 , σ 2 , , σ u ) = c = 1 u δ c σ ϕ ( c ) ,
respectively, where ( ϕ ( 1 ) , ϕ ( 2 ) , , ϕ ( u ) ) is a permutation of ( 1 , 2 , , u ) with ϕ ( c ) > ϕ ( c + 1 ) , c = 1 , 2 , , u .
Theorem 5.
For the collection of q-ROFNs σ c = ( μ σ c , ν σ c ) ( c = 1 ( 1 ) u ) the aggregated results using q-ROFAOWA and q-ROFAOWG operators are also q-ROFNs and are defined as follows
q -ROFAOWA ( σ 1 , σ 2 , , σ u ) = c = 1 u δ c σ ϕ ( c ) = g 1 c = 1 u δ c g ( μ σ ϕ ( c ) q ) q , f 1 c = 1 u δ c f ( ν σ ϕ ( c ) q ) q
q -ROFAOWG ( σ 1 , σ 2 , , σ u ) = c = 1 u δ c σ ϕ ( c ) = f 1 c = 1 u δ c f ( μ σ ϕ ( c ) q ) q , g 1 c = 1 u δ c g ( ν σ ϕ ( c ) q ) q .
Here, f is the additive generator of continuous ATN.
Theorem 6.
(Idempotency property). If the collection of q-ROFNs σ c = ( μ σ c , ν σ c ) ( c = 1 ( 1 ) u ) are the same, i.e., if σ c = σ = ( μ σ , ν σ ) , c , then q -ROFAOWA ( σ 1 , σ 2 , , σ u ) = σ and q -ROFAOWG ( σ 1 , σ 2 , , σ u ) = σ .
Theorem 7.
(Monotonicity property). Let { σ 1 , σ 2 , , σ u } and { σ ^ 1 , σ ^ 2 , , σ ^ u } be two sets of q-ROFNs, where σ c = ( μ σ c , ν σ c ) and σ ^ c = ( μ σ ^ c , ν σ ^ c ) for c = 1 , 2 , , u . If μ σ ϕ ( c ) μ σ ¯ ϕ ( c ) and ν σ ϕ ( c ) ν σ ¯ ϕ ( c ) c , then, q-ROFAOWA ( σ 1 , σ 2 , , σ u ) q-ROFAOWA ( σ ^ 1 , σ ^ 2 , , σ ^ u ) and q-ROFAOWG ( σ 1 , σ 2 , , σ u ) q-ROFAOWG ( σ ^ 1 , σ ^ 2 , , σ ^ u ) .
Theorem 8.
(Boundedness property). Let σ c = ( μ σ c , ν σ c ) ( c = 1 , 2 , , u ) be the q-ROFNs. If σ = ( min c μ σ c , max c ν σ c ) , σ + = ( max c μ σ c , min c ν σ c ) , then σ q -ROFAOWA ( σ 1 , σ 2 , , σ u ) σ + and σ q -ROFAOWG ( σ 1 , σ 2 , , σ u ) σ + .
Deduction 3.
When the additive generator f and the parameter q assign different forms, some particular forms of q -ROFAOWA and q -ROFAOWG operators arise, which appear in Table 3 and Table 4, respectively.
Now, we define q-ROFAHA and q-ROFAHG operators under q-ROF circumstances.

4.3. q-ROFAHA and q-ROFAHG Operators

Here, we present q-ROFAHA, q-ROFAHG operators and also show that these operators are the generalizations of our proposed q-ROFAWA, q-ROFAOWA, q-ROFAWG and q-ROFAOWG operators.
Definition 8.
For the collection of q-ROFNs σ c = ( μ σ c , ν σ c ) ( c = 1 ( 1 ) u ) the q-ROFAHA and q-ROFAHG operators of dimension u are mappings from σ u to σ and are given by
q -ROFAHA ( σ 1 , σ 2 , , σ u ) = c = 1 u δ ¯ c σ ˙ ϕ ( c ) = g 1 c = 1 u δ ¯ c g ( μ ˙ σ ϕ ( c ) q ) q , f 1 c = 1 u δ ¯ c f ( ν ˙ σ ϕ ( c ) q ) q
and
q -ROFAHG ( σ 1 , σ 2 , , σ u ) = c = 1 u δ ¯ c σ ˙ ϕ ( c ) = f 1 c = 1 u δ ¯ c f ( μ ˙ σ ϕ ( c ) q ) q , g 1 c = 1 u δ ¯ c g ( ν ˙ σ ϕ ( c ) q ) q ,
respectively, where δ ¯ = ( δ ¯ 1 , δ 2 ¯ , , δ u ¯ ) T is the aggregation associated weight vector, c = 1 u δ c ¯ = 1 , δ c [ 0 , 1 ] is the weight of σ c , c = 1 u δ c = 1 . σ ˙ ϕ ( c ) is the i t h biggest weighted q-ROF values of σ c ˙ ( σ c ˙ = u δ c σ c , c = 1 , 2 , , u ) , u is the balancing coefficient.
Deduction 4.
Now we discuss the effectiveness of the additive generator f , the weight vectors δ ¯ , δ , and the parameter q . In addition, we investigate the relationship among the proposed q-ROFAHA and q-ROFAHG operators and other hybrid operators in the q-ROF environment.
Case 1: If we consider some particular forms of the weight vectors δ ¯ and δ, we can access some prominent q-ROF AOs by the following:
1. 
When δ = ( δ 1 , δ 2 , , δ u ) = ( 1 u , 1 u , , 1 u ) , then σ c ˙ = u × 1 u × σ c = σ c for c = 1 , 2 , , u . Thus, the q-ROFAHA and q-ROFAHG operators turn out to be q-ROFAOWA and q-ROFAOWG operators, respectively.
2. 
If δ ¯ = ( δ ¯ 1 , δ 2 ¯ , , δ u ¯ ) = ( 1 u , 1 u , , 1 u ) , then q-ROFAHA and q-ROFAHG operators become q-ROFAWA and q-ROFAWG operators, respectively.
Case 2: When the parameter q assigns different values, some particular instances of q-ROFAHA and q-ROFAHG operators arise, which are exhibited in Table 5.
Case 3: When f appoints different forms, some particular instances of q-ROFAHA and q-ROFAHG operators arise, which are exhibited in Table 6.
Remark 3.
From the above discussion, we can see that each of our proposed q-ROFAWA, q-ROFAOWA, q-ROFAHA, q-ROFAWG, q-ROFAOWG and q-ROFAHG operators is a generalization of some of the existing q-ROF AOs. According to different forms of δ and additive generator f , we can attain a comprehensive range of q-ROF AOs. Additionally, for various values of the parameter q, we can obtain AOs in different fuzzy environments. Therefore, our proposed operators are more convenient as they cover a wide range containing many special cases, which strengthens us to deal with many different decision-making situations. Additionally, utilizing our proposed operators, we can select the best alternative that maximizes our interest.

5. MADM Model Based on q -ROFAWA and q -ROFAWG Operators

Here, we present a model for solving MADM issues utilizing q-ROFAWA and q-ROFAWG operators where the attribute weights are calculated by using the entropy method. For an MADM problem, let Y = { Y 1 , Y 2 , , Y m } and = { 1 , 2 , , n } be the respective lists of m alternatives and n attributes. We postulate that some of the attributes are cost attributes, while the remainder are benefit attributes. Let δ j ( > 0 ) R be the weight of the jth attribute j , where j = 1 n δ j = 1 . Let the q-ROFN σ i j = ( μ σ i j , ν σ i j ) is the possible value for which the alternative Y i meets the attribute j . Therefore, we can build the q-ROF decision matrix M , where M = ( σ i j ) m × n .

Algorithm

The q-ROFAWA and q-ROFAWG operators-based MADM model has been outlined as follows:
Step 1:
Develop the q-ROF decision matrix M = ( σ i j ) m × n = ( ( μ σ i j , ν σ i j ) ) m × n .
Step 2:
Normalize the matrix M . Let M = ( σ i j ) m × n = ( ( μ σ i j , ν σ i j ) ) m × n be the normalized matrix of M , where σ i j is obtained by utilizing Equation (5).
σ i j = ( μ σ i j , ν σ i j ) , if j is of benefit type ; ( ν σ i j , μ σ i j ) , if j is of cost type .
Step 3:
Utilize the q-ROF entropy method developed by Seikh and Mandal [20] to estimate the subjective weights of the attributes. If δ j is the weight of the attribute j then
δ j = 1 + 1 m i = 1 m ( μ σ i j l o g ( μ σ i j ) + ν σ i j l o g ( ν σ i j ) ) j = 1 n ( 1 + 1 m i = 1 m ( μ σ i j l o g ( μ σ i j ) + ν σ i j l o g ( ν σ i j ) ) )
Step 4:
Aggregated value α c of the alternative Y c is calculated by Equation (7) or Equation (8).
α c = q -ROFAWA ( σ i 1 , σ i 2 , , σ i n ) = j = 1 n ( δ j σ i j ) = g 1 j = 1 n δ c g ( ( μ σ i j ) q ) q , f 1 j = 1 n δ c f ( ( ν σ i j ) q ) q
or
α c = q -ROFAWG ( σ i 1 , σ i 2 , , σ i n ) = j = 1 n ( δ j σ i j ) = f 1 j = 1 n δ c f ( ( μ σ i j ) q ) q , g 1 j = 1 n δ c g ( ( ν σ i j ) q ) q
Step 5:
Determine the score value Φ ( α c ) ( c = 1 ( 1 ) m ) using Equation (1) for each combined value α c ( c = 1 ( 1 ) m ) .
Step 6:
If the score value for one particular alternative is bigger than that of the others, then this is the most preferable alternative. Therefore, the most suitable alternative is Y c if Φ ( α c ) = max 1 i m { Φ ( α c ) } .
Step 7:
If the score values for multiple alternatives are equal, we must use Equation (2) to determine the accuracy function Ψ ( α c ) for those alternatives. Now,
If Φ ( α c ) provides the highest value for more than one alternative, the optimal alternative is the one with the highest Ψ —functional value.
If Ψ —functional values for multiple alternatives remain the same, then each of these can be selected to be a viable option.
The above steps are also exhibited in Figure 1.
The advantages of the developed methodology are given in the following.
  • In the proposed model, the decision-making information is provided in terms of q-ROFNs. This allows the decision-maker to express uncertain information in a broader space.
  • Generally, decision-makers assumed the attribute weights arbitrarily, leaving no room for uncertainty. However, in the proposed model, we utilize the entropy method for determining the weights of the attributes. Therefore, the proposed method is more flexible and reasonable.
  • In the proposed model, we utilize the Archimedean aggregation operators to aggregate information about each attribute. This makes the information aggregation process more flexible because Archimedean operators are generalized versions of several existing operators. As a result, the decision-maker can use any of the specific forms of Archimedean operators for data fusion based on their own preferences.

6. Numerical Illustration

We present a numerical problem about site selection for software operating units to demonstrate the proposed model.
Consider the case of a multinational company (MNC) that wishes to expand its global footprint. Assume the company needs to establish a software-operating unit in another country. Suppose they have offers from four countries worldwide, namely Y 1 , Y 2 , Y 3 , and Y 4 . So their problem is to select the best alternative country that will potentially increase their business profit while minimizing all costs.
They need not only an economically developed country but all the necessary facilities, and cooperation from the country is also crucial for them. In addition, they prioritize lowering labor and transportation costs.
So according to their priorities, the decision-making committee of the company has proposed the following attributes:
  • Distance from the core market ( 1 ): The company is already well-established, so they have their market globally. So, for better communication, the distance between the market and the operating place is desired to be minimized. For instance, if a company’s core market is in South Asia and its alternative countries for developing software operating units are Canada and Japan, the company will ideally prefer Japan because it is less distant from the company’s core market.
  • Regular cost ( 2 ): To build a software operating unit and run it effectively, the company has to estimate its regular cost of operating and maintenance, which varies from country to country hugely. So, the company will always prefer the country where the skilled and unskilled labor cost, instrument, and device cost, transportation cost, energy cost, etc., are minimized.
  • Facilities from the government of that country ( 3 ): Any MNC will need a large space, good electricity supply, and good transportation, and communication facilities which are expected to be provided by the local government. However, the availability of these opportunities from the government of the corresponding country will vary country-wise. For example, an economically weaker country will produce better opportunities to attract big companies for the following reasons:
    • to create job opportunities for its unemployed citizens;
    • to increase its gross national product;
    • to attract other investors for future industrial expansion;
    • to improve international impact from an economic perspective.
    So, the company must prefer the country which will provide more opportunities and cooperation from the government.
  • Availability of skilled and unskilled labor ( 4 ): The company requires a large amount of skilled and unskilled labor to run the software operating unit. As a result, the company will seek skilled and unskilled labor at the lowest possible cost. Otherwise, it must import the same from other countries, which is very expensive. As a result, the company must prefer a country with skilled engineers as well as unskilled laborers.
  • Future possibilities ( 5 ): The company always has a plan for future extension of their current market. So, the company must prefer to build up its software operating station in a country where it can expand its market in the future. Furthermore, the company may avoid a country where another company’s successful market for the same product as theirs already exists. In other words, the company will try to avoid unnecessary competition in the near future. So the company will choose a country with more future possibilities for their market expansion.
Now, due to the presence of many conflicting attributes, a lack of information, and an imprecise human mind, the assessment and selection of the site to develop software operating units is a complicated uncertain decision-making problem. The q-ROFSs provide an effective tool to deal with uncertainty in complex decision-making problems due to their broader space. Therefore, the managing committee gives their opinion in terms of q-ROFNs about each alternative. The ratings of the alternatives with respect to each attribute are presented in Table 7.
In the following, we utilize the proposed MADM model to solve the above numerical problem about site selection for software operating units.
At first, we apply the q-ROFAWA operator based method to select the most preferable country Y c ( c = 1 , 2 , 3 , 4 , 5 ) .
Step 1:
Input the q-ROF decision matrix.
Step 2:
Normalizing the q-ROF decision matrix using Equation (5) we obtain:
N = ( 0.8 , 0.5 ) ( 0.6 , 0.9 ) ( 0.7 , 0.21 ) ( 0.8 , 0.7 ) ( 0.66 , 0.7 ) ( 0.9 , 0.5 ) ( 0.8 , 0.2 ) ( 0.6 , 0.4 ) ( 0.66 , 0.9 ) ( 0.70 , 0.41 ) ( 0.5 , 0.5 ) ( 0.6 , 0.7 ) ( 0.8 , 0.8 ) ( 0.77 , 0.32 ) ( 0.2 , 0.7 ) ( 0.35 , 0.81 ) ( 0.6 , 0.6 ) ( 0.72 , 0.5 ) ( 0.79 , 0.31 ) ( 0.72 , 0.65 )
Step 3:
Utilizing Equation (6) we obtain the attribute weights for the five attributes as ( 0.192 , 0.205 , 0.192 , 0.222 , 0.189 ) .
Step 4:
Consider f ( t ) = l o g ( t ) and q = 4 in q-ROFAWA operator to compute overall performance values α c ( c = 1 , 2 , 3 , 4 ) of countries Y c using Equation (7). The aggregated values are given by: α 1 = ( 0.7323 , 0.5483 ) , α 2 = ( 0.7717 , 0.4356 ) , α 3 = ( 0.6786 , 0.5658 ) ,   and   α 4 = ( 0.6918 , 0.5381 ) .
Step 5:
The score values Φ ( α c ) ( c = 1 , 2 , 3 , 4 , 5 ) using Definition 2 are given by: Φ ( α 1 ) = 0.1972 , Φ ( α 2 ) = 0.3188 , Φ ( α 3 ) = 0.1097 ,   and   Φ ( α 4 ) = 0.1452 . Therefore, using the score values, we rank the four countries as Y 2 > Y 1 > Y 4 > Y 3 .
Step 6:
Therefore, the country Y 2 possesses the highest rank among those four countries. So, the country Y 2 is the most preferable country in which the MNC should build its new business branch.
Thereafter, we utilize q-ROFAWG operator to select the most preferable country Y c ( c = 1 , 2 , 3 , 4 , 5 ) .
Step 1:
Input the q-ROF decision matrix.
Step 2:
Obtain the normalized matrix N .
Step 3:
Utilizing Equation (6) the attribute weights are calculated as
( 0.192 , 0.205 , 0.192 , 0.222 , 0.189 ) .
Step 4:
Consider f ( t ) = l o g ( t ) and q = 4 in q-ROFAWG operator to compute overall performance values α c ( c = 1 , 2 , 3 , 4 ) of countries Y c using Equation (8). The aggregated values are given by: α 1 = ( 0.7088 , 0.7347 ) , α 2 = ( 0.7234 , 0.6917 ) , α 3 = ( 0.5257 , 0.6693 ) ,   and   α 4 = ( 0.6164 , 0.6435 ) .
Step 5:
The score values Φ ( α c ) ( c = 1 , 2 , 3 , 4 , 5 ) using Definition 2 are given by: Φ ( α 1 ) = −0.0389, Φ ( α 2 ) = 0.0449, Φ ( α 3 ) = −0.1243, and Φ ( α 4 ) = −0.0271. Therefore, using the score values, we rank the four countries as Y 2 > Y 4 > Y 1 > Y 3 .
Step 6:
Therefore, the country Y 2 possesses the highest rank among those four countries. So, the country Y 2 is the most preferable country in which the MNC should build its software operating unit.

7. Comparison Analysis

In order to establish the validity and efficacy of the proposed model, we compared the outcomes obtained from our proposed method with those of several existing methods.

7.1. Comparison with Aggregation Operator-Based Methods

The calculation procedure for the IFWA [38] and EIFWA [38] is not very complicated, but its application field is confined. It can only handle decision-making problems with information expressed as an intuitionistic fuzzy number (IFN). Since our proposed MADM problem includes an evaluation value beyond the IFN, IFWA and EIFWA operators are insufficient to handle it. Now PFWA [42] and PFEWA [42] operators can only be used when the evaluation information is elicited as a PyFN. However, in PyFN, the square sum of MD and NMD is restricted to 1. As a result, the PFWA and PFEWG operators cannot be used to solve the given MADM problem. Now q-ROFWA, q-ROFEWA, q-ROFFWA, and Yq-ROFWA operators are most suitable to deal with the proposed model as the parameter q makes the aggregation process more adaptable. The range of information can be extended by increasing the parameter q . As a result, we can say that our proposed model outperforms the models based on IFWA, EIFWA, PFWA, and PFEWG operators.
The appraisal score of every alternative is now computed using the q-ROFWA, q-ROFEWA, q-ROFFWA, and Yq-ROFWA operators. The alternatives are then ranked in descending order of score value. The ranking outcomes are shown in Figure 2 and Table 8. From Figure 2 and Table 8, we observe that for the q-ROFWA, q-ROFEWA, and q-ROFFWA AOs ranking order is always Y 2 > Y 1 > Y 4 > Y 3 and the optimal alternative is always Y 2 although, the appraisal score for each alternative is different. Again, using Yq-ROFWA operator we obtain the ranking order as Y 2 > Y 1 > Y 3 > Y 4 and the optimal alternative is Y 2 .
Now, we shall compare our result using q-ROFAWG using different additive generators f . The ranking results using different geometric aggregation operators are displayed in Figure 3 and Table 9.
From Table 9 and Figure 3, we see that the problem is not solvable by implementing IFWG, EIFWG, PFWG, and PFEWG AOs as they can only cope with IF information and Pythagorean fuzzy information. Again, utilizing q-ROFWG, q-ROFEWG, q-ROFFWG operators, we see that while the score values for the alternatives vary, their ranking order almost remains the same, and Y 2 is the best option. Again, using Yq-ROFWG operator, we obtain the ranking order as Y 4 > Y 3 > Y 1 > Y 2 and the optimal alternative is Y 4 . The proposed procedure is more productive than conventional procedures for its flexibility to elicit fuzzy data in a wider range. Moreover, the existing approaches under the q-ROF environment are a particular case of our proposed approach. Therefore, our suggested MADM method is more generalized and compatible with q-ROFNs.

7.2. Comparison with q-ROF TOPSIS Method

In the literature, Alkan and Kahraman [45] extended the TOPSIS method based on a distance measure under the q-ROF environment. We call this approach Alkan and Kahraman’s method. This method is an effective model for solving MADM problems. Here, we apply the remaining steps of Alkan and Kahraman’s method to the normalized matrix N mentioned in Section 6.
At first, we determine the q-ROF weighted aggregated matrix by using the entropy weights. Let P be the weighted aggregated matrix. Then
P = ( 0.557 , 0.875 ) ( 0.409 , 0.709 ) ( 0.476 , 0.741 ) ( 0.576 , 0.924 ) ( 0.444 , 0.935 ) ( 0.656 , 0.875 ) ( 0.566 , 0.719 ) ( 0.403 , 0.839 ) ( 0.462 , 0.977 ) ( 0.474 , 0.845 ) ( 0.333 , 0.875 ) ( 0.409 , 0.929 ) ( 0.557 , 0.958 ) ( 0.550 , 0.777 ) ( 0.132 , 0.935 ) ( 0.232 , 0.960 ) ( 0.409 , 0.901 ) ( 0.491 , 0.875 ) ( 0.568 , 0.771 ) ( 0.490 , 0.922 )
At first, we determine the q-ROF positive ideal solution (q-ROFPIS) and the IVSF negative ideal solution (q-ROFNIS). Let X * be the q-ROFPIS and X be the q-ROFNIS. So, X * = { ( 0.656 , 0.875 ) , ( 0.566 , 0.719 ) , ( 0.476 , 0.741 ) , ( 0.568 , 0.771 ) , ( 0.474 , 0.845 ) } and
X = { ( 0.232 , 0.960 ) , ( 0.409 , 0.979 ) , ( 0.557 , 0.958 ) , ( 0.462 , 0.977 ) , ( 0.132 , 0.935 ) } . Next, we compute the normalized Euclidean distance between the aggregated performance of alternative from the q-ROFPIS and q-ROFNIS which are denoted as D i + ( Y i , X * ) and D i ( Y i , X ) , respectively. The values of D i + ( Y i , X * ) and D i ( Y i , X * ) are exhibited in Table 10.
Finally, we calculate the relative closeness coefficient C C i ( Y i ) for each alternative Y i where C C i ( Y i ) = D i ( Y i , X ) D i ( Y i , X ) + D i + ( Y i , X * ) . The values of C R i ( Y i ) are displayed in Table 10. We exhibit the values of C C i ( Y i ) in Table 10.
According to Table 10, Y 2 Y 4 Y 1 Y 3 is the ranking order of the four available alternatives. Therefore, Y 2 is the best alternative obtained from Alkan and Kahraman’s method.
Therefore, the ranking of the alternatives using the proposed method and q-ROF TOPSIS method is almost the same. In both of the methods, the optimal alternative is always Y 2 . The only difference is the ranking between Y 1 and Y 4 . In the q-ROF TOPSIS method Y 4 Y 1 , where in the proposed method Y 1 Y 4 . Therefore, the proposed method is highly reliable.

7.3. Comparison with q-ROF MULTIMOORA Method

Here, we compare the results of the developed method with the existing full multiplicative form (FMF) approach, the reference point (RP) approach, and the ratio system (RS) approach for the MULTIMOORA method [46] under the q-ROF environment. For this, the same numerical example is solved with the existing q-ROF environment MULTIMOORA method [46].

7.3.1. Comparison with RS Approach for q-ROF MULTIMOORA Method

Here, we apply the remaining steps of the RP approach for the MULTIMOORA method to the normalized matrix N mentioned in Section 6.
Then, we calculate the relative significance ( Y i + ) for each alternative Y i using q-ROFEWA operator [36]. The values of Y i + are exhibited in Table 11.
Next, we defuzzify the Y i + based on the score function given in Equation (1). Finally, we rank the alternatives based on Φ ( Y i + ) values in descending order.
According to Table 11, we obtain the ranking outcome as Y 2 Y 1 Y 4 Y 3 Therefore, Y 2 is the best alternative obtained from the RS approach for the q-ROF-MULTIMOORA method.

7.3.2. Comparison with FMF Approach for q-ROF MULTIMOORA Method

Here, we apply the remaining steps of the FMF approach for the MULTIMOORA method to the normalized matrix N mentioned in Section 6.
We calculate the total utility of the alternatives ( Z i + ) for each alternative Y i using the q-ROFEWGA operator [36]. The values of Z i + are exhibited in Table 12.
Next, we defuzzify the Z i + based on the score function given in Equation (1). The score values of Z i + are exhibited in Table 12. Finally, we rank the alternatives based on Φ ( Z i + ) values in descending order.
According to Table 12, we obtain the ranking outcome as Y 2 Y 1 Y 4 Y 3 . Therefore, Y 2 is the best alternative obtained from the FMF approach for the IVSF-MULTIMOORA method.
From Table 11 and Table 12, we can observe that the ranking of the four alternatives is Y 2 Y 1 Y 4 Y 3 , which is identical with the ranking obtained from the proposed methods. Therefore, our proposed model is highly reliable.

7.4. Validity Test

The same decision-making problem can produce different results for different MADM approaches. To illustrate the efficacy of our MADM approach, we check whether it satisfies the requirements set forth by Wang and Triantaphyllou [47] as:
Criterion 1:
If any non-optimal alternatives are replaced with worse alternatives while maintaining the level of significance of each attribute, the MADM approach remains efficient and the optimal alternative remains the same.
Criterion 2:
The transitivity law must be followed by an efficient MADM method.
Criterion 3:
If a MADM problem is divided into sub-problems, the given MADM problem can be used to rank the alternatives to those sub-problems. The joint ranking of the alternative remains unchanged from the previous ranking order.
Now, we testify in the following if our proposed method satisfies these criteria or not.

Test with Criterion 1

Here, a worse alternative Y 3 is chosen arbitrarily and replaced by a new worse alternative Y 3 , where the q-ROF data for which the alternative Y 3 satisfies the attributes 1 , 2 , 3 , 4 , 5 are ( 0.30 , 0.79 ) , ( 0.55 , 0.49 ) , ( 0.78 , 0.60 ) , ( 0.70 , 0.40 ) and ( 0.29 , 0.75 ) , respectively. Depending on the modified information, the score values using the q-ROFEWA operator are obtained as Φ ( α 1 ) = 0.2412 , Φ ( α 2 ) = 0.2726 , Φ ( α 3 ) = 0.0086 , and Φ ( α 4 ) = 0.1302 . The optimal ranking order is Y 2 Y 1 Y 4 Y 3 . This gives that still, Y 2 is the optimal alternative. Again the score values using the q-ROFEWG operator are obtained as Φ ( α 1 ) = 0.0868 , Φ ( α 2 ) = 0.1049 , Φ ( α 3 ) = 0.1464 , and Φ ( α 4 ) = 0.0086 . Which tells that still Y 2 is the most suitable alternative. Hence, the proposed model meets this criterion. Similarly, if we implement other proposed operators, the proposed model meets this criterion.

7.5. Test with Other Criteria

If the MADM problem is divided into smaller sub-problems which consist of { Y 1 , Y 2 , Y 3 } , { Y 2 , Y 3 , Y 4 } , { Y 3 , Y 4 , Y 1 } and { Y 4 , Y 1 , Y 2 } alternatives. By solving each sub-problem with our suggested procedure, we acquire the alternatives’ ranking as Y 2 Y 1 Y 3 , Y 2 Y 3 Y 4 , Y 3 Y 4 Y 1 , and Y 4 Y 1 Y 2 , respectively. In this manner, by combining them, we obtain Y 2 Y 1 Y 4 Y 3 which is similar to the original one. As a result, our method also meets the second and third requirements.

8. Conclusions

The q-ROFSs are more flexible for expressing ambiguous information because of the presence of the parameter q . The Archimedean TCNs and TNs are generalizations of several TCNs and TNs. In this article, we have implemented the concepts of ATCN and ATN to develop AOs using q-ROF information. We have defined some novel operational rules for q-ROFNs utilizing ATCN and ATN. Thereafter, utilizing these operational laws, we propose q-ROFAWA, q-ROFAOWA, q-ROFAHA, q-ROFAWG, q-ROFAOWG, and q-ROFAHG operators. Afterward, the properties of these operators are thoroughly investigated. Next, we have shown that the AOs based on several existing TCNs and TNs (e.g., Frank, Hamacher, etc.) are particular cases of our proposed q-ROF AOs based on ATCN and ATN. Furthermore, we have presented a novel method to solve the MADM problem using the q-ROFAWA and q-ROFAWG operators. Finally, a numerical example of site selection of software operating units was used to show the feasibility, viability, and supremacy of the suggested approaches over other available methods.
There are some limitations to the current study. The primary limitation of this study is that the proposed model can only address the MADM issue. It can, however, be expanded to address MAGDM issues. Another shortcoming of this study is the computational complexity of the proposed model. However, this issue can be fixed by developing a computer program following the proposed approach, which will save decision-makers time and energy. Furthermore, the proposed MADM model is limited to the site selection problem. However, it is able to address other decision-making issues, e.g., sustainable development programs [48], plastic waste management process [49], job selection problems [5], bio-medical waste management [50], emergency assistance area selection [51], etc. Furthermore, the current study develops the Archimedean aggregation operators within the q-ROF context. However, the Archimedean aggregation operators can also be used in other fuzzy environments, e.g., the quasirung fuzzy environment [52,53], spherical fuzzy environment [54], etc.

Author Contributions

Conceptualization, M.R.S. and U.M.; methodology, M.R.S. and U.M.; software, M.R.S. and U.M.; validation, M.R.S. and U.M.; formal analysis, U.M.; investigation, M.R.S.; resources, M.R.S. and U.M.; data curation, M.R.S. and U.M.; writing—original draft preparation, M.R.S. and U.M.; writing—review and editing, M.R.S.; supervision, M.R.S. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Zadeh, L.A. Fuzzy sets. Inf. Control 1965, 8, 338–353. [Google Scholar] [CrossRef]
  2. Atanassov, K.T. Intuitionistic fuzzy sets. Fuzzy Sets Syst. 1986, 20, 87–96. [Google Scholar] [CrossRef]
  3. Jiang, W.; Wei, B. Intuitionistic fuzzy evidental power aggregation operator and its application in multiple criteria decision-making. Int. J. Syst. Sci. 2018, 49, 582–594. [Google Scholar] [CrossRef]
  4. Sirbiladze, G.; Sikharulidze, A. Extension of probability intuitionistic fuzzy aggregation operators in fuzzy MCDM/ MADM. Int. J. Inf. Technol. Decis. Mak. 2018, 17, 621–655. [Google Scholar] [CrossRef]
  5. Seikh, M.R.; Mandal, U. Intuitionistic fuzzy Dombi aggregation operators and their application to multiple attribute decision-making. Granul. Comput. 2021, 6, 473–488. [Google Scholar] [CrossRef]
  6. Senapati, T.; Simic, V.; Saha, A.; Dobrodolac, M.; Rong, Y.; Tirkolaee, E.B. Intuitionistic fuzzy power Aczel-Alsina model for prioritization of sustainable transportation sharing practices. Eng. Appl. Artif. Intell. 2023, 119, 105716. [Google Scholar] [CrossRef]
  7. Gohain, B.; Chutia, R.; Dutta, P. Distance measure on intuitionistic fuzzy sets and its application in decision-making, pattern recognition, and clustering problems. Int. J. Intell. Syst. 2022, 37, 2458–2501. [Google Scholar] [CrossRef]
  8. Ke, Y.; Tang, H.; Liu, M.; Qi, X. A hybrid decision-making framework for photovoltaic poverty alleviation project site selection under intuitionistic fuzzy environment. Energy Rep. 2022, 8, 8844–8856. [Google Scholar] [CrossRef]
  9. Wan, S.P.; Yi, Z.H. Power average of trapezoidal intuitionistic fuzzy numbers using strict t-Norms and t-Conorms. IEEE Trans. Fuzzy Syst. 2016, 24, 1035–1047. [Google Scholar] [CrossRef]
  10. Yager, R.R. Pythagorean membership grades in multicriteria decision making. IEEE Trans. Fuzzy Syst. 2014, 22, 958–965. [Google Scholar] [CrossRef]
  11. Akram, M.; Dudek, W.A. Pythagorean Dombi fuzzy aggregation operators with application in multicriteria decision-making. Int. J. Intell. Syst. 2019, 34, 3000–3019. [Google Scholar] [CrossRef]
  12. Shahzadi, G.; Akram, M.; Al-Kenani, A.N. Decision-making approach under Pythagorean fuzzy Yager weighted operators. Mathematics 2020, 8, 70. [Google Scholar] [CrossRef]
  13. Ayyildiz, E. A novel Pythagorean fuzzy multi-criteria decision-making methodology for e-scooter charging station location-selection. Transp. Res. Part D Transp. Environ. 2022, 111, 103459. [Google Scholar] [CrossRef]
  14. Ertemel, A.V.; Menekse, A.; Camgoz Akdag, H. Smartphone Addiction Assessment Using Pythagorean Fuzzy CRITIC-TOPSIS. Sustainability 2023, 15, 3955. [Google Scholar] [CrossRef]
  15. Giri, B.C.; Molla, M.U.; Biswas, P. Pythagorean fuzzy DEMATEL method for supplier selection in sustainable supply chain management. Expert Syst. Appl. 2022, 193, 116396. [Google Scholar] [CrossRef]
  16. Yager, R.R. Generalized orthopair fuzzy sets. IEEE Trans. Fuzzy Syst. 2017, 25, 1222–1230. [Google Scholar] [CrossRef]
  17. Mandal, U.; Seikh, M.R. A novel score function-based EDAS method for the selection of a vacant post of a company with q-rung orthopair fuzzy data. In Mathematics and Computer Science Volume 1; Ghosh, S., Deyasi, K., Malik, B.B., Das, S., Eds.; Scrivener-Wiley: New York, NY, USA, 2023; pp. 231–250. [Google Scholar]
  18. Peng, X.; Liu, L. Information measures for q-rung orthopair fuzzy sets. Int. J. Intell. Syst. 2019, 34, 1795–1834. [Google Scholar] [CrossRef]
  19. Wang, J.; Wei, G.; Wei, C.; Wei, Y. MABAC method for multiple attribute group decision making under q-rung orthopair fuzzy environment. Def. Technol. 2020, 16, 208–216. [Google Scholar] [CrossRef]
  20. Seikh, M.R.; Mandal, U. q-rung orthopair fuzzy Frank aggregation operators and its application in multiple attribute decision-making with unknown attribute weights. Granul. Comput. 2022, 7, 709–730. [Google Scholar] [CrossRef]
  21. Wang, J.; Zhang, R.; Zhu, X.; Zhou, Z.; Shang, X.; Li, W. Some q-rung orthopair fuzzy Muirhead means with their application to multi-attribute group decision making. J. Intell. Fuzzy Syst. 2019, 36, 1599–1614. [Google Scholar] [CrossRef]
  22. Wang, J.; Wei, G.; Lu, J.; Alasaadi, F.E.; Hayat, T.; Wei, C.; Zhang, Y. Some q-rung orthopair fuzzy hammy mean operators in multiple attribute decision-making and their application to enterprise resource planning system selection. Int. J. Intell. Syst. 2019, 34, 2429–2458. [Google Scholar] [CrossRef]
  23. Kausar, R.; Farid, H.M.A.; Riaz, M.; Gonul Bilgin, N. Innovative CODAS algorithm for q-rung orthopair fuzzy information and cancer risk assessment. Symmetry 2023, 15, 205. [Google Scholar] [CrossRef]
  24. Klir, G.; Yuan, B. Fuzzy Sets and Fuzzy Logic: Theory and Applications; Prentice Hall PTR: Upper Saddle River, NJ, USA, 1995. [Google Scholar]
  25. Nguyen, H.T.; Walker, E.A. A First Course in Fuzzy Logic; CRC Press: Boca Raton, FL, USA, 1997. [Google Scholar]
  26. Garg, H.; Rani, D. New generalised Bonferroni mean aggregation operators of complex intuitionistic fuzzy information based on Archimedean t-norm and t-conorm. J. Exp. Theor. Artif. Intell. 2020, 31, 81–109. [Google Scholar] [CrossRef]
  27. Liu, C.; Tang, G.; Guo, S. Archimedean t-norm and t-conorm for interval type-2 fuzzy sets. In Proceedings of the 2019 3rd International Conference on Cloud and Big Data Computing, Oxford, UK, 29 August 2019. [Google Scholar]
  28. Sarkar, A.; Biswas, A. Multicriteria decision-making using Archimedean aggregation operators in Pythagorean hesitant fuzzy environment. Int. J. Intell. Syst. 2019, 34, 1361–1386. [Google Scholar] [CrossRef]
  29. Zhang, N.; Yuan, Y.; Fu, D.; Wei, G. Dual hesitant fuzzy linguistic power-geometric operators based on Archimedean t-conorms and t-norms and their application to group decision making. J. Intell. Fuzzy Syst. 2019, 37, 3829–3847. [Google Scholar] [CrossRef]
  30. Peng, X. Hesitant trapezoidal fuzzy aggregation operators based on Archimedean t-norm and t-conorm and their application in MADM with completely unknown weight information. Int. J. Uncertain. Quantif. 2017, 7, 475–510. [Google Scholar] [CrossRef]
  31. Sarkar, A.; Biswas, A. Development of Archimedean t-norm and t-conorm-based interval-valued dual hesitant fuzzy aggregation operators with their application in multicriteria decision making. Eng. Rep. 2020, 2, 12106. [Google Scholar] [CrossRef]
  32. Khan, M.R.; Ullah, K.; Khan, Q. Multi-attribute decision-making using Archimedean aggregation operator in T-spherical fuzzy environment. Rep. Mech. Eng. 2023, 4, 18–38. [Google Scholar] [CrossRef]
  33. Tan, C.; Chen, X. Generalized Archimedean intuitionistic fuzzy averaging aggregation operators and their application to multicriteria decision-making. Int. J. Inf. Technol. Decis. Mak. 2016, 15, 311–352. [Google Scholar] [CrossRef]
  34. Liu, P.; Wang, P. Some q-rung orthopair fuzzy aggregation operators and their application to multiple-attribute decision making. Int. J. Intell. Syst. 2018, 33, 259–280. [Google Scholar] [CrossRef]
  35. Klement, E.P.; Mesiar, R. Logical, Algebraic, Analytic, and Probabilistic Aspects of Triangular Norms; Elsevier: New York, NY, USA, 2005. [Google Scholar]
  36. Darko, A.P.; Liang, D. Some q-rung orthopair fuzzy Hamacher aggregation operators and their application to multiple attribute group decision making with modified EDAS method. Eng. Appl. Artif. Intell. 2020, 87, 103259. [Google Scholar] [CrossRef]
  37. Xia, M.M.; Xu, Z.S.; Zhu, B. Some issues on intuitionistic fuzzy aggregation operators based on Archimedean t-conorm and t-norm. Knowl.-Based Syst. 2012, 31, 78–88. [Google Scholar] [CrossRef]
  38. Xu, Z.S. Intuitionistic fuzzy aggregation operations. IEEE Trans. Fuzzy Syst. 2007, 15, 1179–1187. [Google Scholar]
  39. Xu, Z.S.; Yager, R.R. Some geometric aggregation operators based on intuitionistic fuzzy sets. Int. J. Gen. Syst. 2006, 35, 417–433. [Google Scholar] [CrossRef]
  40. Wang, W.; Liu, X. Intuitionistic fuzzy information aggregation using Einstein operations. IEEE Trans. Fuzzy Syst. 2012, 20, 923–938. [Google Scholar] [CrossRef]
  41. Wang, W.; Liu, X. Intuitionistic fuzzy geometric aggregation operators based on Einstein operations. Int. J. Intell. Syst. 2011, 26, 1049–1075. [Google Scholar] [CrossRef]
  42. Zhang, X.L. A novel approach based on similarity measure for Pythagorean fuzzy multiple criteria group decision making. Int. J. Intell. Syst. 2016, 31, 593–611. [Google Scholar] [CrossRef]
  43. Garg, H. A new generalized Pythagorean fuzzy information aggregation using Einstien operations and its application to decision making. Int. J. Intell. Syst. 2016, 31, 886–920. [Google Scholar] [CrossRef]
  44. Garg, H. Generalized Pythagorean fuzzy geometric aggregation operators using Einstein t-norm and t-conorm for multicriteria decision-making process. Int. J. Intell. Syst. 2017, 32, 597–630. [Google Scholar] [CrossRef]
  45. Alkan, N.; Kahraman, C. Evaluation of government strategies against COVID-19 pandemic using q-rung orthopair fuzzy TOPSIS method. Appl. Soft Comput. 2021, 110, 107653. [Google Scholar] [CrossRef]
  46. Riaz, M.; Farid, H.M.A.; Shakeel, H.M.; Almalki, Y. Modernizing energy efficiency improvement with q-rung orthopair fuzzy MULTIMOORA approach. IEEE Access 2022, 10, 74931–74947. [Google Scholar] [CrossRef]
  47. Wang, W.; Triantaphyllou, E. Ranking irregularities when evaluating alternatives by using some ELECTRE methods. Omega 2008, 36, 45–63. [Google Scholar] [CrossRef]
  48. Mandal, U.; Seikh, M.R. Interval-valued Fermatean Fuzzy TOPSIS Method and Its Application to Sustainable Development Program. In Congress on Intelligent Systems; Saraswat, M., Sharma, H., Balachandran, K., Kim, J.H., Bansal, J.C., Eds.; Springer: Singapore, 2022; pp. 783–796. [Google Scholar]
  49. Mandal, U.; Seikh, M.R. Interval-valued spherical fuzzy MABAC method based on Dombi aggregation operators with unknown attribute weights to select plastic waste management process. Appl. Soft Comput. 2023, 145, 110516. [Google Scholar] [CrossRef]
  50. Seikh, M.R.; Mandal, U. Interval-valued Fermatean fuzzy Dombi aggregation operators and SWARA based PROMETHEE II method to bio-medical waste management. Expert Syst. Appl. 2023, 226, 120082. [Google Scholar] [CrossRef]
  51. Wan, S.P.; Cheng, W.B.H.; Dong, J.Y. Interactive multi-criteria group decision-making with probabilistic linguistic information for emergency assistance of COVID-19. Appl. Soft Comput. 2021, 107, 107383. [Google Scholar] [CrossRef] [PubMed]
  52. Seikh, M.R.; Mandal, U. Multiple attribute decision-making based on 3,4-quasirung fuzzy sets. Granul. Comput. 2022, 7, 965–978. [Google Scholar] [CrossRef]
  53. Seikh, M.R.; Mandal, U. Multiple attribute group decision making based on quasirung orthopair fuzzy sets: Application to electric vehicle charging station site selection problem. Eng. Appl. Artif. Intell. 2022, 115, 105299. [Google Scholar] [CrossRef]
  54. Ozceylan, E.; Ozkan, B.; Kabak, M.; Dagdeviren, M. A state-of-the-art survey on spherical fuzzy sets. J. Intell. Fuzzy Syst. 2022, 42, 195–212. [Google Scholar] [CrossRef]
Figure 1. Flowchart of the proposed method.
Figure 1. Flowchart of the proposed method.
Symmetry 15 01680 g001
Figure 2. Comparison with some weighted averaging operators.
Figure 2. Comparison with some weighted averaging operators.
Symmetry 15 01680 g002
Figure 3. Comparison with some weighted geometric operators.
Figure 3. Comparison with some weighted geometric operators.
Symmetry 15 01680 g003
Table 1. Several TCN and TN with their additive generators.
Table 1. Several TCN and TN with their additive generators.
Classft-Normst-Conorms
Algebraic l o g ( t ) h 1 h 2 h 1 + h 2 h 1 h 2
Einstein l o g ( 2 t t ) h 1 h 2 ( 1 h 1 ) ( 1 h 2 ) h 1 + h 2 1 + h 1 h 2
Hamacher ( ϑ > 0 ) l o g ( ϑ + ( 1 ϑ ) t t ) h 1 h 2 ϑ + ( 1 ϑ ) ( h 1 + h 2 h 1 h 2 ) h 1 + h 2 h 1 h 2 ( 1 ϑ ) h 1 h 2 1 ( 1 ϑ ) h 1 h 2
Frank ( β > 1 ) l o g β ( β 1 β t 1 ) l o g β ( 1 + ( β h 1 1 ) ( β h 2 1 ) β 1 ) l o g β ( 1 + ( β 1 h 1 1 ) ( β 1 h 2 1 ) β 1 )
Yager ( β > 0 ) ( 1 t ) β 1 ( ( 1 h 1 ) β + ( 1 h 2 ) β ) 1 β ( h 1 β + h 2 β ) 1 β
Table 2. Some particular forms of q -ROFAWA and q -ROFAWG operators for different f.
Table 2. Some particular forms of q -ROFAWA and q -ROFAWG operators for different f.
fClasses of t-Norm and t-ConormWeighted Averaging (WA)/
Weighted Geometric (WG)
q-ROF Aggregation OperatorAggregating Value of a Collection of q-ROFNs σ 1 , σ 2 , , σ u
l o g ( t ) Algebric ClassWAWeighted averaging operator (q-ROFWA) [34] 1 c = 1 u ( 1 μ σ c q ) δ c q , c = 1 u ν σ c δ c
WGWeighted geometric operator (q-ROFWG) [34] c = 1 u μ σ c δ c , 1 c = 1 u ( 1 ν σ c q ) δ c q
l o g 2 t t Einstein ClassWAEinstein weighted averaging operator (q-ROFEWA) [36] c = 1 u ( 1 + μ σ c q ) δ c c = 1 u ( 1 μ σ c q ) δ c c = 1 u ( 1 + μ σ c q ) δ c + c = 1 u ( 1 μ σ c q ) δ c q , 2 q c = 1 u ν σ c δ c c = 1 u ( 2 ν σ c q ) δ c + c = 1 u ( ν σ c q ) δ c q
WGEinstein weighted geometric operator (q-ROFEWG) [36] 2 q c = 1 u μ σ c δ c c = 1 u ( 2 μ σ c q ) δ c + c = 1 u ( μ σ c q ) δ c q , c = 1 u ( 1 + ν σ c q ) δ c c = 1 u ( 1 ν σ c q ) δ c c = 1 u ( 1 + ν σ c q ) δ c + c = 1 u ( 1 ν σ c q ) δ c q .
l o g ( ϑ + ( 1 ϑ ) t t ) Hamacher ClassWAHamacher weighted averaging operator (q-ROFHWG) [36] c = 1 u ( 1 + ( ϑ 1 ) μ σ c q ) δ c c = 1 u ( 1 μ σ c q ) δ c c = 1 u ( 1 + ( ϑ 1 ) μ σ c q ) δ c + ( ϑ 1 ) c = 1 u ( 1 μ σ c q ) δ c q , ϑ q c = 1 u ν σ c δ c c = 1 u [ 1 + ( ϑ 1 ) ( 1 ν σ c q ) ] δ c + ( ϑ 1 ) c = 1 u ( ν σ c q ) δ c q
WGHamacher weighted geometric operator (q-ROFHWG) [36] ϑ q c = 1 u μ σ c δ c c = 1 u [ 1 + ( ϑ 1 ) ( 1 μ σ c q ) ] δ c + ( ϑ 1 ) c = 1 u ( μ σ c q ) δ c q , c = 1 u ( 1 + ( ϑ 1 ) ν σ c q ) δ c c = 1 u ( 1 ν σ c q ) δ c c = 1 u ( 1 + ( ϑ 1 ) ν σ c q ) δ c + ( ϑ 1 ) c = 1 u ( 1 ν σ c q ) δ c q
l o g β 1 β t 1 Frank ClassWAFrank weighted averaging operator (q-ROFFWA) 1 log β 1 + c = 1 k ( β 1 μ σ c q 1 ) δ c q , log β 1 + c = 1 k ( β ν σ c q 1 ) δ c q
WGFrank weighted geometric operator (q-ROFFWG) log β 1 + c = 1 k ( β μ σ c q 1 ) δ c q , 1 log β 1 + c = 1 k ( β 1 ν σ c q 1 ) δ c q
( 1 t ) β , β > 0 Yager ClassWAYager weighted averaging operator (Yq-ROFWA) c = 1 u δ c ( μ σ c q ) β 1 β , 1 c = 1 u δ c ( 1 ν σ c q ) β 1 β
WGYager weighted geometric operator operator (Yq-ROFWG) 1 c = 1 u δ c ( 1 μ σ c q ) β 1 β , c = 1 u δ c ( ν σ c q ) β 1 β
Table 3. Some particular forms of q -ROFAOWA and q -ROFAOWG operators for different f.
Table 3. Some particular forms of q -ROFAOWA and q -ROFAOWG operators for different f.
fClasses of t-Conorm and t-NormOrder Weighted Averaging (OWA)/Order Weighted Geometric (OWG)q-ROF OWA/OWG Aggregation OperatorAggregating Value of a Collection of q-ROFNs σ 1 , σ 2 , , σ u
l o g ( t ) Algebric ClassOWAOrder weighted averaging operator [34] 1 c = 1 u ( 1 μ σ ϕ ( c ) q ) δ c q , c = 1 u ν σ ϕ ( c ) δ c
OWGOrder weighted geometric operator [34] c = 1 u μ σ ϕ ( c ) δ c , 1 c = 1 u ( 1 ν σ ϕ ( c ) q ) δ c q
l o g 2 t t Einstein ClassOWAEinstein OWA operator c = 1 u ( 1 + μ σ ϕ ( c ) q ) δ c c = 1 u ( 1 + μ σ ϕ ( c ) q ) δ c c = 1 u ( 1 + μ σ ϕ ( c ) q ) δ c + c = 1 u ( 1 + μ σ ϕ ( c ) q ) δ c q , 2 q c = 1 u ν σ ϕ ( c ) δ c c = 1 u ( 2 ν σ ϕ ( c ) q ) δ c + c = 1 u ( ν σ ϕ ( c ) q ) δ c q
OWGEinstein OWG operator 2 q c = 1 u μ σ ϕ ( c ) δ c c = 1 u ( 2 μ σ ϕ ( c ) q ) δ c + c = 1 u ( μ σ ϕ ( c ) q ) δ c q , c = 1 u ( 1 + ν σ ϕ ( c ) q ) δ c c = 1 u ( 1 + ν σ ϕ ( c ) q ) δ c c = 1 u ( 1 + ν σ ϕ ( c ) q ) δ c + c = 1 u ( 1 + ν σ ϕ ( c ) q ) δ c q
l o g ϑ + ( 1 ϑ ) t t Hamacher ClassOWAHamacher OWA operator c = 1 u ( 1 + ( ϑ 1 ) μ σ c q ) δ ϕ ( c ) c = 1 u ( 1 μ σ ϕ ( c ) q ) δ c c = 1 u ( 1 + ( ϑ 1 ) μ σ ϕ ( c ) q ) δ c + ( ϑ 1 ) c = 1 u ( 1 μ σ ϕ ( c ) q ) δ c q , ϑ q c = 1 u ν σ ϕ ( c ) δ c c = 1 u [ 1 + ( ϑ 1 ) ( 1 ν σ ϕ ( c ) q ) ] δ c + ( ϑ 1 ) c = 1 u ( ν σ ϕ ( c ) q ) δ c q
OWGHamacher OWG operator ϑ q c = 1 u μ σ ϕ ( c ) δ c c = 1 u [ 1 + ( ϑ 1 ) ( 1 μ σ ϕ ( c ) q ) ] δ c + ( ϑ 1 ) c = 1 u ( μ σ ϕ ( c ) q ) δ c q , c = 1 u ( 1 + ( ϑ 1 ) ν σ c q ) δ ϕ ( c ) c = 1 u ( 1 ν σ ϕ ( c ) q ) δ c c = 1 u ( 1 + ( ϑ 1 ) ν σ ϕ ( c ) q ) δ c + ( ϑ 1 ) c = 1 u ( 1 ν σ ϕ ( c ) q ) δ c q
l o g β 1 β t 1 Frank ClassOWAFrank OWA operator 1 log β 1 + c = 1 k ( β 1 μ σ ϕ ( c ) q 1 ) δ c q , log β 1 + c = 1 k ( β ν σ ϕ ( c ) q 1 ) δ c q
OWGFrank OWG operator log β 1 + c = 1 k ( β μ σ ϕ ( c ) q 1 ) δ c q , 1 log β 1 + c = 1 k ( β 1 ν σ ϕ ( c ) q 1 ) δ c q
( 1 t ) β , β > 0 Yager ClassOWAYager OWA operator c = 1 u δ c ( μ σ ϕ ( c ) q ) β 1 β , 1 c = 1 u δ c ( 1 ν σ ϕ ( c ) q ) β 1 β
OWGYager OWG operator 1 c = 1 u δ c ( 1 μ σ ϕ ( c ) q ) β 1 β , c = 1 u δ c ( ν σ ϕ ( c ) q ) β 1 β
Table 4. Some particular forms of q -ROFAOWA and q -ROFAOWG operators for different q.
Table 4. Some particular forms of q -ROFAOWA and q -ROFAOWG operators for different q.
Different Value of qOrder Weighted Averaging (OWA)/Order Weghted Geometric (OWG)Aggregation OperatorAggregating Value of a Collection of q-ROFNs σ 1 , σ 2 , , σ u
q = 1 OWAIntuitionistic fuzzy Archimedian ordered weighted averaging (IFAOWA) operator [33] g 1 c = 1 u δ c g ( μ σ ϕ ( c ) ) , f 1 c = 1 u δ c f ( ν σ ϕ ( c ) )
OWGIntuitionistic fuzzy Archimedian ordered weighted geometric (IFAOWG) operator [33] f 1 c = 1 u δ c f ( μ σ ϕ ( c ) ) , g 1 c = 1 u δ c g ( ν σ ϕ ( c ) )
q = 2 OWAPythagorean fuzzy Archimedian ordered weighted averaging (PFAOWA) operator [42] g 1 c = 1 u δ c g ( μ σ ϕ ( c ) 2 ) , f 1 c = 1 u δ c f ( ν σ ϕ ( c ) 2 )
OWGPythagorean fuzzy Archimedian ordered weighted geometric (PFAOWG) operator [42] f 1 c = 1 u δ c f ( μ σ ϕ ( c ) 2 ) , g 1 c = 1 u δ c g ( ν σ ϕ ( c ) 2 )
Table 5. Some particular forms of q -ROFHA and q -ROFHG operators for different q.
Table 5. Some particular forms of q -ROFHA and q -ROFHG operators for different q.
Different Value of qHybrid Averaging (HA)/Hybrid Geometric (HG)Aggregation OperatorAggregating Value of a Collection of q-ROFNs σ 1 , σ 2 , , σ u
q = 1 HAIntuitionistic fuzzy Archimedian hybrid averaging (IFAHA) operator [33] g 1 c = 1 u δ ¯ c g ( μ ˙ σ ϕ ( c ) ) , f 1 c = 1 u δ ¯ c f ( ν ˙ σ ϕ ( c ) )
HGintuitionistic fuzzy Archimedian hybrid geometric (IFAHG) operator [33] f 1 c = 1 u δ ¯ c f ( μ ˙ σ ϕ ( c ) ) , g 1 c = 1 u δ ¯ c g ( ν ˙ σ ϕ ( c ) )
q = 2 HAPythagorean fuzzy Archimedian hybrid averaging (PFAHA) operator [42] g 1 c = 1 u δ ¯ c g ( μ ˙ σ ϕ ( c ) 2 ) , f 1 c = 1 u δ ¯ c f ( ν ˙ σ ϕ ( c ) 2 )
HGPythagorean fuzzy Archimedian hybrid geometric (PFAHG) operator [42] f 1 c = 1 u δ ¯ c f ( μ ˙ σ ϕ ( c ) 2 ) , g 1 c = 1 u δ ¯ c g ( ν ˙ σ ϕ ( c ) 2 )
Table 6. Some particular forms of q -ROFAHA and q -ROFAHG operators for different f.
Table 6. Some particular forms of q -ROFAHA and q -ROFAHG operators for different f.
fClasses of t-Conorm and t-NormHybrid Averaging (HA)/Hybrid Geometric (HG)q-ROF HA/HG Aggregation OperatorAggregating Value of a Collection of q-ROFNs σ 1 , σ 2 , , σ u
l o g ( t ) Algebraic ClassHAHybrid averaging operator [34] 1 c = 1 u ( 1 μ ˙ σ ϕ ( c ) q ) δ ¯ c q , c = 1 u ν ˙ σ ϕ ( c ) δ ¯ c .
HGHybrid geometric operator [34] c = 1 u μ ˙ σ ϕ ( c ) δ ¯ c , 1 c = 1 u ( 1 ν ˙ σ ϕ ( c ) q ) δ ¯ c q .
l o g 2 t t Einstein ClassHAEinstein HA operator c = 1 u ( 1 + μ ˙ σ ϕ ( c ) q ) δ ¯ c c = 1 u ( 1 + μ ˙ σ ϕ ( c ) q ) δ ¯ c c = 1 u ( 1 + μ ˙ σ ϕ ( c ) q ) δ ¯ c + c = 1 u ( 1 + μ ˙ σ ϕ ( c ) q ) δ ¯ c q , 2 q c = 1 u ν ˙ σ ϕ ( c ) δ ¯ c c = 1 u ( 2 ν ˙ σ ϕ ( c ) q ) δ ¯ c + c = 1 u ( ν ˙ σ ϕ ( c ) q ) δ ¯ c q .
HGEinstein HG operator 2 q c = 1 u μ ˙ σ ϕ ( c ) δ ¯ c c = 1 u ( 2 μ ˙ σ ϕ ( c ) q ) δ ¯ c + c = 1 u ( μ ˙ σ ϕ ( c ) q ) δ ¯ c q , c = 1 u ( 1 + ν ˙ σ ϕ ( c ) q ) δ ¯ c c = 1 u ( 1 + ν ˙ σ ϕ ( c ) q ) δ ¯ c c = 1 u ( 1 + ν ˙ σ ϕ ( c ) q ) δ ¯ c + c = 1 u ( 1 + ν ˙ σ ϕ ( c ) q ) δ ¯ c q .
l o g ( ϑ + ( 1 ϑ ) t t ) Hamacher ClassHAHamacher HA operator c = 1 u ( 1 + ( ϑ 1 ) μ ˙ σ c q ) δ ¯ ϕ ( c ) c = 1 u ( 1 μ ˙ σ ϕ ( c ) q ) δ ¯ c c = 1 u ( 1 + ( ϑ 1 ) μ ˙ σ ϕ ( c ) q ) δ ¯ c + ( ϑ 1 ) c = 1 u ( 1 μ ˙ σ ϕ ( c ) q ) δ ¯ c q , ϑ q c = 1 u ν ˙ σ ϕ ( c ) δ ¯ c c = 1 u [ 1 + ( ϑ 1 ) ( 1 ν ˙ σ ϕ ( c ) q ) ] δ ¯ c + ( ϑ 1 ) c = 1 u ( ν ˙ σ ϕ ( c ) q ) δ ¯ c q
HGHamacher HG operator ϑ q c = 1 u μ ˙ σ ϕ ( c ) δ ¯ c c = 1 u [ 1 + ( ϑ 1 ) ( 1 μ ˙ σ ϕ ( c ) q ) ] δ ¯ c + ( ϑ 1 ) c = 1 u ( μ ˙ σ ϕ ( c ) q ) δ ¯ c q , c = 1 u ( 1 + ( ϑ 1 ) ν ˙ σ c q ) δ ¯ ϕ ( c ) c = 1 u ( 1 ν ˙ σ ϕ ( c ) q ) δ ¯ c c = 1 u ( 1 + ( ϑ 1 ) ν ˙ σ ϕ ( c ) q ) δ ¯ c + ( ϑ 1 ) c = 1 u ( 1 ν ˙ σ ϕ ( c ) q ) δ ¯ c q
l o g β 1 β t 1 Frank ClassHAFrank HA operator 1 log β 1 + c = 1 k ( β 1 μ ˙ σ ϕ ( c ) q 1 ) δ ¯ c q , log β 1 + c = 1 k ( β ν ˙ σ ϕ ( c ) q 1 ) δ ¯ c q
HGFrank HG operator log β 1 + c = 1 k ( β μ ˙ σ ϕ ( c ) q 1 ) δ ¯ c q , 1 log β 1 + c = 1 k ( β 1 ν ˙ σ ϕ ( c ) q 1 ) δ ¯ c q
( 1 t ) β , β > 0 Yager ClassHAYager HA operator c = 1 u δ ¯ c ( μ ˙ σ ϕ ( c ) q ) β 1 β , 1 c = 1 u δ ¯ c ( 1 ν ˙ σ ϕ ( c ) q ) β 1 β
HGYager HG operator 1 c = 1 u δ ¯ c ( 1 μ ˙ σ ϕ ( c ) q ) β 1 β , c = 1 u δ ¯ c ( ν ˙ σ ϕ ( c ) q ) β 1 β
Table 7. q-ROF decision matrix.
Table 7. q-ROF decision matrix.
1 2 3 4 5
Y 1 (0.80,0.50)(0.90,0.60)(0.70,0.21)(0.80,0.70)(0.70,0.66)
Y 2 (0.90,0.50)(0.20,0.80)(0.60,0.40)(0.66,0.90)(0.41,0.70)
Y 3 (0.50,0.50)(0.70,0.60)(0.80,0.80)(0.77,0.32)(0.70,0.20)
Y 4 (0.35,0.81)(0.60,0.60)(0.72,0.50)(0.79,0.31)(0.65,0.72)
Table 8. Alternative rankings using some weighted averaging operators ( q = 4 ).
Table 8. Alternative rankings using some weighted averaging operators ( q = 4 ).
AOsScore ValuesRanking OrderBest Option
IFWA [38]cannot be determinedNoNo
EIFWA [38]cannot be determinedNoNo
PFWA [42]cannot be determinedNoNo
PFEWA [43]cannot be determinedNoNo
q-ROFWA [34] Φ ( α 1 ) = 0.1972, Φ ( α 2 ) = 0.3188, Φ ( α 3 ) = 0.1097, Y 2 > Y 1 > Y 4 > Y 3 Y 2
Φ ( α 4 ) = 0.1452
q-ROFEWA Φ ( α 1 ) = 0.1834, Φ ( α 2 ) = 0.3009, Φ ( α 3 ) = 0.0939, Y 2 > Y 1 > Y 4 > Y 3 Y 2
Φ ( α 4 ) = 0.1347
q-ROFFWA Φ ( α 1 ) = 0.1858, Φ ( α 2 ) = 0.3057, Φ ( α 3 ) = 0.0986, Y 2 > Y 1 > Y 4 > Y 3 Y 2
[ β = 3 ] Φ ( α 4 ) = 0.1377
Yq-ROFWA Φ ( α 1 ) = 0.0138, Φ ( α 2 ) = 0.0538, Φ ( α 3 ) = 0.0102, Y 2 > Y 1 > Y 3 > Y 4 Y 2
[ β = 5 ] Φ ( α 4 ) = 0.0082
Table 9. Alternative rankings using some weighted geometric operators ( q = 4 ).
Table 9. Alternative rankings using some weighted geometric operators ( q = 4 ).
AOsScore ValuesRanking OrderBest Option
IFWG [39]cannot be determinedNoNo
EIFWG [41]cannot be determinedNoNo
PFWG [42]cannot be determinedNoNo
PFEWG [44]cannot be determinedNoNo
q-ROFWG [34] Φ ( α 1 ) = −0.0389, Φ ( α 2 ) = 0.0449, Φ ( α 3 ) = −0.1243, Y 2 > Y 4 > Y 1 > Y 3 Y 2
Φ ( α 4 ) = −0.0271
q-ROFEWG Φ ( α 1 ) = −0.0112, Φ ( α 2 ) = 0.0878, Φ ( α 3 ) = −0.1103, Y 2 > Y 1 > Y 4 > Y 3 Y 2
Φ ( α 4 ) = −0.0115
q-ROFFWG Φ ( α 1 ) = −0.0201, Φ ( α 2 ) = 0.0738, Φ ( α 3 ) = −0.1141, Y 2 > Y 4 > Y 1 > Y 3 Y 2
[ β = 3 ] Φ ( α 4 ) = −0.0157
Yq-ROFWG Φ ( α 1 ) = −0.0491, Φ ( α 2 ) = −0.0516, Φ ( α 3 ) = −0.0079, Y 4 > Y 3 > Y 1 > Y 2 Y 4
[ β = 5 ] Φ ( α 4 ) = −0.0083
Table 10. Outcomes of Alkan and Kahraman’s method.
Table 10. Outcomes of Alkan and Kahraman’s method.
Alternatives D i + ( Υ i , X * ) D i ( Υ i , X * ) CC i ( Υ i ) Ranking
Y 1 0.4340.3330.4343
Y 2 0.2390.5020.6771
Y 3 0.4660.3110.4004
Y 4 0.3840.3630.4852
Table 11. Outcomes of RS approach for q-ROF-MULTIMOORA method.
Table 11. Outcomes of RS approach for q-ROF-MULTIMOORA method.
Alternatives Y i + Φ ( Y i + ) Ranking
Y 1 ( 0.7289 , 0.5607 ) 0.18342
Y 2 ( 0.7635 , 0.4444 ) 0.30091
Y 3 ( 0.6698 , 0.5724 ) 0.09394
Y 4 ( 0.6864 , 0.5435 ) 0.13473
Table 12. Outcomes of FMF approach for the q-ROF-MULTIMOORA method.
Table 12. Outcomes of FMF approach for the q-ROF-MULTIMOORA method.
Alternatives Y i + Φ ( Y i + ) Ranking
Y 1 ( 0.7114 , 0.7191 ) −0.01122
Y 2 ( 0.7289 , 0.6641 ) 0.08781
Y 3 ( 0.5344 , 0.6619 ) −0.11034
Y 4 ( 0.6226 , 0.6342 ) −0.01153
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Seikh, M.R.; Mandal, U. q-Rung Orthopair Fuzzy Archimedean Aggregation Operators: Application in the Site Selection for Software Operating Units. Symmetry 2023, 15, 1680. https://doi.org/10.3390/sym15091680

AMA Style

Seikh MR, Mandal U. q-Rung Orthopair Fuzzy Archimedean Aggregation Operators: Application in the Site Selection for Software Operating Units. Symmetry. 2023; 15(9):1680. https://doi.org/10.3390/sym15091680

Chicago/Turabian Style

Seikh, Mijanur Rahaman, and Utpal Mandal. 2023. "q-Rung Orthopair Fuzzy Archimedean Aggregation Operators: Application in the Site Selection for Software Operating Units" Symmetry 15, no. 9: 1680. https://doi.org/10.3390/sym15091680

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop