A new approach to sustainable logistic processes with q-rung orthopair fuzzy soft information aggregation

View article
PeerJ Computer Science

Introduction

Sustainable logistics processes are becoming increasingly important in today’s world. The transportation of goods and materials is one of the largest contributors to global greenhouse gas emissions, which are a major cause of climate change. In addition, the logistics sector has a significant impact on the environment through its use of energy and natural resources. The importance of sustainable logistics processes lies in their ability to reduce the environmental impact of transportation and logistics activities. Sustainable logistics can help to reduce greenhouse gas emissions by using more fuel-efficient vehicles, optimizing transportation routes, and reducing the distance traveled. It can also help to reduce the consumption of natural resources and minimize waste through recycling and waste reduction initiatives. Sustainable logistics also has economic benefits. By improving the efficiency of transportation and logistics, companies can reduce their operating costs and improve their bottom line. They can also improve their reputation and brand image by demonstrating their commitment to sustainability. The scope of sustainable logistics is broad and encompasses a wide range of activities. It includes the planning and management of transportation and logistics operations, as well as the design and development of transportation infrastructure. It also includes the use of sustainable fuels and technologies, such as electric and hybrid vehicles, as well as the optimization of transportation networks to minimize environmental impact. In order to implement sustainable logistics processes, companies need to adopt a holistic approach that takes into account the entire supply chain. This involves collaboration with suppliers and customers to optimize transportation routes, reduce waste, and improve efficiency. It also requires the use of data analytics and technology to track and monitor transportation and logistics activities and identify opportunities for improvement. Sustainable logistics processes are essential for reducing the environmental impact of transportation and logistics activities, improving economic performance, and demonstrating a commitment to sustainability. By adopting a holistic approach and collaborating with suppliers and customers, companies can achieve these benefits while also reducing their carbon footprint and contributing to a more sustainable future. Multi-attribute decision-making (MADM) is an important tool for sustainable logistics processes. In sustainable logistics, decisions need to be made considering various attributes such as cost, environmental impact, social responsibility, and operational efficiency. MADM can help decision-makers to evaluate and compare different alternatives based on multiple criteria, and select the most suitable option that meets the objectives of sustainable logistics. One of the key advantages of MADM is that it allows decision-makers to consider multiple attributes simultaneously, rather than just focusing on one or two. This helps to ensure that decisions are based on a comprehensive and balanced analysis of all relevant factors. For example, when evaluating transportation alternatives, MADM can help to balance the trade-off between cost and environmental impact, by considering factors such as fuel efficiency, emissions, and distance traveled. MADM also provides a structured and transparent decision-making process. This is particularly important for sustainable logistics, where decisions need to be made with the involvement of multiple stakeholders, including customers, suppliers, and regulators. MADM can help to ensure that all relevant stakeholders are involved in the decision-making process and that decisions are made transparently and objectively. Furthermore, MADM can help decision-makers to prioritize their sustainability goals. Sustainable logistics involves balancing different objectives, such as reducing costs, improving efficiency, and minimizing environmental impact. MADM can help to rank these objectives and determine which ones are most important, based on the specific context and goals of the logistics operation. Finally, MADM can help decision-makers to identify and evaluate trade-offs between different attributes. Sustainable logistics often involves making trade-offs between different goals, such as reducing emissions and increasing operational efficiency. MADM can help decision-makers to identify the tradeoffs between these different attributes, and evaluate the impact of different alternatives on each attribute. MADM is an important tool for sustainable logistics processes. It allows decision-makers to consider multiple attributes simultaneously, provides a structured and transparent decision-making process, helps to prioritize sustainability goals, and enables decision-makers to identify and evaluate trade-offs between different attributes. By using MADM, sustainable logistics can be achieved while also improving economic performance and demonstrating a commitment to sustainability.

Main endowments and objectives

The main endowments and the goals of this article are given below:

  • To establish the prioritized weighted averaging operators and prioritized weighted geometric operators under q-ROFS context, which deals with the prioritization connection in the information. Consequently, to handle such information, q-ROFSPWA and q-ROFSPWG operators are effectively presented.

  • To present definite some basic properties of the proposed operators. Some fundamental properties including, comprising, monotonicity and boundedness are presented and examined with suitable development.

  • Based on the q-ROFSPWA operator and q-ROFSPWG operator, a MADM algorithm is established to resolve some decision-making numerical problems.

  • A fully developed numerical example is provided to validate the significance of the proposed operators.

  • The importance of the proposed technique is emphasized through a comparison with existing approaches.

  • The q-ROFSS is more suitable for examining decision-making problems than SS and q-ROFS.

  • The evaluation of the finest alternative is a very complicated MADM problem in a q-ROFS and SS environment and has many indefinite components. In the existing MADM methods, evaluation data is simply illustrated by SS and q-ROFNs which may inspire data distortion. As a result, a more extensive model is required to elucidate the existence of universal components.

  • The q-ROFSPWA and q-ROFSPWG operators when apply to different MADM difficulties based on the q-ROFS environment, increase the accuracy of the decision results.

  • The q-ROFSPWA and q-ROFSPWG operators are very straightforward and brief method for the assessment of a single choice.

  • Proposed operators address the shortcomings and constraints of existing operators by being more general and performing well with data other than q-ROFS.

The following are the main features of this article:

  • The theory of q-ROF aggregation operators is expanded to q-ROFS operators, with some basic results associated with them.

  • A method for dealing with difficult problems using q-ROFS data is provided. The MADM problem helps the proposed algorithm.

  • Various parameter choices and their effects on decision-making outcomes are reviewed.

  • The comparative analysis demonstrates the efficacy of these operators.

The structure of this article is given as: In “Literature Review” some literature review has given and in “Fundamental Notions” some basic ideas including q-ROFS, some basic operations, score function and accuracy function of q-ROFNs and q-ROFSS are presented which are useful to understand the proposed operators. “q-ROFS Prioritized Weighted Aggregation Operators” presents the prioritized operators like the q-ROFSPWA operator and q-ROFSPWG operator, and also presents some beneficial characteristics of proposed operators. In “Proposed MADM Approach”, an algorithm of the proposed work is provided. “Case Study” involves a numerical example and authenticity, sensitivity, and symmetrical analysis. Eventually, the conclusion is provided in “Conclusion”.

Literature review

An essential challenge in the MADM process is expressing approximate values of attributes more efficiently and precisely. The precise parameterized values of attributes are useful to address several complexities in MADM challenges. The decision experts estimate the advantages, characteristics and limitations of universal elements, goods, and alternatives. MADM is a predesign procedure for the selection of the best option among multiple choices. To handle these challenges, Zadeh (1965) presented a conspicuous idea, namely fuzzy set (FS) which made the best gyration in various fields. In an FS, membership values (MVs) between 0 and 1 are assigned to each alternative. Nevertheless, in some real-life problems decision experts gives their evaluations in terms of MV and negative membership value (NMV). Accordingly, Atanassov (1986) established the generalization of FS, namely “intuitionistic fuzzy set” (IFS) which contained MV and NMV functions that expressed satisfactory and unsatisfactory levels, respectively. As a result, it is a particularly useful tool for expressing complicated fuzzy data. Xu (2007), Xu & Yager (2006), Xu & Xia (2011) presented induced generalized, weighted averaging and weighted geometric operators based on intuitionistic fuzzy numbers (IFNs). Yager (2013) presented a “Pythagorean fuzzy set” (PFS) with a positive membership value (PMV) and negative membership value (NMV) that fulfilled the criteria that the square of the sum of its PMV and NMV is less than or equal to one. Based on the of extenuating TOPSIS technique (Hadi-Vencheh & Mirjaberi, 2014), Zhang (2016) designed a TOPSIS technique for MADM problems, containing PFS information. Simultaneously, Peng and Yang presented PFS sets (PFSSs) (Peng et al., 2015) and Pythagorean fuzzy linguistic sets (PFLSs) (Peng & Yang, 2016), respectively, inspirited by SS theory (Molodtsov, 1999) and linguistic set (LS) theory (Zadeh, 1975a, 1975b, 1975c). Gou, Xu & Ren (2016) established different Pythagorean fuzzy functions and thoroughly explored their important features such as differentiability, continuity and drivability. Peng & Yang (2015) introduced division and subtraction operations, as well as the Pythagorean fuzzy inferiority and superiority ranking system for solving MADM problems with PFNs. Following that, Beliakov & James (2014) studied on how to interpret the word “averaging” in the context of PFNs.

Despite this, Yager (2016) first developed the q-ROFSs to epitomize the decision information, in which the aggregate sum of the qth power of PMV and NMV is below or equal to 1, 0μq+νq1,(q1). It should be noted that as ‘q’ raises, so does the space of admissible orthopairs, and more orthopairs meet the boundary restriction. Using q-ROFSs, we may represent a broader space of fuzzy data. In other words, we may keep changing the ‘q’ value to define the data representation range, making q-ROFS more flexible and appropriate for uncertainty. Liu & Wang (2018), Wei, Gao & Wei (2018) and Liu & Liu (2018), Liu, Chen & Wang (2018), Liu, Chen & Wang (2018) proposed some novel q-ROF AOs for aggregating the q-ROF information. Based on some score functions, Peng, Dai & Garg (2018) introduced new AOs and exponential operations for q-ROFS and used them for teaching system selection. Du (2018) proposed some Minkowski type distance measures for q-ROFSs like, Chebyshev, Eucledian and Hamming distances as well as analyzed their implications in MADM challenges. Liu, Liu & Liang (2018) introduced a new MADM technique for contending with diverse connection in parameters and uncertain weight information of attributes in a q-ROF context. In a q-ROF framework, Yager, Alajlan & Bazi (2018) studied the ideas of certainty, feasibility as well as belief and plausibility. Pinar & Boran (2020) evaluated and explored another distance measure for q-ROF values in detail. Using the proposed distance measure, they examined the supplier selection problem using the TOPSIS and ELECTRE techniques individually. Based on Dombi and Archimedean operations, Saha, Dutta & Kar (2021) developed some novel hesitant fuzzy weighted aggregation operations and their applications. Based on Aczel-Alsina operations, Senapati et al. (2022) developed interval-valued intutionistic fuzzy AOs. Mahmood et al. (2019) established a novel technique, based on spherical fuzzy sets. Jana, Muhiuddin & Pal (2019) provided some Dombi aggregation operators for q-ROFNs and their different applications in MADM.

Yang et al. (2021) explored the numerous heterogeneous relationships between membership functions and criteria. The real world is just too complicated for our direct comprehension. We develop models that are simplified versions of real situations. However, these mathematical models are too complex to find accurate solutions. The ambiguity of data when modelling challenges in physics, engineering, computer science, social sciences, economics, medical science ad many other domains finds traditional methodologies ineffective. These can be related to the uncertainties of natural environmental phenomena, human awareness of the real world, or the constraints of the measurement tools applied. For example, ambiguity or uncertainty in the boundary between urban and rural regions or between states, or making judgments in a machine-based environment utilizing database information, or the precise population growth in a country’s rural area. The above-mentioned theories can be regarded as tools for coping with uncertainty, but each of these ideas has its own set of difficulties. The reason for these challenges may be the insufficiency of the parameterized description of elements, as highlighted by Molodtsov (1999). He developed the notion of SS theory as a new mathematical tool to handle. Maji, Roy & Biswas (2002) demonstrated the first practical use of SS in decision-making situations. It is based on the rough set theory of knowledge reduction. In 2003, Maji, Biswas & Roy (2003) established and explored many fundamental concepts of SS theory. Chen et al. (2005) and Pei & Miao (2005) amended the work of Maji, Roy & Biswas (2002), Maji, Biswas & Roy (2003). Maji, Biswas & Roy (2001a) introduced a fuzzy soft set (FSS), a hybrid of soft set and fuzzy set, that had various applications. Maji, Biswas & Roy (2001b) developed an extension of FSS named as intuitionistic FSS (IFSS). Hamid, Riaz & Afzal (2020) developed a q-ROF soft set (q-ROFSS). By utilizing averaging operators, Hussain et al. (2020) developed MADM approaches on q-ROFSS. The concept of score functions associated with generalized orthopair fuzzy membership grades, along with their practical applications, was suggested by Feng et al. (2022). Sitara, Akram & Riaz (2021) developed graph structures of q-ROFSs and a decision-making approach utilizing these structures.

q-ROFSs have been used for personal mobility in the metaverse with driverless cars, socially responsible rehabilitation of mining sites, and floating offshore wind farm site selection in Norway (Deveci et al., 2022; Deveci, Gokasar & Brito-Parada, 2022; Deveci et al., 2022). Farid & Riaz (2022), Riaz et al. (2020) proposed some AOs with applications to green supplier selection and Liu & Wang (2018) introduced interval-valued intuitionistic fuzzy Schweizer–Sklar power AOs with supplier selection applications. Liu et al. (2022) used the techniques of the operational science for green supplier selection with cross-entropy and Archimedean AOs. Zulqarnain et al. (2021) introduced some AOs for Pythagorean fuzzy soft sets with their application to green supplier chain management. Zhang, Wei & Chen (2021) and Qiyas & Abdullah (2022) gave some brilliant decision-making method for supplier selection. Wei et al. (2022), Pinar, Babak Daneshvar & Özdemir (2021) and Krishankumar et al. (2021) proposed AOs for different extensions of fuzzy sets and their applications towards vendor selection. Some extensive work related to MADM can be seen in Wan, Jiuying & Deyan (2015), Dong & Wan (2016), Puška et al. (2023), Rahman et al. (2023), Riaz & Farid (2023), Kausar, Riaz & Farid (2023). Finally, some existing AOs related to different extensions of FSs are given in Table 1.

Table 1:
Some existing aggregation operators.
Authors Aggregation operators
Wei, Gao & Wei (2018) q-ROF Heronian mean aggregation operators
Senapati et al. (2022) Interval-valued intutionistic fuzzy Aczel-Alsina AOs
Wang & Li (2020) Pythagorean fuzzy interaction power Bonferroni mean AOs
Wei (2017) Pythagorean fuzzy interaction weighted AOs
Jana, Muhiuddin & Pal (2019) q-ROF Dombi aggregation operators
Farid & Riaz (2021) q-ROF Einstein interactive geometric AOs
Riaz et al. (2021) q-ROF interactive AOs
Garg (2016) Intuitionistic fuzzy Hamacher interactive weighting AOs
Garg & Arora (2018) Prioritized intuitionistic fuzzy soft interactive AOs

According to the preceding analysis, the majority of existing q-ROFS aggregate relies on the algebraic product and algebraic sum of q-ROFSSs to carry out the aggregation process, which does not consider the interdependence among the multi factors. It is necessary to construct some underlying operators that can handle MADM problems in various situations of information combinations. Furthermore, the extension of q-ROFSs is the generalized version for dealing with any embeddings. In this regard, there is a considerable opportunity to exercise a different perspective of prioritized aggregation operators since the q-ROFSSs deliver ambiguous information in more productive ways.

Fundamental notions

Some basic notions of q-ROFS, “score function” (SF), “accuracy functions” (AF) and some laws of q-ROFNs are presented in this section.

Definition 3.1 Yager (2013): A q-ROFS O in 2 is determined as

O={,μO(),νO():2}where q1. μO(),νO() represents the MV and NMV of the universal elements 2, we have

0μOq()+νOq()1.

Moreover, πO()=(1μOq()νOq())1/q is said to be the degree of indeterminacy to O.

The following operational laws are presented by Liu & Wang (2018) for q-ROFN information.

Definition 3.2 Liu & Wang (2018): Let N1=μ1,ν1 and N2=μ2,ν2 be q-ROFNs. Then

(1) N¯1=ν1,μ1

(2) N1N2=max{μ1,ν1},min{μ2,ν2}

(3) N1N2=min{μ1,ν1},max{μ2,ν2}

(4) N1N2=(μ1q+μ2qμ1qμ2q)1/q,ν1ν2

(5) N1N2=μ1μ2,(ν1q+ν2qν1qν2q)1/q

(6) σN1=(1(1μ1q)σ)1/q,ν1σ

(7) N1σ=μ1σ,(1(1ν1q)σ)1/q

Definition 3.3 Liu & Wang (2018): Consider ~=μ,ν is a q-ROFN, the SF (L) of ð~ is represented as,

S(Ω~)=μqνq

S(Ω~)[1,1]. The SF of a q-ROFNs determines its classification. However, SF is not useful in a number of cases involving q-ROFNs.

Definition 3.4 Liu & Wang (2018): Suppose ð~=μ,ν is a q-ROFN, the AF A of ð~ is determined as

A(Ω~)=μq+νq

A(Ω~)[0,1]. The high preference of Ω~ is determined by the high accuracy degree A(Ω~).

Definition 3.5 Liu & Wang (2018): Suppose that Nk=μk,νk be a agglomeration of q-ROFNs, and q-ROFWA :ΛnΛ, if

qROFWA(N1,N2,Nn)=k=1nγkNk=γ1N1γ2N2,γnNn

Λn is a agglomeration of all q-ROFNs, and γ=(γ1,γ2,,γn)T is weight vector (WV) of (N1,N2,,Nn), with 0γk and k=1nγk=1.

Theorem 3.6 Liu & Wang (2018): Let Nk=μk,νk be a q-ROFNs agglomeration and qROFWA operator can also be determined as,

q​​-​​ROFWA(N1,N2,Nn)=((1˜k=1n(1-μkq)γk),˜k=1nνkγk)

Definition 3.7 Liu & Wang (2018): Suppose that Nk=μk,νk be a agglomeration of q-ROFNs, and q-ROFWG: ΛnΛ, if

qROFWG(N1,N2,Nn)=k=1nNkγk=N1γ1N2γ2,Nnγn

γ=(γ1,γ2,,γn)T is a WV of (N1,N2,,Nn), such that 0γk1, k=1nγk=1 and Λn be a agglomeration of all qROFNs.

Theorem 3.8 Liu & Wang (2018): Let Nk=μk,νk is a agglomeration of q-ROFNs and q-ROFWG operator can be determined as,

q​​-​​ROFWG(N1,N2,Nn)=(˜k=1nμkγk,(1-˜k=1n(1-νkq)γk)q)

q-Rung orthopair fuzzy soft set

Definition 3.9 Hamid, Riaz & Afzal (2020): Let U be a finite set of elements, E be a agglomeration of parameters, HE and qROFU demonstrates the agglomeration of all subsets of q-ROFSS over U. A q-ROFSS is represented as (Ω,H) or ΩH, where Ω:Hq- ROFU is a function, given as

ΩH={(ð,{~,μΩH(~),νΩH(~)}):ðH,~U}={(ð,{~(μΩH(~),νΩH(~))}):ðH,~U}={(ð,{(μΩH(~),νΩH(~))~}):ðH,~U}where μΩH:U[0,1], νΩH:U[0,1] be two functions, including the feature

0μΩHq(~)+νΩHq(~)1(q1)

Here, μΩH(~) and νΩH(~) demonstrates the PMV and NMV of the element ~U. If ϖ¨i=μΩH(ð)(~i) and ð^i=νΩH(ð)(~i), then q-ROFSS ΩH can be seen in Table 2.

ðH ˜1 ˜2 ˜n
ð1 ϖ¨11,Ω^11 ϖ¨12,Ω^12 ϖ¨1n,Ω^1n
ð2 ϖ¨21,Ω^21 ϖ¨22,Ω^22 ϖ¨2n,Ω^2n
ðm ϖ¨m1,Ω^m1 ϖ¨m2,Ω^m2 ϖ¨mn,Ω^mn

and in matrix form as

ΩH=[(ϖ¨i,Ω^i)]m×n   =( ϖ¨11,Ω^11 ϖ¨12,Ω^12 ϖ¨1n,Ω^1n ϖ¨21,Ω^21 ϖ¨22,Ω^22 ϖ¨2n,Ω^2n ϖ¨m1,Ω^m1 ϖ¨m2,Ω^m2 ϖ¨mn,Ω^mn )

Table 2:
3-ROFSS (ΩH).
ΩH ~1 ~2 ~3 ~4 ~5 ~6
T1 (0.80,0.40) (0.70,0.30) (0.50,0.20) (0.90,0.60) (0.90,0.50) (0.90,0.50)
T2 (0.70,0.10) (0.40,0.10) (0.60,0.50) (0.70,0.40) (0.50,0.50) (0.90,0.50)
T3 (0.80,0.10) (0.60,0.20) (0.40,0.30) (0.80,0.50) (0.90,0.70) (0.90,0.50)
T4 (0.60,0.30) (0.70,0.50) (0.60,0.40) (0.60,0.30) (0.80,0.20) (0.90,0.50)
T5 (0.70,0.50) (0.70,0.30) (0.60,0.30) (0.60,0.40) (0.70,0.90) (0.90,0.50)

Definition 3.10 Hussain et al. (2020): Let Nð1j=μ1j,ν1j(=1,2) and N=μ,ν be any three q-ROFSNs. Then

(1) N¯=ν,μ

(2) Nð11Nð12=max{μ11,μ12},min{ν11,ν12}

(3) Nð11Nð12=min{μ11,μ12},max{ν11,ν12}

(4) Nð11Nð12=(μð11q+μð12qμð11qμ12q)1/q,ν11ν12

(5) Nð11Nð12=μð11μð12,(νð11q+νð12qνð11qνð12q)1/q

(6) σN=(1(1μq)σ)1/q,νσ

(7) Nσ=μ1σ,(1(1ν1q)σ)1/q

Example 3.11 Consider ¥ ={~1,~2,~3,~4,~5,~6} be the set of hostels and Λ={T1,T2,T3,T4,T5} be the set of attributes where

T1 parameter is for affordable,

T2 parameter is for clean,

T3 parameter is for good food,

T4 parameter is for capacious.

T5 parameter is for good location.

On the premise of the aforementioned criterion a decision expert weighed the options and documented their results in the form of q-ROFSNs as given in Table 2.

Q-rofs prioritized weighted aggregation operators

The q-ROFS prioritized weighted averaging (q-ROFSPWA) operator and q-ROFS prioritized weighted geometric (q-ROFSPWG) operator are introduced in this section. The efficacious characteristics of the prospective operators are then given.

q-ROFSPWA operator

Definition 4.1 Assume that Nði=μi,νi, where (=1,2,...,mandi=1,2,...,n) is an agglomeration of q-ROFSNs, γ={γ1,γ2,γn} and =1n={1=1n,2=1n,,n=1n} are WVs for the parameters ð and decision makers Di respectively with the conditions that i=1nγi=1 and =1m=1n=1. Then the mapping for qROFSPWA:ΩnΩ, be n-dimension mapping.

q​​​​ROFSPWA(Nð11,Nðnm)=k=1mγk(1=1nNð112=1nNð12,n=1nNðnm)

The q-ROFSPWA operator can also be considered by the theorem, as given below.

Theorem 4.2 Assume that Ni=μi,νi be a agglomeration of q-ROFSNs, we can find qROFSPWA operator by,

qROFSPWA(Nð11,Nðnm)=(1~=1m(~i=1n(1μiq)=1n)γq,˜=1n(˜=1nνi=1n)γ)

As we know through operation laws, mathematical induction can be used to establish a specific result, that Nð11Nð12=((μ11)q+(μ12)q(μ11)q(μ12)qq,ν11ν12) and λN=(1[1μq]q,νλ) for λ1 We’ll start by showing that Eq. (1) is satisfied for n = 2 and m = 2, so we have

qROFSPWA(Nð11,Nð12)==12γ(i=12=1nNði)=γ1(i=12ii=1niNði1)γ2(i=12ii=1niNði2)=γ1(1i=1niNð112i=1niNð21)γ2(2i=1niNð122i=1niNð22)=γ1{(1(1μ11q)=1nq,ν11=1n)(1(1μ21q)=1nq,ν21=1n)}γ2{(1(1μ12q)=1nq,ν12=1n)(1(1μ22q)=1nq,ν22=1n)}=γ1(1~i=12(1μi1q)ii=1niq,~i=12νi1ii=12i)γ2(1~i=12(1μi2q)ii=1niq,~i=12νi2ii=12i)=(1(~i=12(1μi1q)ii=1niq)γ1,(νi1ii=12i)γ1)(1(~i=12(1μi2q)ii=1niq)γ2,(νi2ii=12i)γ2)=(1~=12(~i=12(1μiq)ii=1niq)γ,~=12(~i=12νiii=12i)γ)

As a result, the conclusion holds for n = 2, m = 2. Assume that Eq. (1) is true for n=k1, m=k2

qROFSPWA(Nð11,Nðk1k2)=(1~=1k2(~i=1k1(1μiq)ii=1ni)γq,=1k2(i=1k1νiii=1ni)γ)

Assume that Eq. (1) holds for n=k1+1, m=k2+1.

qROFSPWA(Nð11,Nð(k1+1)(k2+1))={=1k2γ(i=1k1ii=1niNði)}γ(k1+1)(ii=1ni(k2+1)Nð(k1+1)(k2+1))=(1~=1k2(~i=1k1(1μiq)ii=1ni)γq,=1k2(i=1k1νiii=1ni)γ)γ(k1+1)(ii=1ni(k2+1)Nð(k1+1)(k2+1))=(1~=1(k2+1)(~i=1(k1+1)(1μiq)ii=1ni)γq,=1k2+1(i=1k1+1νiii=1ni)γ)

Thus, Eq. (1) holds for n=k1+1, m=k2+1. As a result, Eq. (1) holds for every m,n1, through mathematical induction. Furthermore, to demonstrate that the aggregated result of q-ROFSPWA is also a q-ROPFSN. Any Nði= (μi,νi),(i=1,2,...,nand=1,2,...,n), where 0μi,νi1, satisfying that 0μiq+νiq1 with WVs γ={γ1,γ2,γn} and =1n={1=1n1,2=1n2,,n=1nm}for the parameters ð and decision makers Di respectively with the conditions that i=1nii=1ni=1 and =1mγ=1.

As

0μi101μi10(1μiq)ii=1ni10˜i=1n(1μiq)10˜=1m(˜i=1n(1μiq)ii=1ni)γ10~=1m(~i=1n(1μiq)ii=1ni)γ1

Similarly,

0μi10~i=1nνiii=1ni10~=1m(~i=1nνiii=1ni)γ1μiq+νiq1νiq1μiq~i=1n(νiq)ii=1ni(~i=1n(1μiq)ii=1ni)(~=1m(~i=1nνiq)ii=1ni)γ~=1m(~i=1n(1μiq)ii=1ni)γ(~=1m(~i=1nνiii=1ni)γ)q~=1m(~i=1n(1μiq)ii=1ni)γ

0{1~=1m(~i=1n(1μiq)ii=1ni)γq}q+{˜=1m(˜i=1nνiii=1ni)γ}q

By Eq. (2), we have

1˜=1m(˜i=1n(1μiq)ii=1ni)γ+˜=1m(˜i=1n(1μiq)ii=1ni)γ=1

0{1~=1m(~i=1n(1μiq)ii=1nγi)γq}q+{˜=1m(˜i=1nνiii=1ni)γ}q1

As a result, the aggregated result obtained by the q-ROFSPWA operator is actually a q-ROFSN.

Theorem 4.3 Consider a set of q-ROFSNs Nði=μi,νi(i=1,2,...,n and  =1,2,...m) with WVs =1n={1=1n1,2=1n2,,n=1nn}T and γ={γ1,γ2,γm}T for the decision makers Di and for the parameters ð respectively with the conditions that i=1n=1ni=1 and =1mγ=1. Then the q-ROFSPWA operator holds the following properties:

(Idempotency): If Nði=Γe(i=1,2,...,nand=1,2,...,m), where Γe=(p,r), then

qROFSPWA(N11,N12,Nnm)=Γe

(Boundedness): If Nði=(minmini{μi},maxmaxi{νi}) and Nði+=(maxmaxi{μi},minmini{νi}),then NðiqROFSPWA(Nð11,Nð12,Nð13,...,Nðnm)Nði+

(Monotonicity): If Γei=(pi,ri), (i=1,2,...,nand=1,2,...,m) be the agglomeration of q-ROFSNs such that μipi and νiri then

qROFSPWA(N11,N12,Nnm)qROFSPWA(Γ11,Γ12,Γnm)

(Shift Invariance): If Γ~e=(p,r) is another q-ROFSN, then

qROFSPWA(Nð11Γe,Nð12Γe,...NðnmΓe)=qROFSPWA(Nð11,Nð12,Nðnm)Γe

(Homogeneity): If λ is any real number such that λ0, then

qROFSPWA(λNð11,λNð12,...λNðnm)=λqROFSPWA(Nð11,Nð12,...Nðnm)

(Idempotency): As it is given that if for all Nði=Γe=(p,r)(i=1,2,...,n and =1,2,...m), then from Theorem 1, we have

qROFSPWA(Nð11,Nð12,Nðnm)

=(1~=1m(~i=1n(1μiq)ii=1ni)γq,˜=1m(˜i=1nνiii=1ni)γ)=(1~=1m(~i=1n(1piq)ii=1ni)γq,˜=1m(˜i=1nriii=1ni)γ)=(1(1pq)q,r)=(p,r)=Γe~

Therefore,

qROFSPWA(Nð11,Nð12,Nðnm)=Γe

(Boundedness): As Nði=(minmini{μi},maxmaxi{νi}) and Nði+=(maxmaxi{μi},minmini{νi})

To prove that

NðiqROFSPWA(Nð11,Nð12,Nð13,...,Nðnm)Nði+

Now for each i=1,2,...,n and =1,2,...,m, we have

minmini{μi}μimaxmaxi{μi}1maxmaxi{μiq}1μiqminmini{μiq}~=1m(~i=1n(1maxmaxi{μiq})ii=1ni)γ~=1m(~i=1n(1{μiq})ii=1ni)γ~=1m(~i=1n(1minmini{μiq}))γ((1maxmaxi{μiq})i=1nii=1ni)=1mγ~=1m(~i=1n(1μiq)ii=1ni)γ((1minmini{μiq})i=1nii=1ni)=1mγ(1maxmaxi{μiq})~=1m(~i=1n(1μiq)ii=1ni)γ(1minmini{μiq})1(1minmini{μiq})1~=1m(~i=1n(1μiq)ii=1ni)γ1(1maxmaxi{μiq})minmini{μi}q1~=1m(~i=1n(1μiq)ii=1ni)γqmaxmaxi{μi}

Next for each i=1,2,...,n and =1,2,...,m, we have

minmini{νi}νimaxmaxi{νi}˜=1m(˜i=1n(minmini{νi})ii=1ni)γ˜=1m(˜i=1n(νiq)ii=1ni)γ˜=1m(˜i=1n(maxmaxi{νi})ii=1ni)γ((minmini{νi})i=1nii=1ni)=1mγ˜=1m(˜i=1n(νi)i=1nii=1ni)=1mγ((maxmaxi{νi})i=1nii=1ni)=1mγthis implies that

minmini{νi}˜=1m(˜i=1n(νi)i=1nii=1ni)=1mγmaxmaxi{νi}

As a result of Eqs. (3) and (4), we obtain

minmini{μi}1~=1m(~i=1n(1μiq)ii=1ni)γqmaxmaxi{μi}

and

minmini{νi}˜=1m(˜i=1n(νiq)ii=1ni)γmaxmaxi{νi}

Let 𝓁=qROFSPWA(Nð11,Nð12,Nðnm)=(μ,ν) then by SF given in Definition (3.3), we have

S(𝓁)=μqνq+(eμqνqeμqνq+112)πq(maxmaxi{μi})q(minmini{μi})q+(e(maxmaxi{μi})q(minmini{μi})qe(maxmaxi{μi})q(minmini{μi})q+112)πNði+q=S(Nði+)

This implies S(𝓁)S(Nði+) and

S(𝓁)=μqνq+(eμqνqeμqνq+112)πq(minmini{μi})q(maxmaxi{μi})q+(e(minmini{μi})q(maxmaxi{μi})qe(minmini{μi})q(maxmaxi{μi})q+112)πNðiq=S(Nði)

This implies S(𝓁)S(Nði) and

Consider the following cases,

Case i: If S(𝓁)<S(Nði+) and S(𝓁)>S(Nði), by the comparison of two q-ROFSNs, we get

NðiqROFSPWA(Nð11,Nð12,Nð13,...,Nðnm)Nði+

Case ii: If S(𝓁)=S(Nði+), that is

μqνq+(eμqνqeμqνq+112)πq=(maxmaxi{μi})q(minmini{μi})q+(e(maxmaxi{μi})q(minmini{μi})qe(maxmaxi{μi})q(minmini{μi})q+112)πNði+q

Then by using the above inequalities, we get

μ=maxmaxi{μi}andν=minmini{νi}.Thusπq=πNði+q

Hence by comparison of two q-ROFSNs, we have

qROFSPWA(Nð11,Nð12,Nð13,...,Nðnm)Nði+

Case iii: If S(𝓁)=S(Nði), that is

μqνq+(eμqνqeμqνq+112)πq=(minmini{μi})q(maxmaxi{μi})q+(e(minmini{μi})q(maxmaxi{μi})qe(minmini{μi})q(maxmaxi{μi})q+112)πNðiq

Then by using the above inequalities, we get

μ=minmini{μi}andν=maxmaxi{νi}.Thusπq=πNðiq

This implies

qROFSPWA(Nð11,Nð12,Nð13,...,Nðnm)Nði

Hence, it is proved that

NðiROFSPWA(Nð11,Nð12,Nð13,...,Nðnm)Nði+

(Monotonicity): Since μipi and νiri, (i = 1, 2,…, n) and (=1,2,...,m), then this implies that to

μipi11pi1μi1piq1μiq

˜=1m(˜i=1n(1piq)ii=1ni)γ˜=1m(˜i=1n(1μiq)ii=1ni)γ1˜=1m(˜i=1n(1μiq)ii=1ni)γ1˜=1m(˜i=1n(1piq)ii=1ni)γ1~=1m(~i=1n(1μiq)ii=1ni)γq1~=1m(~i=1n(1μiq)ii=1ni)γq.Furthermore,

νiri(˜i=1n(νi)ii=1ni)˜i=1n(νi)ii=1ni˜=1m(˜i=1n(νi)ii=1ni)γ˜=1m(˜i=1n(ri)i˜i=1ni)γ

Let

𝓁N=qROFSPWA(Nð11,Nð12,Nð13,...,Nðnm)=(μN,νN)𝓁Γ=qROFSPWA(Γð11,Nð12,Nð13,...,Nðnm)=(μN,νN)

From Eqs. (5) and 6, we have

μNpΓandνNpΓ

then by SF given in Definition 9, we have

S(𝓁N)S(𝓁Γ)

In view of that direction, consider the following cases,

Case i: If S(𝓁N)<S(𝓁Γ) and S(𝓁)>S(Nði), by the comparison of two q-ROFSNs, we get

qROFSPWA(Nð11,Nð12,Nð13,...,Nðnm)qROFSPWA(Γð11,Γð12,Γð13,...,Γðnm)

Case ii: If S(𝓁N)<S(𝓁Γ), that is

S(𝓁N)=μΓqνΓq+(eμΓqνΓqeμΓqνΓq+112)πΓq==μΓqνΓq+(eμΓqνΓqeμΓqνΓq+112)πΓq=S(𝓁N)then by above inequality, we have

μΓ=pΓandνΓ=rΓ

Hence

πΓq=πΓq(μΓ,νΓ)=(pΓ,rΓ)

Therefore, it is proved that

qROFSPWA(Nð11,Nð12,Nð13,...,Nðnm)qROFSPWA(Γð11,Γð12,Γð13,...,Γðnm)

(Shift Invariance): Since Γe=(p,r) and Nði=(μði,νði) are the q-ROFSNs, so

Nð11Γe=(1(1μiq)(1pq)q,νir)

Therefore,

qROFSWA(Nð~11Γe,,Nð~nmΓe)==1mγ(i=1nii=1ni(Nð~nmΓe))=1~=1m(~i=1n(1μiq)ii=1ni(1pq)ii=1ni)γq,~=1m(~i=1nνiii=1nirii=1ni)γ=1(1pq)~=1m(~i=1n(1μiq)ii=1ni)γq,r~=1m(~i=1nνiii=1ni=1~=1m(~i=1n(1μiq)ii=1ni)γq,~=1m(~i=1nνiii=1ni

Hence the required result is proved.

(Homogeneity): Consider λ0 be any real number and Nði=(μi,νi) be a q-ROFSN, then

λNði=1(1μiq)f)γq,νiλ

Now

qROFSPWA(λNð11,λNð12,λNð13,...,λNðnm)=1~=1m(~i=1n(1μiq)λii=1ni)γq,˜=1m(˜=1nνiλii=1ni)γ=1(~=1m(~i=1n(1μiq)ii=1ni)γq)λ,(˜=1m(˜=1nνiλii=1ni)γ)λ=λqROFSPWA(Nð11,Nð12,Nð13,...,Nðnm)

Therefore, the required property is proved.

q-ROFSPWGA operator

Definition 4.4. Assume that Nði=μi,νi for (i=1,2,...,n and =1,2,...,m) be a agglomeration of q-ROFSNs, and WVs γ={γ1,γ2,γn} and =1n={1=1n1,2=1n2,,n=1nm} for the decision experts Di and for attributes ð respectively with the conditions that i=1nwi=1 and =1mv=1. Then the mapping for qROFSPWG:ΩnΩ, be a n dimension mapping.

qROFSPWG(Nð11,Nðnm)=k=1mγ(1=1nNð112=1nNð12,n=1nNðnm)where 𝓁=~k=1j1U(Nk) (=2,n), 𝓁1=1 and U(Nk) is the score of kth q-ROFN. We can consider q-ROFSPWG operator by thy theorem below

Theorem 4.5 Consider that Ni=μi,νi be a agglomeration of q-ROFSNs, we can find qROFSPWG operator by,

qROFSPWG(Nð~11,Nð~12,Nð~nm)=~=1n(~=1nμi=1n)γ,1~=1m(~i=1n(1νiq)=1n)γq

As we know from operation laws, mathematical induction may be used to prove a given result that Nð11Nð12=(μ11μ12,(ν11)q+(ν12)q(ν11)q(ν12)qq) and λN=(μλ,1[1νq]q,) for λ1.

First we will show that the Eq. (1) is true for n = 2 and m = 2, so we have

qROFSPWG(Nð11,Nð12)==12γ(i=12=1nNði)=γ1(i=12ii=1niNði1)γ2(i=12ii=1niNði2)=γ1(1i=1niNð112i=1niNð21)γ2(2i=1niNð122i=1niNð22)=γ1{(μ11=1n,1(1ν11q)=1nq,)(μ21=1n,1(1ν21q)=1nq)}γ2{(μ12=1n,1(1ν12q)=1nq)(μ22=1n,1(1ν22q)=1nq)}=γ1(~i=12μi1ii=12i,1~i=12(1νi1q)ii=1niq,)γ2(~i=12μi2ii=12i,1~i=12(1νi2q)ii=1niq)=((μi1ii=12i)γ1,1(~i=12(1νi1q)ii=1niq)γ1,)((μi2ii=12i)γ2,1(~i=12(1νi2q)ii=1niq)γ2)=(~=12(~=12μiii=12i)γ,1~=12(~i=12(1νiq)ii=1niq)γ)

The result holds for n = 2 and m = 2.

Suppose that Eq. (1) holds for n=k1 and m=k2

qROFSPWG(Nð~11,Nð~k1k2)=~=1k2(~i=1k1μiii=1ni)γ,1~=1k2(~i=1k1(1νiq)ii=1ni)γq

Assume that Eq. (1) holds for n=k1+1 and =k2+1

qROFSPWG(Nð11,Nð(k1+1)(k2+1))={=1k2γ(i=1k1ii=1niNði)}γ(k1+1)(ii=1ni(k2+1)Nð(k1+1)(k2+1))=~=1k2(~i=1k1μiii=1ni)γ,1~=1k2(~i=1k1(1νiq)ii=1ni)γqγ(k1+1)(ii=1ni(k2+1)Nð(k1+1)(k2+1))=~=1(k2+1)(~i=1(k1+1)μiii=1ni)γ,1~=1(k2+1)(~i=1(k1+1)(1νiq)ii=1ni)γq

Hence Eq. (1) holds for n=k1+1 and m=k2+1, Eq. (1) is true. As a result, Eq. (1) is true for all m,n1 by mathematical induction. Furthermore, to demonstrate that the q-ROFSPWG operator’s aggregated result is actually a q-ROFSN. Now for any Nði=(νi,μi),(i=1,2,...,n) and (=1,2,...,n), where 0νi,μi1, satisfying that 0νiq+μiq1 with WVs γ={γ1,γ2,γn} and =1n={1=1n1,2=1n2,,n=1nm} for the DMs Di and for the attributes ð respectively with the conditions that i=1nii=1ni=1 and =1mγ=1.

As

0νi101νi10(1νiq)ii=1ni10~i=1n(1νiq)10~=1m(˜i=1n(1νiq)ii=1ni)γ10~=1m(~i=1n(1νiq)ii=1ni)γ1

Similarly,

0μi10~i=1nμiii=1ni10~=1m(~i=1nμiii=1ni)γ1νiq+μiq1μiq1νiq~i=1n(μiq)ii=1ni(~i=1n(1νiq)ii=1ni)(~=1m(~i=1nμiq)ii=1ni)γ~=1m(~i=1n(1νiq)ii=1ni)γ(~=1m(~i=1nμiii=1ni)γ)q~=1m(~i=1n(1μiq)ii=1ni)γ

Now we have,

0{1~=1m(~i=1n(1νiq)ii=1ni)γq}q+{~=1m(~i=1nμiii=1ni)γ}q

By Eq. (2), we have

1~=1m(~i=1n(1νiq)ii=1ni)γ+~=1m(~i=1n(1νiq)ii=1ni)γ=1

Therefore,

0{1~=1m(~i=1n(1νiq)ii=1ni)γq}q+{~=1m(~i=1nμiii=1ni)γ}q1

Theorem 4.6 Consider the agglomeration of q-ROFSNs Nði=μi,νi(i=1,2,...,n) and (=1,2,...m) with WVs =1n={1=1n1,2=1n2,,n=1nn}T and γ={γ1,γ2,γm}T for the DMs Di and for the attributes ð respectively with the conditions that i=1n=1ni=1 and =1mγ=1. Then the q-ROFSPWG operator holds the following characteristics:

(Idempotency):

If Nði=Γe(i=1,2,...,nand=1,2,...,m), where Γe=(p,r), then

qROFSPWG(N11,N12,Nnm)=Γe

(Boundedness):

If Nði=(minmini{μi},maxmaxi{νi}) and Nði+=(maxmaxi{μi}, minmini{νi}), then

NðiqROFSPWG(Nð11,Nð12,Nð13,...,Nðnm)Nði+

(Monotonicity):

If Γei=(pi,ri), (i=1,2,...,nand=1,2,...,m) be the agglomeration of q-ROFSNs such that μipi and νiri then

qROFSPWG(N11,N12,Nnm)qROFSPWG(Γ11,Γ12,Γnm)

(Shift Invariance):

If Γ~e=(p,r) is another q-ROFSN, then

qROFSPWG(Nð11Γe,Nð12Γe,...NðnmΓe)=qROFSPWG(Nð11,Nð12,Nðnm)Γe

(Homogeneity):

If λ is any real number such that λ0, then

qROFSPWG(λNð11,λNð12,...λNðnm)=λqROFSPWG(Nð11,Nð12,...Nðnm)

Proofs are straight forward.

Proposed madm approach

Consider a universal set U={u1,u2,,ul} with l alternatives and E={ð1,ð2,,ðn} be a agglomeration of attributes which contain n elements and ð1ð2ð3ðn presents the prioritization of attributes which indicates attribute ð has a higher priority degree than ði j>i. If ξ={ξ1,ξ2,,ξp} is a set of DMs who will evaluate the given ‘m’ alternatives of their respective parameter is a set of decision makers who will valuate the given ‘m’ alternatives of their respective parameters ð(=1,2,...,n).

Suppose that the DMs provide their preferences in form of q-ROFSNs Nði=(μi,νi) with the WVs =1n={1=1n1,2=1n2,,n=1nn}T and γ={γ1,γ2,γm}T for the parameters ð and decision makers ξi respectively with the conditions that i=1n=1ni=1 and =1mγ=1. The collective data is presented in the decision matrix M=[Nði]p×n. Normalization is not required for the same type of attributes. But there is a possibility of two types of attributes (cost type Tc and benefit type Tb) in MADM process. The decision matrix was then transformed into a normalized matrix =(i)p×n, using the normalization procedure,

(i)p×n={Nði;τb(Nði)c;τc..where (Nði)c represents the compliment of Nði.

We then use the q-ROFSPWA operators or q-ROFSPWG operators to execute a MADM method in a q-ROF situations. The proposed operators will be applied in the MADM and it requires the steps below.

Case study

Sustainable supplier selection (SSS) is an important aspect of green environment management. It involves identifying and selecting suppliers that share the same commitment to sustainability as the organization, and that can provide environmentally responsible products and services. The importance of sustainable supplier selection in a green environment can be summarized in the following points:

  • Reducing environmental impact: Sustainable supplier selection can help to reduce the environmental impact of the supply chain by selecting suppliers that use environmentally responsible practices. This includes suppliers that use renewable energy sources, that minimize waste and pollution, and that have implemented sustainable production processes.

  • Meeting customer expectations: As customers become increasingly concerned about the environment, they expect organizations to be environmentally responsible in all aspects of their operations. By selecting sustainable suppliers, organizations can meet these expectations and improve their reputation with customers.

  • Mitigating risk: By selecting sustainable suppliers, organizations can mitigate the risk of supply chain disruptions and reputation damage. Suppliers that use environmentally responsible practices are less likely to be subject to regulatory fines and penalties, and are less likely to experience negative publicity due to environmental incidents.

  • Improving efficiency: Sustainable supplier selection can also help to improve efficiency in the supply chain. Suppliers that use sustainable practices are often more efficient in their operations, resulting in reduced costs and improved performance.

  • Encouraging innovation: By selecting sustainable suppliers, organizations can encourage innovation in environmentally responsible practices. Suppliers that are committed to sustainability are more likely to invest in the research and development of new technologies and processes that reduce their environmental impact.

Organizations should develop a comprehensive supplier selection process that includes sustainability criteria to select sustainable suppliers in a green environment. This process should include evaluating supplier practices and policies related to sustainability, such as energy use, waste management, and carbon emissions. Organizations should also consider supplier certifications and industry ratings related to sustainability. SSS is an important aspect of green environment management. It can help to reduce environmental impact, meet customer expectations, mitigate risk, improve efficiency, and encourage innovation. Organizations should develop a comprehensive supplier selection process that includes sustainability criteria to select suppliers that share their commitment to sustainability and can provide environmentally responsible products and services.

Input:
Step 1:
Construct a decision matrix M=[Nði]p×n by collecting the assessment data of each universal element to their corresponding attributes in the form of q-ROFSNs as:
ξ1ξ2ξpð1ð2ðn[(μ11,ν11)(μ12,ν12)(μ1p,ν1p)(μ21,ν21)(μ22,ν22(μ2p,ν2p)(μn1,νn1)(μn2,νn2)(μnp,νnp)]
Step 2:
There are mainly two different types of attributes are presented in the decision matrix, namely benefit type attribute (τb) and cost type attribute (τc). Normalization is not required for the same type of attributes, but for the different types of attributes in MADM, use the normalization formula given in Eq. (5).
Calculations:
Step 3:
By using the given formula, calculate the values of T˘i. By doing so, we are able to calculate the weight vector for all attributes, which is utilized in Step 4. AOs are utilized by this weight veterinarian. Softmax generates its own weight vector, eliminating the need for additional methods to determine weights.
T˘i=~k=1p1H(Ni(k))(p=2,n),
T˘i=1
Step 4:
By using the q-ROFPWA (or q-ROFPWG) operator, aggregate the values i for each alternative Ai:
qROFSPWA(Nð11,Nðnm)=1~=1m(~i=1n(1μiq)=1n)γq,~=1n(~=1nνi=1n)γ
qROFSPWG(Nð11,Nðnm)=~=1n(~=1nμi=1n)γ,1~=1m(~i=1n(1νiq)=1n)γq
Output:
Step 5:
Calculate the total score values of each element by using given formula.
S(α)=1+μqνq2
Step 6:
The alternatives were ranked by the SF, and the best appropriate choice was finally choosen. Pictorial view of proposed method is given in Fig. 1.

The fast growth of economic globalization, along with a more cutthroat climate for business competitiveness, has resulted in the struggle between modern businesses shifting to one that is fought amongst their respective supply chains. The range of individuals who make up the consumer market is expanding, while at the same time, the shelf lives of new products are shrinking. The inconsistency of the demand market and the influence of external factors push businesses toward efficient supply chain implementation and coordination, as well as strategic alliances with other businesses, to strengthen their fundamental competitiveness and protect themselves from the dangers of the outside world. Supplier selection is the most important action to take in order to accomplish this objective. As a result, the challenge of supplier selection has received a significant amount of attention, whether in the context of the theory of supply chain management or the context of practical production management issues.

SSS must consider a wide variety of criteria when operating in an environmentally conscious setting, including environmental performance, social responsibility, economic viability, innovation, transparency and accountability, and supply chain management. When organisations consider these characteristics, they are better able to identify suppliers who are committed to sustainability and more likely to provide sustainable solutions.

A numerical illustration of determining sustainable suppliers by employing q-ROFSNs is provided in this article as a means of illustrating the process that is the subject of this article’s suggested solution. When it comes to supply chain management, there is a panel with four different sustainable suppliers that may be chosen from U={~1,~2,~3,~4}. The professionals decide to analyze the four potential suppliers based on the following criteria: (1) ð1 is the factor for the quality of product; (2) ð2 is the factor for the pricing; (3) ð3 is the element for the delivery; and (4) ð4 is the factor for the ecological concerns.

The application procedure of the proposed approach is as follows:

Decision-making process

Consider a set U={~γ1,~γ2,~γ3,~γ4} of universal elements, a set E={ð1,ð2,ð3,ð4} of parameters and Φ={Φ1,Φ2,Φ3,Φ4} be a set of DMs, to assess the universal elements according to their corresponding parameters ð(=1,2,...,n).

Assume that the DM’s preferences are expressed in q-ROFSNs. Nði=(μi,νi) with the WVs =1n={1=1n1,2=1n2,,n=1nn}T and γ={γ1,γ2,γm}T for the parameters ð and decision makers Φi respectively with the conditions that i=1n=1ni=1 and =1mγ=1. The collective data is presented in the decision matrix M=[Nði]p×n. Normalization is not required for the same type of attributes. But there is a possibility of two types of attributes (cost type Tc and benefit type Tb) in MADM process, the decision matrix then transformed into a normalized matrix =(i)p×n using normalizing procedure. We take q = 3.

Step 1:

From the DMs, obtain a decision matrix D(p)=(Bi(p))m×n in the form of q-ROFSNs given in Tables 36.

Table 3:
Decision matrix for ~γ1.
Φ1 Φ2 Φ3 Φ4
ð1 (0.600, 0.140) (0.110, 0.600) (0.770, 0.100) (0.800, 0.400)
ð2 (0.600, 0.500) (0.500, 0.020) (0.010, 0.740) (0.940, 0.540)
ð3 (0.430, 0.040) (0.700, 0.600) (0.940, 0.130) (0.570, 0.740)
ð4 (0.540, 0.900) (0.710, 0.850) (0.740, 0.020) (0.700, 0.070)
Table 4:
Decision matrix for ~γ2.
Φ1 Φ2 Φ3 Φ4
ð1 (0.740, 0.530) (0.510, 0.650) (0.590, 0.580) (0.510, 0.610)
ð2 (0.610, 0.350) (0.540, 0.710) (0.610, 0.410) (0.290, 0.710)
ð3 (0.530, 0.350) (0.470, 0.740) (0.310, 0.570) (0.910, 0.120)
ð4 (0.720, 0.290) (0.820, 0.310) (0.450, 0.150) (0.540, 0.140)
Table 5:
Decision matrix for ~γ3.
Φ1 Φ2 Φ3 Φ4
ð1 (0.610, 0.250) (0.100, 0.670) (0.770, 0.110) (0.700, 0.170)
ð2 (0.700, 0.040) (0.010, 0.740) (0.800, 0.100) (0.540, 0.140)
ð3 (0.650, 0.100) (0.110, 0.770) (0.730, 0.110) (0.750, 0.100)
ð4 (0.670, 0.110) (0.140, 0.640) (0.630, 0.100) (0.640, 0.140)
Table 6:
Decision matrix for ~γ4.
Φ1 Φ2 Φ3 Φ4
ð1 (0.650, 0.110) (0.640, 0.110) (0.740, 0.030) (0.670, 0.100)
ð2 (0.610, 0.010) (0.680, 0.070) (0.500, 0.010) (0.620, 0.040)
ð3 (0.710, 0.050) (0.720, 0.100) (0.730, 0.020) (0.710, 0.010)
ð4 (0.50, 0.160) (0.500, 0.200) (0.600, 0.100) (0.720, 0.020)

Step 2:

Normalize the decision matrices acquired by DMs. There is one cost types attribute ð2 and others are benefit type attributes given in Table 710.

Table 7:
Normalized decision matrix for ~γ1.
Φ1 Φ2 Φ3 Φ4
ð1 (0.600, 0.140) (0.600, 0.110) (0.770, 0.100) (0.800, 0.400)
ð2 (0.600, 0.500) (0.020, 0.500) (0.010, 0.740) (0.940, 0.540)
ð3 (0.430, 0.040) (0.600, 0.700) (0.940, 0.130) (0.570, 0.740)
ð4 (0.540, 0.900) (0.850, 0.710) (0.740, 0.020) (0.700, 0.070)
Table 8:
Normalized decision matrix for ~γ2.
Φ1 Φ2 Φ3 Φ4
ð1 (0.740, 0.530) (0.650, 0.510) (0.590, 0.580) (0.510, 0.610)
ð2 (0.610, 0.350) (0.710, 0.540) (0.610, 0.410) (0.290, 0.710)
ð3 (0.530, 0.350) (0.740, 0.470) (0.310, 0.570) (0.910, 0.120)
ð4 (0.720, 0.290) (0.310, 0.820) (0.450, 0.150) (0.540, 0.140)
Table 9:
Normalized decision matrix for ~γ3.
Φ1 Φ2 Φ3 Φ4
ð1 (0.610, 0.250) (0.750, 0.570) (0.450, 0.540) (0.350, 0.750)
ð2 (0.570, 0.580) (0.910, 0.230) (0.450, 0.710) (0.350, 0.680)
ð3 (0.210, 0.590) (0.350, 0.560) (0.250, 0.810) (0.350, 0.650)
ð4 (0.580, 0.590) (0.610, 0.210) (0.350, 0.450) (0.120, 0.980)
Table 10:
Normalized decision matrix for ~γ4.
Φ1 Φ2 Φ3 Φ4
ð1 (0.650, 0.560) (0.280, 0.910) (0.350, 0.120) (0.750, 0.510)
ð2 (0.350, 0.250) (0.350, 0.480) (0.380, 0.490) (0.590, 0.580)
ð3 (0.140, 0.940) (0.380, 0.480) (0.510, 0.750) (0.290, 0.340)
ð4 (0.480, 0.910) (0.250, 0.450) (0.710, 0.290) (0.390, 0.210)

Step 3:

Compute the values of T˘i(p) by using Equation ti3.

T˘i(1)=(11110.60600.60700.72700.72400.33000.26500.21600.60500.17800.11500.19700.2350)

We obtain the WVs

W1=(0.4730,0.2860,0.1560,0.0840)W2=(0.5030,0.3050,0.1330,0.0570)W3=(0.4670,0.3390,0.1000,0.0920)W4=(0.3900,0.2820,0.2350,0.0910)

T˘i(2)=(11110.62800.57000.50500.45200.37100.34200.29200.15000.20500.07600.12300.1310)

We obtain the WVs

W1=(0.4530,0.2840,0.1680,0.0930)W2=(0.5030,0.2860,0.1720,0.0380)W3=(0.5200,0.2630,0.1520,0.0640)W4=(0.5770,0.2600,0.0860,0.0750)

T˘i(3)=(11110.60500.61800.46600.31000.24200.53700.17000.11200.12000.23200.04100.0430)

We obtain the WVs

W1=(0.5080,0.3070,0.1420,0.0610)W2=(0.4180,0.2580,0.2240,0.0970)W3=(0.5960,0.2770,0.1010,0.0240)W4=(0.6820,0.2110,0.0760,0.0290)

T˘i(1)=(11110.60600.60700.72700.72400.33000.26500.21600.60500.17800.11500.19700.2350)

We obtain the WVs

W1=(0.4650,0.2550,0.2380,0.4000)W2=(0.4820,0.0640,0.2240,0.2270)W3=(0.4260,0.2210,0.1990,0.1510)W4=(0.3780,0.2430,0.1910,0.1860)

Step 4:

Calculate the aggregated values 𝓁i for each alternative ~γi by using the q-ROFSPWA and q-ROFSPWG operators using Eqs. (7), (8), respectively given in Table 11.

Table 11:
q-ROFS aggregated values.
q-ROFSPWA q-ROFSPWG
~γ1 (0.6954, 0.2176) (0.3721, 0.4576)
~γ2 (0.6664, 0.4812) (0.2136, 0.5703)
~γ3 (0.6171, 0.4983) (0.3410, 0.2314)
~γ4 (0.5614, 0.0000) (0.1456, 0.0027)
~γ5 (0.4946, 0.4160) (0.6112, 0.1288)

Step 5:

By using Eq. (9), calculate the score of all q-ROFS aggregated values 𝓁i, given in Table 12.

Table 12:
Score of q-ROFS aggregated values.
S(~γi) qROFSPWA qROFSPWG
S(~γ1) 0.8648 0.3304
S(~γ2) 0.8611 0.3044
S(~γ3) 0.8600 0.3048
S(~γ4) 0.6472 0.2988

Step 6:

As per given in Table 12, the alternative ~γ1 has the maximum score. So, ~γ1 is the optimal solution,

Authenticity analysis

Wang & Triantaphyllou (2008) evaluated the following test criteria to demonstrate the validity of the suggested approach.

  • The optimum alternative should not change if the ratings of the non-optimal universal elements are replaced with those of the worse option, provided that the corresponding WVs remains persistent.

  • The whole framework of technique should be transitive.

  • When the same MADM approach is applied to solve the problem, the aggregated result of the alternatives should be identical as the assessment of the initial problem.

We confirmed the conditions on our proposed MADM approach in the part below.

Authenticity test 1

If the PMVs and NMVs of alternatives ~γ2 and ~γ3 in Tables 4 and 5 are exchanged, the modified decision matrix given in Tables 13 and 14 appears.

Table 13:
Modified decision matrix for ~γ2.
Φ1 Φ2 Φ3 Φ4
ð1 (0.53, 0.74) (0.51, 0.65) (0.85, 0.95) (0.51, 0.61)
ð2 (0.35, 0.61) (0.54, 0.71) (0.61, 0.41) (0.29, 0.71)
ð3 (0.35, 0.53) (0.47, 0.74) (0.57, 0.31) (0.12, 0.91)
ð4 (0.72, 0.29) (0.82, 0.31) (0.15, 0.45) (0.14, 0.54)
Table 14:
Modified decision matrix for ~γ3.
Φ1 Φ2 Φ3 Φ4
ð1 (0.25, 0.61) (0.57, 0.75) (0.54, 0.45) (0.75, 0.35)
ð2 (0.58, 0.57) (0.23, 0.91) (0.71, 0.45) (0.68, 0.35)
ð3 (0.59, 0.21) (0.56, 0.35) (0.81, 0.25) (0.65, 0.35)
ð4 (0.59, 0.58) (0.21, 0.61) (0.45, 0.35) (0.98, 0.12)

On the basis of given data, the proposed q-ROFSPWA operator has been applied and aggregate the q-ROFSNs for the alternatives, given in Table 15.

Table 15:
Collective q-ROF decision matrix.
S(i) qROFSPWA qROFSPWG
S(1) 0.6749 0.2314
S(2) 0.5453 0.0871
S(3) 0.2312 0.3212
S(4) 0.2910 0.2912

As a result, the ranking order of options is determined by the score values, which is same as the original ranking and proposed technique passes the first three tests.

Authenticity test 2, test 3

If we split the given problem like {~γ1,~γ2},{~γ2,~γ3},{~γ3,~γ4},{~γ4,~γ1}. Then using the proposed method, we obtain the following ranking order ~γ1~γ2,~γ2~γ3,~γ4~γ3,~γ1~γ4 and this is identical to the original ranking. As a consequence, the proposed approach satisfies authenticity test 2 and test 3.

Sensitivity analysis

Across the whole decision-making process, the effect of q on the most preferable decision was studied, utilizing multiple values of q for the given scenario. Table 16 epitomizes the total score values and ranking of the alternatives associated to these distinct q values. Since the impact of ‘q’ on decision-making, our proposed technique is more adaptable because the DMs may adjust the attributes based on their current circumstances and preferences. For example, if the DMs can draw inferences from their optimistic tendency, low values may be given to these criteria and the overall score values will decrease. If the DMs are optimistic, the parameters can be given higher values and the aggregated values of scores will increase. As a consequence, the results are accurate. The DM might be able to determine their goals via this analysis and pick the optimal option depending on their perspective. The optimal alternative is identical, implying that the results are accurate and affected by the DM’s optimism. The results of the rating are valid. The DM may be able to see their objectives via this analysis and pick the optimal option depending on their perspective. The optimal alternative is the same, implying that the results are factual and affected by the DM’s optimism. The results of the rating are valid. The DM may be able to see their objectives via this analysis and pick the optimal option depending on their perspective.

Table 16:
Final ranking.
q S(~γi) S(~γ2) S(~γ3) S(~γ4) Ranking order Final decision
4 0.6058 0.4363 0.3554 0.1331 ~γ1~γ2~γ3~γ4 ~γ1
5 0.2211 0.1130 0.2140 0.1202 ~γ1~γ3~γ4~γ2 ~γ1
6 0.5126 0.4160 0.0361 0.3062 ~γ1~γ2~γ4~γ3 ~γ1

Comparison analysis and discussion

In this section, we will analyze and compare the new operators we are suggesting with the operators that are already being used. The important point to note is that both our proposed operators and the existing ones lead to the same conclusion. This demonstrates that our suggested operators are superior.

To understand this, we conducted an investigation and found that by using specific preexisting operators to process the information, we can reach an equally optimal conclusion. This highlights the strength and reliability of our proposed approach, which enables us to make perfect decisions. To provide a clear comparison, we have included Table 17, which shows how our suggested operators compare to the various existing operators that are currently in use.

Table 17:
Comparison of proposed operators with some exiting operators.
Authors AOs Ranking of alternatives The optimal alternative
Peng, Dai & Garg (2018) q-ROFWEA ~γ1~γ3~γ4~γ2 ~γ1
q-ROFDWG ~γ1~γ3~γ2~γ4 ~γ1
Liu & Wang (2018) q-ROFWA ~γ1~γ2~γ3~γ4 ~γ1
q-ROFWG ~γ1~γ2~γ4~γ3 ~γ1
Riaz et al. (2020) q-ROFHWAGA ~γ1~γ2~γ3~γ4 ~γ1
q-ROFHOWAGA ~γ1~γ3~γ2~γ4 ~γ1
Liu, Wang & Liu (2018) q-ROFHM ~γ1~γ2~γ3~γ4 ~γ1
q-ROFWHM ~γ1~γ2~γ3~γ4 ~γ1
Riaz et al. (2020) q-ROFEPWA ~γ1~γ2~γ3~γ4 ~γ1
Zhao et al. (2010) q-ROFHM ~γ1~γ2~γ4~γ3 ~γ1
q-ROFWHM ~γ1~γ2~γ3~γ4 ~γ1
q-ROFEPWG ~γ1~γ4~γ3~γ2 ~γ1
Joshi & Gegov (2020) CQROFWA ~γ1~γ2~γ3~γ4 ~γ1
CQROFWG ~γ1~γ2~γ3~γ4 ~γ1
Liu & Liu (2018) q-ROFWBM ~γ1~γ2~γ3~γ4 ~γ1
q-ROFWGBM ~γ1~γ3~γ2~γ4 ~γ1
Jana, Muhiuddin & Pal (2019) q-ROFDWA ~γ1~γ2~γ3~γ4 ~γ1
Proposed q-ROFSPWA ~γ1~γ2~γ3~γ4 ~γ1
q-ROFSPWG ~γ1~γ3~γ2~γ4 ~γ1

Conclusion

Under the parameterized description of the universe’s elements, the q-ROFSSs are more efficient because they provide a broad range for PMV and NMV to cope with ambiguous and imprecise data. AOs are essential mathematical instruments for information fusion, which is the process of reducing a collection of fuzzy numbers to a single fuzzy number that represents the set uniquely. We developed two distinct AOs for data fusion of q-ROFSNs in order to surmount some of the drawbacks of existing AOs. Based on prescribed operational laws, we developed the q-ROFSPWA operator and q-ROFSPWG operator AOs. We also presented a robust MADM strategy to demonstrate the efficacy and superiority of the proposed AOs. A numerical example of the proposed MADM technique in relation to the problem of selecting a sustainable logistic provider is also provided to illustrate the uncertain condition. The outcomes demonstrate that the proposed method for addressing uncertainty is both precise and efficient. In order to demonstrate the efficacy of proposed AOs, we discuss authenticity analysis. Finally, the efficacy, precision, and veracity of the proposed AOs are assessed by comparing the proposed MADM technique to various previous approaches.

Regarding the limits of our proposed work, there is no inclusion of the interplay between membership and non-membership recommended by the DMs, and if our data is not q-ROFNs, it will not function effectively. The suggested model functions effectively with q-ROFNs as input. However, with some small modifications, the suggested model may be expanded to include more input data types. Future research will examine how the proposed operators may be used for various forms of data and how they function in various domains. The principles in this article can be applied to a wide range of real-world situations. Effectively addressing ambiguity in business, machine intelligence, cognitive science, the electoral system, pattern recognition, learning techniques, trade analysis, predictions, agricultural estimate, microelectronics, and other fields is possible with the help of these methods.

Flow chart of proposed method.

Figure 1: Flow chart of proposed method.

2 Citations   Views   Downloads