Next Article in Journal
High-Order Topology-Enhanced Graph Convolutional Networks for Dynamic Graphs
Previous Article in Journal
Peculiarities of Electron Wave Packet Dynamics in Planar Nanostructures in the Presence of Magnetic and Electric Fields
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Topological Data Analysis of m-Polar Spherical Fuzzy Information with LAM and SIR Models

1
Department of Mathematics, University of the Punjab, Lahore 54590, Pakistan
2
Department of Operations Research and Statistics, Faculty of Organizational Sciences, University of Belgrade, 11000 Belgrade, Serbia
3
Faculty of Technical Sciences, University of Novi Sad, 21000 Novi Sad, Serbia
*
Author to whom correspondence should be addressed.
Symmetry 2022, 14(10), 2216; https://doi.org/10.3390/sym14102216
Submission received: 22 September 2022 / Revised: 7 October 2022 / Accepted: 11 October 2022 / Published: 20 October 2022

Abstract

:
The concept of m-polar spherical fuzzy sets (mPSFS) is a combination of m-polar fuzzy sets (mPFS) and spherical fuzzy sets (SFS). An mPSFS is an optimal strategy for addressing multipolarity and fuzziness in terms of ordered triples of positive membership grades (PMGs), negative membership grades (NMGs), and neutral grades (NGs). In this study, the innovative concept of m-polar spherical fuzzy topology (mPSF-topology) is proposed for data analysis and information aggregation. We look into the characteristics and results of mPSF-topology with the help of several examples. Topological structures on mPSFSs help with both the development of new artificial intelligence (AI) tools for different domain strategies and the study of different kinds of uncertainty in everyday life problems. These strategies make it possible to recognise and look into a situation early on, which helps professionals to reduce certain risks. In order to address various group decision-making issues in the m-polar spherical fuzzy domain, one suggestion has been to apply an extended linear assignment model (LAM) along with the SIR method known as superiority and inferiority ranking methodology in order to analyze road accident issues and dispute resolution. In addition, we examine the symmetry of optimal decision and perform a comparative study between the research carried out using the suggested methodology and several existing methods.

1. Introduction

The conditions of our everyday life provide us with obstacles that arise from imprecise information and an absence of appropriate modelling, both of which can lead to imprecise answers and questionable reasoning. While human intelligence (HI), machine learning intelligence (MLI), and online social networks have only been around for a short time, they have changed the economic and social paradigms of society. Because of the rapid expansion of HI, MLI, and big data over the past few years, incredible improvements in our day-to-day lives have been made [1,2,3,4,5,6,7]. The theory of topology pertains to the interaction between spatial components or modules. It can be utilised to design large datasets with the ability to explain certain spatial functions. The definition of topological spaces is listed in Table 1.
We have extended the study of topology to a new hybrid approach of SFS and mPFS, i.e., m polar spherical fuzzy sets (mPSFS), by following the idea of Chang [5]. We define the concept of mPSF-topological space using an mPSF-null set, mPSF-absolute set, and certain basic operations of mPSFSs, such as union and intersection. Here, we investigate several basic properties and analyse them with the help of theorems and examples.
Fuzzy mathematics differs from traditional mathematics, primarily in the field of set theory. Fuzzy mathematics was first developed only a few years ago, and is rich in ideas. In automobiles and traffic control systems, where logic circuits control anti-lock brakes, electronic systems, and other functions, its application is widespread. This is an even more specific form of the phrase “crisp set.” It has the ability to decide either yes or no, which corresponds to the numbers 1 and 0. Several of the ideas that are discussed in this article were anticipated by an American philosopher by the name of Black [22], who lived thirty years ago. The author of [22] developed a theory that has as its primary building blocks “fuzzy sets,” which are simply sets with “imperfect” bounds. An important work produced by Zadeh [23] in 1965 makes a crucial argument concerning the evolution of contemporary ideas around ambiguity, and was an immediate extension of the crisp set concept. Atanassov [24,25,26] suggested the idea of intuitionistic fuzzy sets (IFS) and intuitionistic fuzzy numbers (IFN) in 1983. Yager proposed “Pythagorean fuzzy sets (PFS)” [27,28], and Yager further introduced “q-rung orthopair fuzzy sets (q-ROFS)” [29]. Soft sets (SS) and SS theory were originated by Molodtsov [30,31]. Smarandache [32] suggested a new model called neutrosophic sets by introducing another grade to FS. Picture fuzzy sets (PiFS) were proposed by Cuong [33]. Spherical fuzzy sets (SFSs), which were recently introduced by Kutlu Gündodu and Kahraman [34], are the most recent extension of fuzzy sets; in these, the squared sum of the hesitancy-neutral degree, membership degree, and non-membership degree does not exceed 1. Ashraf et al. [35] and Mahmood et al. [36] introduced spherical fuzzy sets with certain operational rules and aggregation operations based on Archimedean t-norm and t-conorms. SFS covers a wider area as compared to picture fuzzy set (PFS). Feng et al. [37] proposed new score functions of q-rung orthopair fuzzy sets for further utilization in decision analysis. Deveci et al. proposed the idea of personal mobility in metaverse with autonomous vehicles based on q-ROFs [38]. Riaz et al. [39] presented an application of bipolar fuzzy soft sets (BFSSs) to supply chain management.
Due to the sheer uncertainty and ambiguity of real-world circumstances, the approaches frequently employed in classical mathematics are not always suitable for solving real-world problems. Using a variety of multi-criteria decision-making (MCDM) techniques that analyse a collection of choices against a variety of methodologies, the reliability of human judgments can be determined [40]. Information aggregation and synthesis are fundamental to technological innovations such as deep learning, decision-making processes, remote sensing data, principal component analysis, and mathematical abilities. The process of combining individual preferences on a specific list of options into a single unified collective preference is an example of a type of MADM problem known as group decision-making. This type of MADM problem is typically thought of as the procedure by which group decision-making is carried out. The process of making decisions as a group involves the participation of multiple individuals, each of whom brings a unique set of skills, years of experience, and relevant information to bear on the analysis of the various facets of the issue. Multiple-Attribute Group Decision-Making (MAGDM) is the term used to describe this category of problems [41]. Several MADM algorithms have been changed to work with spherical fuzzy sets, and the applications of these changes have been examined in the literature. The conventional approach to decision analysis known as MCDM, utilises the linear assignment model (LAM) and the superiority and inferiority ranking (SIR) method in mPSFS to determine an order of liability for the causes of road accidents. In 1977, Bernardo and Blin [42] came up with the idea for what would become known as the linear assignment technique (LAM), which took its influence from an assignment problem in linear programming for MADM [43]. The fundamental concept behind the LAM is that the rankings of the criteria provide an overall preference ranking that, when combined with the other component rankings, results in the best possible compromise [44,45]. Many acandemics have extended LAM under a variety of fuzzy extensions and making use of a variety of modelling and solution methodologies to account for the unavoidable uncertainty that is inherent in real-life decision-making situations; several of these are mentioned in Table 2.
In a similar way, the SIR method has been used by a number of researchers in different fields of FSs. First, in 2001, Xu [55] gave a presentation on the approach known as the superiority and inferiority ranking (SIR). In the SIR method, the placement of the options is determined by two different segmentation overviews, which are as follows. In this method, the various options are ordered according to the predominance positioning arrangement as well as the inadequacy positioning arrangement. Notably, the major degree of latitude afforded by the use of the SIR method merges the characteristics of various other MCDM procedures. Numerous researchers have added their expertise using this method in various fields and domains, which are discussed in Table 3.
The following are the main objectives of the suggested framework:
  • Construction of the topological structure on mPSFFSs.
  • Analyzing the fundamental topology concepts of mPSF-open set, mPSF-closed set, mPSF-interior, mPSF-closure, mPSF-base, and mPSF-subbase, as well as their instances.
  • Introducing theorems and the proofs that support them in order to illustrate how mPSF-topology works;
  • Description of a case study entitled “Day by Day Increasing Road Accidents”.
  • As an expansion of MCDM, LAM is used to elaborate the application for finding the causes of road accidents.
  • The SIR framework is a well-known and frequently used MCDM technique that is useful for finding the rankings of similar applications in order to obtain precise results.
  • A comparison analysis is provided to conclude our work.
Recent developments in fuzzy techniques in decision-making include those proposed in [64,65,66,67,68]. Further details on group decision-making are discussed in [69,70].
The rest of the present paper is categorised in the following fashion across the remaining sections. Section 2 explores core mPSF principles. The most important findings of mPSF-Topology are outlined in Section 3. In Section 4, we demonstrate a SIR and LAM framework that is embedded inside the mPSFSs and has an application to vehicular mishaps. In Section 5, the most important results of the investigation are provided.

2. Preliminaries

In this section, we concisely review a few primary concepts related to different kinds of sets, including fuzzy sets, soft sets, spherical fuzzy sets and spherical fuzzy soft sets, that are employed during the rest of this paper.
Definition 1
([23]). Let ⨿ ˘ be a classical set and μ ˜ A : ⨿ ˘ [ 0 , 1 ] be the membership function. Then, a fuzzy set A can be written in the form
A = ( ⨿ ˘ , μ ˜ A ) = { ( ρ , μ ˜ A ( ρ ) ) : ρ X }
The value of the mapping μ ˜ A at ρ ⨿ ˘ i.e., μ ˜ A ( ρ ) denotes the degree of membership of ρ to fuzzy set A. The aggregate of all fuzzy sets in ⨿ ˘ is designated as F ( ⨿ ˘ ) .
Definition 2
([34,35,36]). Let U be the universe of discourse; then, a spherical fuzzy set (SFS) G ¯ U is an object with the form
G ¯ = ( ⨿ ˘ , μ ˜ ( ⨿ ˘ ) , γ ( ⨿ ˘ ) , η ˜ ( ⨿ ˘ ) ) : x U
G ¯ = ⨿ ˘ μ ˜ ( ⨿ ˘ ) , γ ( ⨿ ˘ ) , η ˜ ( x ) : ⨿ ˘ U
where μ ˜ ( ⨿ ˘ ) [ 0 , 1 ] is called the “degree of membership (MG) of ⨿ ˘ in U”, γ ( ⨿ ˘ ) [ 0 , 1 ] is called the “degree of hesitancy (HG) of ⨿ ˘ in U”, and η ˜ ( ⨿ ˘ ) [ 0 , 1 ] is called the “degree of non-membership (NMG) of ⨿ ˘ in U”; furthermore, μ ˜ ( ⨿ ˘ ) , γ ( x ) and η ˜ ( ⨿ ˘ ) satisfy the following condition:
μ ˜ 2 ( ⨿ ˘ ) + γ 2 ( x ⨿ ˘ + η ˜ 2 ( ⨿ ˘ ) ) 1 , ⨿ ˘ U
Then, for ⨿ ˘ U ,
π ( ⨿ ˘ ) = 1 μ ˜ 2 ( ⨿ ˘ ) γ 2 ( ⨿ ˘ ) η ˜ 2 ( ⨿ ˘ )
is called "refusal degree" of ⨿ ˘ U . A spherical fuzzy number ( S F N ) can be simply represented as
e = ( μ ˜ e , γ e , η ˜ e )
where ( μ ˜ e ) 2 + ( γ e ) 2 + ( η ˜ e ) 2 1
Definition 3.
Let U be a universal set of discourse. An m-polar fuzzy set on U is defined on interval [ 0 , 1 ] m and can be expressed as
M = ⨿ ˘ , μ ˜ i ( ⨿ ˘ ) i = 1 m : ⨿ ˘ U

3. m-Polar Spherical Fuzzy Set

Now we define m-polar spherical fuzzy sets (mPSFSs) as a hybrid structure comprised of both spherical fuzzy sets (SFS) and m-polar fuzzy sets (mPSFS). For m = 1 , an mPSFS turns into an SFS.
Definition 4.
A fuzzy S Γ ¯ defined on a universal set U of the following form is called an m-polar spherical fuzzy set (mPSFS)
S Γ ¯ = { < ( μ ˜ ( 1 ) ( ⨿ ˘ ) , γ ( 1 ) ( ⨿ ˘ ) , η ˜ ( 1 ) ( ⨿ ˘ ) ) , ( μ ˜ ( 2 ) ( ⨿ ˘ ) , γ ( 2 ) ( ⨿ ˘ ) , η ˜ ( 2 ) ( ⨿ ˘ ) ) , , ( μ ˜ ( m ) ( ⨿ ˘ ) , γ ( m ) ( ⨿ ˘ ) , η ˜ ( m ) ( ⨿ ˘ ) ) > : ⨿ ˘ U } = ⨿ ˘ , μ ˜ ( j ) ( ⨿ ˘ ) , γ ( j ) ( ⨿ ˘ ) , η ˜ ( j ) ( x ) j = 1 m : ⨿ ˘ U
where μ ˜ ( j ) : M [ 0 , 1 ] , γ ( j ) : M [ 0 , 1 ] , η ˜ ( j ) ) : M [ 0 , 1 ] represent the membership function (MF), hesitancy function (IF), and non-membership function (NMF), respectively, and the values μ ˜ ( j ) ( ⨿ ˘ ) , γ ( j ) ( x ⨿ ˘ , η ˜ ( j ) ( ⨿ ˘ ) [ 0 , 1 ] represent the membership grade (MG), hesitancy grade (HG), and non-membership grade (NMG), respectively, which satisfy the condition
0 μ ˜ ( j ) ( ⨿ ˘ ) 2 + γ ( j ) ( ⨿ ˘ ) 2 + η ˜ ( j ) ( ⨿ ˘ ) 2 1 .
The refusal degree is R = 1 μ ˜ ( j ) ( ⨿ ˘ ) 2 γ ( j ) ( ⨿ ˘ ) 2 η ˜ ( j ) ( ⨿ ˘ ) 2 , j = 1, 2, 3, …, m.
An m-polar spherical fuzzy number (mPSFN) can be written as
N = ( μ ˜ ( 1 ) ( x ) , γ ( 1 ) ( x ) , η ˜ ( 1 ) ( x ) ) , ( μ ˜ ( 2 ) ( x ) , γ ( 2 ) ( x ) , η ˜ ( 2 ) ( x ) ) , , ( μ ˜ ( m ) ( x ) , γ ( m ) ( x ) , η ˜ ( m ) ( x ) ) = ( μ ˜ ( j ) ( ⨿ ˘ ) , γ ( j ) ( x ) , η ˜ ( j ) ( x ) j = 1 m
with the constraint
0 μ ˜ ( j ) ( ⨿ ˘ ) 2 + γ ( j ) ( ⨿ ˘ ) 2 + η ˜ ( j ) ( ⨿ ˘ ) 2 1
For a fixed ⨿ ˘ , N = ( μ ˜ ( 1 ) , γ ( 1 ) , η ˜ ( 1 ) ) , ( μ ˜ ( 2 ) , γ ( 2 ) , η ˜ ( 2 ) ) , , ( μ ˜ ( m ) , γ ( m ) , η ˜ ( m ) ) is called m-polar spherical fuzzy number (mPSFN).
Tabular representation of (mPSFS) with cardinality K is expressed in Table 4.
And matrix representation of m-polar spherical fuzzy set(mPSFS) is
S Γ ¯ k , m = μ ˜ ( 1 ) ( ⨿ ˘ 1 ) , γ ( 1 ) ( ⨿ ˘ 1 ) , η ˜ ( 1 ) ( ⨿ ˘ 1 ) , μ ˜ ( 2 ) ( ⨿ ˘ 1 ) , γ ( 2 ) ( ⨿ ˘ 1 ) , η ˜ ( 2 ) ( ⨿ ˘ 1 ) , μ ˜ ( m ) ( ⨿ ˘ 1 ) , γ ( m ) ( ⨿ ˘ 1 ) , η ˜ ( m ) ( ⨿ ˘ 1 ) μ ˜ ( 1 ) ( ⨿ ˘ 2 ) , γ ( 1 ) ( ⨿ ˘ 2 ) , η ˜ ( 1 ) ( ⨿ ˘ 2 ) , μ ˜ ( 2 ) ( ⨿ ˘ 2 ) , γ ( 2 ) ( ⨿ ˘ 2 ) , η ˜ ( 2 ) ( ⨿ ˘ 2 ) , μ ˜ ( m ) ( ⨿ ˘ 2 ) , γ ( m ) ( ⨿ ˘ 2 ) , η ˜ ( m ) ( ⨿ ˘ 2 ) μ ˜ ( 1 ) ( ⨿ ˘ 3 ) , γ ( 1 ) ( ⨿ ˘ 3 ) , η ˜ ( 1 ) ( ⨿ ˘ 3 ) , μ ˜ ( 2 ) ( ⨿ ˘ 3 ) , γ ( 2 ) ( ⨿ ˘ 3 ) , η ˜ ( 2 ) ( ⨿ ˘ 3 ) , μ ˜ ( m ) ( ⨿ ˘ 3 ) , γ ( m ) ( ⨿ ˘ 3 ) , η ˜ ( m ) ( ⨿ ˘ 3 ) μ ˜ ( 1 ) ( ⨿ ˘ k ) , γ ( 1 ) ( ⨿ ˘ k ) , η ˜ ( 1 ) ( ⨿ ˘ k ) , μ ˜ ( 2 ) ( ⨿ ˘ k ) , γ ( 2 ) ( ⨿ ˘ k ) , η ˜ ( 2 ) ( ⨿ ˘ k ) , μ ˜ ( m ) ( ⨿ ˘ k ) , γ ( m ) ( ⨿ ˘ k ) , η ˜ ( m ) ( ⨿ ˘ k )
Example 1.
Let M = { ⨿ ˘ 1 , ⨿ ˘ 2 , ⨿ ˘ 3 } be the set of vehicles. Then, 5PSFS in M is expressed in Table 5.
In 5PSFS, each vehicle namely, ⨿ ˘ 1 , ⨿ ˘ 2 , and ⨿ ˘ 3 is examined under 5 attributes ( j = 1 , 2 , 3 , 4 , 5 ) , and evaluated in terms of mPSFNs. From the first row of the table, the first triplet 0.389 , 0.175 , 0.412 shows that vehicle ⨿ ˘ 1 has a 38.9% membership grade, 17.5% hesitancy grade, and 41.2% non-membership grade for the first attribute. Similarly, we may see the additional values that relate to each attribute.
Definition 5.
Let S Γ ¯ A and S Γ ¯ B be two mPSFSs. Then,
  • S Γ ¯ A S Γ ¯ B = x , max μ ˜ A ( j ) ( ⨿ ˘ ) , μ ˜ B ( j ) ( ⨿ ˘ ) , min γ A ( j ) ( ⨿ ˘ ) , γ B ( j ) ( ⨿ ˘ ) , min η ˜ A ( j ) ( ⨿ ˘ ) , η ˜ B ( j ) ( ⨿ ˘ ) j = 1 m : ⨿ ˘ U
  • S Γ ¯ A S Γ ¯ B = ⨿ ˘ , min μ ˜ A ( j ) ( ⨿ ˘ ) , μ ˜ B ( j ) ( ⨿ ˘ ) , max γ A ( j ) ( ⨿ ˘ ) , γ B ( j ) ( ⨿ ˘ ) , max η ˜ A ( j ) ( ⨿ ˘ ) , η ˜ B ( j ) ( ⨿ ˘ ) j = 1 m : ⨿ ˘ U
  • S Γ ¯ A S Γ ¯ B i f f μ ˜ A ( j ) ( ⨿ ˘ ) μ ˜ B ( j ) ( ⨿ ˘ ) , γ A ( j ) ( ⨿ ˘ ) γ B ( j ) ( ⨿ ˘ ) , η ˜ A ( j ) ( ⨿ ˘ ) η ˜ B ( j ) ( ⨿ ˘ ) , ⨿ ˘ U , j = 1 , 2 , 3 , . . . , m
  • S Γ ¯ A S Γ ¯ B i f f S Γ ¯ A S Γ ¯ B a n d S Γ ¯ A S Γ ¯ B
  • S Γ ¯ A c = ⨿ ˘ , η ˜ A ( j ) ( ⨿ ˘ ) , γ A ( j ) ( ⨿ ˘ ) , μ ˜ A ( j ) ( ⨿ ˘ ) j = 1 m : x U
  • S Γ ¯ A S Γ ¯ B = ⨿ ˘ , ( μ ˜ A ( j ) ( ⨿ ˘ ) ) 2 + ( μ ˜ B ( j ) ( ⨿ ˘ ) ) 2 ( μ ˜ A ( j ) ( ⨿ ˘ ) ) 2 ( μ ˜ B ( j ) ( ⨿ ˘ ) ) 2 ) 1 / 2 , ( 1 ( μ ˜ B ( j ) ( ⨿ ˘ ) ) 2 ) ( γ A ( j ) ( ⨿ ˘ ) ) 2 + ( 1 ( μ ˜ A ( j ) ( ⨿ ˘ ) ) 2 ) ( γ B ( j ) ( ⨿ ˘ ) ) 2 ( γ A ( j ) ( ⨿ ˘ ) ) 2 ( γ B ( j ) ( ⨿ ˘ ) ) 2 1 / 2 , η ˜ A ( j ) ( x ⨿ ˘ ) η ˜ B ( j ) ( ⨿ ˘ ) j = 1 m : x U
  • S Γ ¯ A S Γ ¯ B = x , μ ˜ A ( j ) ( x ) μ ˜ B ( j ) ( x ) , ( 1 ( η ˜ B ( j ) ( ⨿ ˘ ) ) 2 ) ( γ A ( j ) ( ⨿ ˘ ) ) 2 + ( 1 ( η ˜ A ( j ) ( ⨿ ˘ ) ) 2 ) ( γ B ( j ) ( ⨿ ˘ ) ) 2 ( γ A ( j ) ( ⨿ ˘ ) ) 2 ( γ B ( j ) ( ⨿ ˘ ) ) 2 1 / 2 , ( η ˜ A ( j ) ( ⨿ ˘ ) ) 2 + ( η ˜ B ( j ) ( ⨿ ˘ ) ) 2 ( η ˜ A ( j ) ( ⨿ ˘ ) ) 2 ( η ˜ B ( j ) ( ⨿ ˘ ) ) 2 1 / 2 j = 1 m : ⨿ ˘ U
  • λ S Γ ¯ A = ⨿ ˘ , 1 1 ( μ ˜ A ( j ) ( ⨿ ˘ ) ) 2 λ 1 / 2 , 1 μ ˜ A ( j ) ( ⨿ ˘ ) ) 2 λ 1 ( μ ˜ A ( j ) ( ⨿ ˘ ) ) 2 ( γ A ( j ) ( ⨿ ˘ ) ) 2 λ 1 / 2 , ( η ˜ A ( j ) ( ⨿ ˘ ) ) λ j = 1 m : x U , λ > 0
  • S Γ ¯ A λ = { x , ( μ ˜ A ( j ) ( ⨿ ˘ ) ) λ , ( 1 ( η ˜ A ( j ) ( ⨿ ˘ ) ) 2 ) λ 1 ( η ˜ A ( j ) ( ⨿ ˘ ) ) 2 ( γ A ( j ) ( ⨿ ˘ ) ) 2 λ 1 / 2 , 1 1 ( η ˜ A ( j ) ( ⨿ ˘ ) ) 2 λ 1 / 2 j = 1 m : U } , λ > 0
Example 2.
Let M = { ⨿ ˘ 1 , ⨿ ˘ 2 , ⨿ ˘ 1 · , ⨿ ˘ 2 · } and let S Γ ¯ A and S Γ ¯ B be two 5PSFSs defined as shown in the Table 6 and Table 7, respectively.
Then, union S Γ ¯ A S Γ ¯ B of S Γ ¯ A and S Γ ¯ B can be defined as shown in the Table 8.
Then, intersection S Γ ¯ A S Γ ¯ B of S Γ ¯ A and S Γ ¯ B can be defined as shown in the Table 9.
And the complement of S Γ ¯ A c can be calculated as shown in the Table 10.
Definition 6.
The score function for any m P S F N e = ( μ ˜ e ( j ) , γ e ( j ) , η ˜ e ( j ) ) , j = 1, 2, 3, …, m is defined as
s ( e ) = 1 m j = 1 m μ ˜ p ( j ) 2 γ p ( j ) 2 η ˜ p ( j ) 2
where 1 s ( e ) 1 . If e i and e j are two spherical fuzzy numbers, then
  • Given s ( e i ) < s ( e j ) , e i precedes e j i.e., e i e j ,
  • Given s ( e i ) > s ( e j ) , e i succeeds e j i.e., e i e j ,
  • Given s ( e i ) = s ( e j ) , e i e j .
Definition 7. 
The accuracy function for any S F N e = ( μ ˜ e ( j ) , γ e ( j ) , η ˜ e ( j ) ) , j = 1, 2, 3, …, m is defined as
a ( e ) = 1 m j = 1 m μ ˜ p ( j ) 2 + γ p ( j ) 2 + η ˜ p ( j ) 2
where 0 s ( e ) 1 . If e i and e j are two spherical fuzzy numbers, then
  • If s ( e i ) and s ( e j ) coincide and a ( e i ) exceeds a ( e j ) , then e i e j ,
  • If both s ( e i ) , s ( e j ) and a ( e i ) , a ( e j ) coincide, then e i e j
Definition 8.
An m-PSFS is said to be an empty or null m-PSFS if μ ˜ ( j ) ( x ) = 0 ,   γ ( j ) ( x ) = k and η ˜ ( j ) ( x ) = 1 k for all j = 1 , 2 , 3 , m and 0 k 1 . It is denoted as ¯ ¯ and scripted as
¯ ¯ = { x , ( ( 0 , k , 1 k ) , ( 0 , k , 1 k ) , , ( 0 , k , 1 k ) ) : 0 k 1 & x U }
Its matrix representation is
¯ ¯ = ( 0 , k , 1 k ) ( 0 , k , 1 k ) ( 0 , k , 1 k ) ( 0 , k , 1 k ) ( 0 , k , 1 k ) ( 0 , k , 1 k ) ( 0 , k , 1 k ) ( 0 , k , 1 k ) ( 0 , k , 1 k )
Definition 9.
An m-PSFS is said to be an absolute m-PSFS if μ ˜ ( j ) ( x ) = 1 k , π ( j ) ( x ) = k and v ( j ) ( x ) = 0 for all j = 1 , 2 , 3 , m and 0 k 1 . It is denoted as X ¯ and scripted as
X ¯ = { x , ( ( 1 k , k , 0 ) , ( 1 k , k , 0 ) , , ( 1 k , k , 0 ) ) : 0 k 1 & x U }
Its matrix representation is
X ¯ = ( 1 k , k , 0 ) ( 1 k , k , 0 ) ( 1 k , k , 0 ) ( 1 k , k , 0 ) ( 1 k , k , 0 ) ( 1 k , k , 0 ) ( 1 k , k , 0 ) ( 1 k , k , 0 ) ( 1 k , k , 0 )

4. m-Polar Spherical Fuzzy Topology

This section describes the idea of mPSF-topology in relation to a mPSF set. The concepts of mPSF-union and mPSF-intersection are used as building blocks while designing mPSF topology. Several elements of the mPSF-topology are defined, and the accompanying illustrations are presented in an optimized way.
Definition 10.
Assume X Γ is a set which is non-empty and mPSFS( X Γ ) is the collection of all the mPSF-subsets. A sub-collection T Ω of mPSFS( X Γ ) is called m-polar Spherical fuzzy topology (mPSFT) on X Γ if the following properties hold true:
(i)
¯ ¯ , X Γ T Ω
(ii)
T Ω is closed under arbitrary union, i.e., if S Γ ¯ q T Ω , q Q , then q Q S Γ ¯ q T Ω .
(iii)
T Ω is closed under finite intersection, i.e., if S Γ ¯ μ ˜ , S Γ ¯ η ˜ T Ω , then S Γ ¯ μ ˜ S Γ ¯ η ˜ T Ω .
The couplet ( X , T Ω ), or simply T Ω , is known as m-polar spherical fuzzy topological space, shortened as mPSFTS.
Example 3.
Let X ¯ = { ⨿ ˘ 1 , ⨿ ˘ 2 , ⨿ ˘ 3 } be a universal set and S 1 , S 2 , and S 3 be as shown in Table 11, Table 12 and Table 13 below
Then T 1 Ω = { ¯ ¯ , X ¯ } , T 2 Ω = { ¯ ¯ , S 1 , X ¯ } , T 3 Ω = { ¯ ¯ , S 2 , X ¯ } , T 4 Ω = { ¯ ¯ , S 3 , X ¯ } , T 5 Ω = { ¯ ¯ , S 1 , S 2 , X ¯ } , T 6 Ω = { ¯ ¯ , S 1 , S 3 , X ¯ } , T 7 Ω = { ¯ ¯ , S 2 , S 3 , X ¯ } , and T 8 Ω = { ¯ ¯ , S 1 , S 2 , S 3 , X ¯ } all are 4-PSFTS over X ¯ . The components ¯ ¯ and X ¯ in all these topologies are both 4-polar spherical fuzzy open and closed sets.
Definition 11.
Let T 1 Ω and T 2 Ω be two mPSF-topologies over X. If every member of T 1 Ω is also a member of T 2 Ω , i.e., T 1 Ω T 2 Ω , then T 1 Ω and T 2 Ω are comparable. In such situations, T 1 Ω is purported to be coarser or weaker than T 2 Ω and T 2 Ω is purported to be finer or stronger than T 1 Ω . In Example 3, T 3 Ω is coarser than T 2 Ω , and hence these are comparable.
Remark 1.
The mPSFTS intersection is always an mPSFTS, however, its union does not have to be an mPSFTS.
Example 4.
Let X= { ⨿ ˘ 1 , ⨿ ˘ 2 } be the universal set and S Γ ¯ 1 and S Γ ¯ 2 be 3PSFSs as provided below in Table 14 and Table 15,
Then,
T 1 Ω = { ¯ ¯ , S Γ ¯ 1 , X ¯ } ,
T 2 Ω = { ¯ ¯ , S Γ ¯ 2 , X ¯ }
are 4PSF topologies over X. However,
T 1 Ω T 2 Ω = { ¯ ¯ , S Γ ¯ 1 , S Γ ¯ 2 , X ¯ }
fails to be a 4PSFT over X.
Theorem 1.
Let ( X , T Ω ) be m-polar spherical fuzzy topological spaces. Then, the following conditions are satisfied:
(i)
¯ ¯ , X ¯ are closed.
(ii)
T Ω is closed under an arbitrary intersection of closed mPSFSs.
(iii)
T Ω is closed under a finite number of unions of closed mPSFSs.
Proof. 
(i)
¯ ¯ c = X ¯ and X ¯ c = ¯ ¯ both are open and closed mPSFSs.
(ii)
If { S Γ ¯ q : S Γ ¯ q c T Ω , q Q } is the collection of all closed mPSFSs, then
q Q S Γ ¯ q c = q Q S Γ ¯ q c
is open. This shows that q Q S Γ ¯ q is a closed mPSFS.
(iii)
Because S Γ ¯ q is closed for q = 1, 2, 3, …, n,
q = 1 n S Γ ¯ q c = q = 1 n S Γ ¯ q c
is an open mPSFS. Thus, q = 1 n S Γ ¯ q is a closed mPSFS.
Definition 12.
Let (X, T Ω ) be an mPSFTS and Y X and Y ¯ be an absolute m P S F S on Y . Then T Ω Y is an mPSF topology on Y with mPSF open sets as S Γ ¯ Y = S Γ ¯ X Y ¯ , where S Γ ¯ X are mPSF open sets of T X Ω and S Γ ¯ Y are mPSF open sets of T Y Ω . Then, Y ¯ is termed the mPSF-subspace of X ¯ , i.e.,
T Y Ω = { S Γ ¯ Y : S Γ ¯ Y = S Γ ¯ X Y ¯ , S Γ ¯ X T X Ω } ,
with T Y Ω also known as the relative mPSF topology or induced mPSF topology on Y .
Example 5.
Suppose that X= { ⨿ ˘ 1 , ⨿ ˘ 2 , ⨿ ˘ 3 } is the universal set. If 4-polar spherical fuzzy set S Γ ¯ 1 and S Γ ¯ 2 are defined as in the Table 16 and Table 17, respectively.
then
T X Ω = { ¯ ¯ , S Γ ¯ 1 , S Γ ¯ 2 , X ¯ }
is a 4PSF topology on X.
Now, let the absolute 4PSF on Y = { ⨿ ˘ 1 , ⨿ ˘ 3 } X be is shown in the Table 18. Working is shown in Table 19 and Table 20.
Because Y ¯ ¯ ¯ = ¯ ¯ ˜ . Furthermore,
and Y ¯ X = Y ¯ .
Thus, T Y Ω = { ¯ ¯ ˜ , S Γ ¯ 1 , S Γ ¯ 2 , X ¯ } is a 4PSF sub-topology of T X Ω .
Definition 13.
Let (X, T Ω ) be an mPSFTS and S Γ ¯ m P S F S ( X ) ; then, the interior of S Γ ¯ is indicated as S Γ ¯ and described as the union of all open mPSF subsets included in S Γ ¯ . Alternatively, it can be defined as the largest open mPSFS that includes S Γ ¯ .
Example 6.
Let X= { ⨿ ˘ 1 , ⨿ ˘ 2 , ⨿ ˘ 3 } . Let us consider 4PSFSs S Γ ¯ 1 and S Γ ¯ 2 in X such that T Ω = { ¯ ¯ , S 1 , S 2 , X ¯ } is the topology on X. S Γ ¯ 1 is given in Table 21, S Γ ¯ 2 is given in Table 22 and S Γ ¯ is given in Table 23. Then,
Consider S Γ ¯ as
Then, the 4PSF interior of S Γ ¯ is
S Γ ¯ = ¯ ¯ S Γ ¯ 1 = S Γ ¯ 1
Theorem 2.
Let (X, T Ω ) be an mPSFTS and let S Γ ¯ m P S F S ( X ) .
Then, S Γ ¯ is open mPSFS S Γ ¯ = S Γ ¯ .
Proof. 
If S Γ ¯ = S Γ ¯ , then S Γ ¯ is an open mPSFS. This means that S Γ ¯ is an open mPSFS.
Conversely, if S Γ ¯ is an open mPSFS, then the largest open mPSFS included in S Γ ¯ is itself S Γ ¯ . Thus, S Γ ¯ = S Γ ¯ . □
Theorem 3.
Let (X, T Ω ) be an mPSFTS and let S Γ ¯ , S Γ ¯ 1 , and S Γ ¯ 2 mPSFS(X). Then, the following results hold:
(i)
( S Γ ¯ ) = S Γ ¯
(ii)
S Γ ¯ 1 S Γ ¯ 2 S Γ ¯ 1 S Γ ¯ 2
(iii)
( S Γ ¯ 1 S Γ ¯ 2 ) = S Γ ¯ 1 S Γ ¯ 2
(iv)
( S Γ ¯ 1 S Γ ¯ 2 ) S Γ ¯ 1 S Γ ¯ 2
Definition 14.
Let (X, T Ω ) be an mPSFTS and let S Γ ¯ mPSFS(X); then, closure of S Γ ¯ is indicated as S Γ ¯ cl and is described as the intersection of all closed mPSF supersets of S Γ ¯ ; it can also be defined as the smallest closed mPSFS of S Γ ¯ .
Example 7.
Let X= { ⨿ ˘ 1 , ⨿ ˘ 2 , ⨿ ˘ 3 } be a 4PSFTS. Let us consider 4PSFSs S Γ ¯ 1 and S Γ ¯ 2 of X as provided in Example 6. These 4PSFSs are open in 4PSFTS given in Table 24 and Table 25. Then, their corresponding 4PSF closed sets is given in Table 26.
Consider S Γ ¯ as
Then, the 4PSF closure of S Γ ¯ is
S Γ ¯ cl = X ¯ S Γ ¯ 2 c = S Γ ¯ 2 c .
Theorem 4.
Let (X, T Ω ) be an mPSFTS and let S Γ ¯ , S Γ ¯ 1 , and S Γ ¯ 2 mPSFS(X). Then, the following results hold:
(i)
S Γ ¯ cl ¯ = S Γ ¯ cl
(ii)
S Γ ¯ 1 S Γ ¯ 2 S Γ ¯ 1 cl S Γ ¯ 2 cl
(iii)
( S Γ ¯ 1 cl S Γ ¯ 2 ) = S Γ ¯ 1 cl S Γ ¯ 2 cl
(iv)
S Γ ¯ 1 cl S Γ ¯ 2 S Γ ¯ 1 cl S Γ ¯ 2 cl
Theorem 5.
Let (X, T Ω ) be an mPSFTS and let S Γ ¯ m P S F S ( X ) . Then,
(i)
( S Γ ¯ ) c = ( S Γ ¯ c ) cl
(ii)
( S Γ ¯ cl ) c = ( S Γ ¯ c ) .
Proof. 
(i) Let S Γ ¯ = x , μ ˜ ( j ) ( x ) , γ ( j ) ( x ) , η ˜ ( j ) ( x ) j = 1 m : x X be an mPSFS in X.
Suppose that the collection of all open sets in (X, T Ω ) which are contained in the set S Γ ¯ is provided by
O ˙ i = ⨿ ˘ , μ ˜ i ( j ) ( ⨿ ˘ ) , γ i ( j ) ( x ) , η ˜ i ( j ) ( ⨿ ˘ ) j = 1 m : ⨿ ˘ X , w h e r e i I .
Now, the interior of S Γ ¯ is provided by
S Γ ¯ = ⨿ ˘ , m a ⨿ ˘ i I μ ˜ i ( j ) ( ⨿ ˘ ) , m i n i I γ i ( j ) ( ⨿ ˘ ) , m i n i I η ˜ i ( j ) ( ⨿ ˘ ) j = 1 m : ⨿ ˘ X
and
( S Γ ¯ ) c = ⨿ ˘ , m i n i I η ˜ i ( j ) ( ⨿ ˘ ) , m i n i I γ i ( j ) ( ⨿ ˘ ) , m a ⨿ ˘ i I μ ˜ i ( j ) ( ⨿ ˘ ) j = 1 m : x X .
Now, let S Γ ¯ c = ⨿ ˘ , η ˜ ( j ) ( ⨿ ˘ ) , γ ( j ) ⨿ ˘ ⨿ ˘ ) , μ ˜ ( j ) ( x ) j = 1 m : ⨿ ˘ ⨿ ˘ be all possible closed sets in ( ⨿ ˘ , T Ω ) which contain S Γ ¯ , as provided by
O ˙ i c = ⨿ ˘ , η ˜ i ( j ) ( ⨿ ˘ ) , γ i ( j ) ( ⨿ ˘ ) , μ ˜ i ( j ) ( ⨿ ˘ ) j = 1 m : ⨿ ˘ ⨿ ˘ , w h e r e i I .
Therefore,
( S Γ ¯ c ) cl = ⨿ ˘ , m i n i I η ˜ i ( j ) ( ⨿ ˘ ) , m i n i I γ i ( j ) ( ⨿ ˘ ) , m a ⨿ ˘ i I μ ˜ i ( j ) ( ⨿ ˘ ) j = 1 m : ⨿ ˘ X
Hence, ( S Γ ¯ ) c = ( S Γ ¯ c ) cl .
Now, we must verify that ( S Γ ¯ ) c and ( S Γ ¯ c ) cl are mPSFS.
For this purpose, assume that m a ⨿ ˘ i I μ ˜ i ( j ) ( ⨿ ˘ ) = μ ˜ k ( j ) ( ⨿ ˘ ) for some k I .
Now, consider
m i n i I η ˜ i ( j ) ( x ) 2 + m i n i I γ i ( j ) ( x ) 2 + m a ⨿ ˘ i I μ ˜ i ( j ) ( x ) 2
= m i n i I η ˜ i ( j ) ( x ) 2 + m i n i I γ i ( j ) ( x ) 2 + μ ˜ k ( j ) ( x ) 2
η ˜ k ( j ) ( x ) 2 + γ k ( j ) ( x ) 2 + μ ˜ k ( j ) ( x ) 2
μ ˜ k ( j ) ( x ) 2 + γ k ( j ) ( x ) 2 + η ˜ k ( j ) ( x ) 2
1 , as O ˙ k is an mPSFS.
Hence, ( S Γ ¯ ) c and ( S Γ ¯ c ) cl both lie in the mPSF domain.
We can prove (ii) in a similar way. □
Proposition 1.
Let (X, T Ω ) be an mPSFTS and let S Γ ¯ m P S F S ( X ) . Then,
(i)
¯ ¯ ¯ = ¯ ¯
(ii)
X ¯ = X ¯
(iii)
S Γ ¯ S Γ ¯ S Γ ¯ cl .
Definition 15.
Let (X, T Ω ) be an mPSFTS and let S Γ ¯ m P S F S ( X ) . Then, the frontier of S Γ ¯ is indicated as Fr ( S Γ ¯ ) , and is described as
Fr ( S Γ ¯ ) = S Γ ¯ cl ( S Γ ¯ c ) cl .
Definition 16.
Let (X, T Ω ) be an mPSFTS and let S Γ ¯ m P S F S ( X ) . Then, the exterior of S Γ ¯ is indicated as Ext ( S Γ ¯ ) and is described as
Ext ( S Γ ¯ ) = ( S Γ ¯ c ) .
Example 8.
In Example 7, the frontier of S Γ ¯ is provided as follows:
Fr ( S Γ ¯ ) = S Γ ¯ cl ( S Γ ¯ c ) cl = ( S Γ ¯ 2 ) c X ˜ = ( S Γ ¯ 2 ) c
and the exterior as Ext ( S Γ ¯ ) = ( S Γ ¯ c ) = ¯ ¯ .
Proposition 2.
Let (X, T Ω ) be an mPSFTS and let S Γ ¯ m P S F S ( X ) ; then, Fr ( S Γ ¯ ) = Fr ( S Γ ¯ c ) .
Proof. 
By definition,
Fr ( S Γ ¯ ) = S Γ ¯ cl ( S Γ ¯ c ) cl = ( S Γ ¯ c ) cl S Γ ¯ cl = ( S Γ ¯ c ) cl ( S Γ ¯ c ) c cl = Fr ( S Γ ¯ c ) .
Proposition 3.
Let (X, T Ω ) be an mPSFTS and let S Γ ¯ m P S F S ( X ) ; then,
(i)
Ext ( S Γ ¯ c ) = S Γ ¯
(ii)
Ext ( S Γ ¯ ) Fr ( S Γ ¯ ) S Γ ¯ X ¯
(iii)
S Γ ¯ Fr ( S Γ ¯ ) ¯ ¯ .

5. Multi-Criteria Group Decision Making by m-PSF Topology

Choice-making occurs in trading, business, and sciences, and often faces huge challenges. It differentiates between a minimal regime’s constant operational analyses and leaders’ extensive formulation and management. While collected data can be analyzed to reach inferences that can have major or unfavorable implications, ultimately officials must show a logical operational strategy for winning.
Before reaching a choice, decision-makers should assess a wide range of factors. Consequently, while coming to a conclusion, it is imperative that all of these variables are factored into the equation. In legal terms, a systematic approach to decision-making is essential to guarantee that all of the key data and information are properly considered.
Among several other methods, mathematics can assists in reaching conclusions based on the evidence provided by science. This excerpt provides an illustration of a strategy for handling the problem of multiple criterion group decision-making by employing the superiority inferiority ranking (SIR) and linear assignment model (LAM) within an mPSF framework.
MCDM with SIR method.
The essential steps for the extended SIR approach for mPSFS are outlined below.
1:
Determine the individual measure degree k ( k = 1 , 2 , . . . , l ) , then obtain the relative closeness coefficient using the formula provided below:
k = d W d k , W D R d W d k , W D R + d W d k , W D R +
where W D R and W D R + denote the relative minimum and relative maxima, respectively, and can be calculated as follows:
W D R = ( min { μ ˜ k } , max { γ k } , max { η ˜ k } )
W D R + = ( max { μ ˜ k } , min { γ k } , min { η ˜ k } )
2:
Normalize k ( k = 1 , 2 , . . . , l ) using the formula
W k ¯ = k k = 1 l k
and denote them as an individual measure degree by
W ¯ = w 1 ¯ , w 2 ¯ , , w n ¯
3:
Acquire the amalgamated mPSF decision matrix and weight vector utilizing the mPSF operator to class individual viewpoints together into an aggregated frame of reference.
  • the mPSFWAM aggregation operator for integrating individual decision matrices is
    m P S F W A M ( k i j ( 1 ) , k i j ( 2 ) , . . . , k i j ( l ) ) = k = 1 l w ¯ k k i j ( l )
    = { 1 k = 1 l ( 1 μ ˜ ( i ) 2 ( x ) ) w ¯ k , k = 1 l ( 1 μ ˜ ( i ) 2 ( x ) ) w ¯ k k = 1 l ( 1 μ ˜ ( i ) 2 ( x ) η ˜ ( i ) 2 ( x ) ) w ¯ k , k = 1 l γ ( i ) w ¯ k ( x ) , } i = 1 m
  • the mPSFWAM aggregation operator for integrating th weights of individual attributes is
    m P S F W A M ( ϖ j ( 1 ) , ϖ j ( 2 ) , . . . , ϖ j ( l ) ) = k = 1 l w ¯ k ϖ j ( l )
    = { 1 k = 1 l ( 1 μ ˜ ( i ) 2 ( x ) ) w ¯ k , k = 1 l ( 1 μ ˜ ( i ) 2 ( x ) ) w ¯ k k = 1 l ( 1 μ ˜ ( i ) 2 ( x ) η ˜ ( i ) 2 ( x ) ) w ¯ k , k = 1 l γ ( i ) w ¯ k ( x ) , } i = 1 m
4:
Build a performance relationship based on relative performance using the formula
f α β = d P α β , P d P α β , P + d P α β , P + ,
the superiority matrix
S α β = t = 1 m F f α β f t β ,
and the inferiority matrix
I α β = t = 1 m F f t β F α β .
Activate where F P K = 0.01 if 0 P κ 1 and F P κ = 0 if 0 P κ or P κ 1
5:
Compute the superiority and inferiority indexes as follows:
ϝ P α κ = β = 1 n S α β w β ¯ ϝ γ P α κ = β = 1 n I α β w β ¯
6:
Determine score functions of ϝ P α κ and ϝ γ P α κ .
7:
By following the rules below, determine the flow of superiority and inferiority.
Superiority flow rules (SFRs):
  • P α κ > P t κ if S ( ϝ ( P α κ ) < S ( ϝ ( P t κ ) ) and S ( ϝ γ ( P α κ ) ) > S ( ϝ γ ( P t κ ) )
  • P α κ > P t κ if S ( ϝ ( P α κ ) < S ( ϝ ( P t κ ) ) and S ( ϝ γ ( P α κ ) ) = S ( ϝ γ ( P t κ ) )
  • P α κ > P t κ if S ( ϝ ( P α κ ) = S ( ϝ ( P t κ ) ) and S ( ϝ γ ( P α κ ) ) > S ( ϝ γ ( P t κ ) )
Inferiority flow rules (IFRs):
  • P α κ < P t κ if S ( ϝ ( P α κ ) > S ( ϝ ( P t κ ) ) and S ( ϝ γ ( P α κ ) ) < S ( ϝ γ ( P t κ ) )
  • P α κ < P t κ if S ( ϝ ( P α κ ) > S ( ϝ ( P t κ ) ) and S ( ϝ γ ( P α κ ) ) = S ( ϝ γ ( P t κ ) )
  • P α κ < P t κ if S ( ϝ ( P α κ ) = S ( ϝ ( P t κ ) ) and S ( ϝ γ ( P α κ ) ) < S ( ϝ γ ( P t κ ) )
8:
Obtain the best possible outcome by coupling SFRs and IFRs next to each other
MCDM with LAM.
On the basis of attributes and structures, the classical linear assignment method (LAM) can be extended to mPSFs. The following algorithm explains the numerous processes that form the proposed mPSFLAM.
1:
Take into account the scores and alternative weights of decision-makers.
2:
Aggregate the score matrices and weights of decision-makers.
3:
Compute the score values of the aggregated decision matrix.
4:
Determine the rank frequency non-negative matrix Υ k i
5:
Establish a weighted rank frequency , where the k i receives the alternative contribution to the total ranking. The value is
k i = w i 1 + w i 2 + w i 3 + . + w i Υ k i
6:
Calculate P = ( k i ) . The LAM can be expressed in a linear programming format, as mentioned below:
i = 1 m i = 1 m k i P k i
such that
i = 1 m P k i = 1 k = 1 m P k i = 1 P k i = 0 or P k i = 1
7:
Find the best possible answer by working through the linear assignment model and analyzing it.
8:
Rank the optimal alternatives.

6. Case Study

Numerous kinds of vehicles, including automobiles, buses, tractors, motorcycles, mopeds, pedestrians, animals, taxis, and others, use roads throughout the world. The invention of the vehicle is directly responsible for the growth of many nations’ economies and social structures. Nonetheless, every year, millions of people are killed and wounded in vehicle-related incidents. Each year, 1.35 million people are killed on the roads and highways of the world. Every day, more than 3700 people are killed in accidents involving cars, buses, motorcycles, bicycles, lorries, and pedestrians around the globe. More than half of those killed are cyclists, pedestrians, or motorcyclists. Gopalakrishnan has presented these statistics in [71]. According to estimates, crash-related injuries are the eighth-leading cause of death around the globe for people of all ages. Today, automotive accidents kill more people than HIV/AIDS. The global death toll is depicted in Figure 1.
Transportation system quality is one of the key indicators of the standard of living. The transportation system is essential to human survival. Automobile crashes are a major worry, as they risk people’s lives, health, and property. In addition, the management of the transportation system may be compromised by road mishaps. Due to the dangerous nature of this system, it might not be able to work properly. Therefore, traffic accident prediction models may be useful for comprehending the elements that lead to accidents as well as their frequency under different conditions.
Accidents are the largest cause of injury and death worldwide, and as a result, they contribute to a vast array of social and economic problems. Here, we use Albania as a case study for the creation of a fuzzy model for accident prediction. The conditions of the road and the flow of traffic are two major contributors to road accidents. It is feasible to reduce the number of accidents by investigating these factors. Research on road safety has revealed the accuracy of collision prediction models.
Accidents on the road are the leading cause of hospitalisation for teenagers; drivers between the ages of 18 and 24 account for 23% of all fatalities resulting from automotive accidents. Similar to the incidence rate, the recurrence rate is rather high. Following an initial accident, one in every four teenagers goes on to experience a recurrence during the subsequent year. Cognitive deficiencies are known to be present in teenagers, and can be a contributing factor in the development of risky behaviours. Risky behaviours are defined as repeated engagement in potentially dangerous situations, such as getting into vehicle accidents. There are two distinct groups of factors that appear to be linked to road accidents: (1) characteristics that are unique to the environment in which the accident occurred and (2) “human” factors, which appear to be the most significant of the two. Both of these groups of factors are discussed further below. Additionally, the development of a tighter connection to high speed driving increases the risk of becoming involved in a car accident, which is a risk that can be amplified by the pursuit of extreme sensations. Additional variables, such as the use of drugs (including alcohol, opioids, or “binge drinking”), have been identified as risk factors. In addition, it would appear that both using a cell phone while driving and having attention deficit disorder, whether or not it is accompanied by hyperactivity, are major factors in the chance of being involved in a car collision.
Below, we describe the factors that can potentially cause vehicle accidents.
1.
Speeding ( Y 1 )
Speeding continues to be the major cause of automobile accidents. According to the Royal Society for the Prevention of Accidents (RoSPA), improper speed leads to around 11% of reported injury incidents and 24% of fatal collisions. All collisions caused by speeding are fully preventable; drivers and riders must respect traffic regulations to ensure the safety of others. Keep in mind that speed restrictions govern the maximum speed, not the minimum speed; therefore, modifying speed to the road or weather conditions is perfectly reasonable. In addition to being aware of their speed, one of the most crucial pieces of advice for drivers and riders is to maintain a safe distance from the vehicle in front, sometimes known as the “two-second rule.” Keeping a safe distance from other vehicles dramatically lessens the probability of being involved in an accident. The following may occur in an accident due to speeding.
A.
Lessened ability to drive and stop the car
There is a correlation between high rates of speed and the likelihood of becoming involved in an accident. The likelihood of a collision increases proportionally with the absolute speed of travel. Consider the fact that the driver needs a regular amount of time to respond effectively to unplanned events. As the speed of the vehicle rises, so does the distance it travels before reacting. When travelling at high speeds, there is less time to adapt to changes in the surroundings and less room to manoeuvre. In addition, as illustrated in Figure 2, the stopping distance is larger.
B.
Increased the likelihood of roll-over
When driving at high speeds, there is a significantly increased risk of becoming engaged in an accident involving a roll-over. It is highly uncommon for a car to flip over when it is engaged in an accident that occurs at a low speed, such as one that occurs in a parking lot. If even one of the vehicles is moving at a fast rate of speed, the probability that one of them may roll over is greatly increased, regardless of whether it is a car travelling at high speed or a lower-speed car struck by the high-speed vehicle.
2.
Overtaking ( Y 2 )
A.
Non-adherence to lane driving. According to official statistics, this is one of the top five causes of accidents on Indian roads. There are 1214 car accidents every single day in India, and one person loses their life as a result of a road accident every four minutes. Figure 3 shows the number of accidents annually due to changing and/or not following the lane.
The number of deaths, which has been rising over the last few years, did not decrease despite the fact that there were fewer road traffic incidents overall. Instead, the number of fatalities has been steadily rising.
B.
Overtaking in an incorrect manner. If you have been driving for a long time and often go on lengthy journeys, you have likely witnessed accidents caused by drivers who failed to properly pass another car or who came perilously close to being struck by an oncoming vehicle when passing another vehicle. When attempting to pass another car on the road, it is common for drivers to underestimate the necessary space and time. This happens more often in rural areas. One of the most common errors that can lead to accidents when overtaking another vehicle is failing to give the proper signal to the cars in front of and behind them. Overtaking is one of the leading causes of accidents, as illustrated in Figure 4.
3.
Pedestrian negligence contributes to road accidents and endangers their own lives ( Y 3 )
A.
Running or Darting into the Road.
It is not unusual for children and adolescents to run into the street without first checking to see if there are vehicles approaching from the opposite direction. Because of this, there is a chance of an accident occurring in nearly any part of the city. It is likely that a motorist will not have the time to react in the appropriate manner when a pedestrian unexpectedly walks into the street. Because of this, they stand a good risk of colliding with the pedestrian, which may lead to serious injuries.
B.
Standing, Lying, Playing, or Working in a Roadway.
When a person is standing or loitering in the middle of the roadway, it can be difficult for a car to avoid colliding with the pedestrian. Even if a driver swerves to avoid striking a pedestrian, the driver behind that vehicle may not see the pedestrian in time. Pedestrians who are standing, lying down, or playing in the roadway at the time of an accident may be held liable.
The negligence of drivers may endanger the lives of roadside workers. In order to comply with safety standards, employees are frequently required to show road signs and wear apparel that is highly visible to drivers. Similarly, motorists are expected to exhibit heightened caution when driving close to a construction site.

7. Decision-Making

Consider the CCTV footage of an accident shown in Figure 5.
Consider a set of experts E = E 1 , E 2 , E 3 with the credibility weights W = W E 1 , W E 2 , W E 3 , criterion Y = Y 1 , Y 2 , Y 3 , and alternatives U = U 1 , U 2 , U 3 , which are highlighted in the Figure 5, namely, a red vehicle ( U 1 ), two pedestrians ( U 2 ), and a white vehicle ( U 3 ). Let P α β k be the mPSFN assigned to α th potential cause of accident with respect to β th by the k th expert. Construct the mPSF decision matrix P ( k ) . Assume that w β k represents the mPSF weights of symptom S P β provided by the criteria decision matrix W . The most effect patient is filtered using the proposed techniques.
The weights associated with experts’ assessments are provided in Table 27.
The minimum reference weight and maximum reference weight are given in the Table 28:
1.
Calculate the relative proximity coefficient using the following formula; for this purpose, we first need to determine the distances, as calculated in the Table 29.
The relative proximity coefficients are computed in are calculated in the Table 30.
2.
By normalizing the weights using
W = k k = 1 n k
we obtain
W = ( 0.2991 , 0.2811 , 0.4198 ) .
The criteria weights assigned by the accident cause evaluators are presented in the Table 31. The decision matrices E 1 , E 2 , E 3 assigned by doctors are provided in the Table 32, Table 33 and Table 34, respectively.
3.
Furthermore, the aggregated mPSF-decision matrix is calculated and presented in the Table 35. The aggregated weights are given in the Table 36.
4.
Calculate the relative performance using the values of P + and P given in the Table 37 are shown in the Table 38.
S 11 = t = 1 3 Φ f 11 f t 1 = Φ f 11 f 21 + Φ f 11 f 31 S 11 = 0.01 I 11 = t = 1 3 Φ f t 1 f 11 = Φ f 21 f 11 + Φ f 31 f 11 I 11 = 0.01
5.
First calculations are performed in order to get superiority and inferiority presented in the Table 39. Further calculation are performed and the superiority index and inferiority indexes using the values listed in Table 39 are given in the Table 40.
F P i K = j = 1 3 S i j W d r j
6.
The superiority rankings are provided in the Table 41.
7.
The inferiority rankings are provided in the Table 42.
8.
The optimal Solution is P 2 k . On the basis of this optimal value U 2 is the main cause of the accident.
Numerical computation using LAM:
Step 1, Step 2 and Step 3 are the same as in the calculations for SIR.
Calculation of score function is given in the Table 43:
4.
The ranking of each alternative based on each criterion is provided in the Table 44.
5.
The rank frequency matrix is based on the score values shown in the Table 45.
The normalized weights are W = (0.2975, 0.3562, 0.3463), and th weighted rank frequency matrix is calculated in the Table 46.
6.
Construct the linear assignment model:
max Z = 0.3463 P 11 + 0.6537 P 12 + 0.3562 P 21 + 0.3463 P 22 + 0.2975 P 23 + 0.2975 P 31 + 0.7025 P 33
subject to
P 11 + P 12 + P 13 = 1 P 21 + P 22 + P 23 = 1 P 31 + P 32 + P 33 = 1 P 11 + P 21 + P 31 = 1 P 12 + P 22 + P 32 = 1 P 13 + P 23 + P 33 = 1 P i k = 1 or 0 for i = 1 , 2 , 3 ; k = 1 , 2 , 3
7.
The optimal solution for the system is then P 12 = 1 , P 21 = 1 , P 33 = 1 ; Z = 1.7124 .
P = 0 1 0 1 0 0 0 0 1
8.
The optimal rank order is P 2 k > P 1 k > P 3 k . On the basis of this optimal rank the alternatives are ranked as U 2 > U 1 > U 3 . Hence U 2 is the main cause of accident whose CCTV footage is shown in the Figure 5.

8. Discussion

The first benefit of the proposed method (LAM) is that it lowers the subjectivity of decision-makers by explicitly calculating the proximity of each alternative to the best choice. This is the initial benefit. Using a collection of criterion-specific rankings as inputs, the linear assignment method can yield a general preference ranking of the available options. The SIR technique generalises the concepts of superiority and inferiority by taking into account the distinctions between criterion values and other forms of generalised criteria. As a consequence, it presents a model that is dependable, efficient, and objective for a full investigation of the relative importance of alternatives. The capacity of the decision-maker (DM) to alter the aggregation procedures depending on his or her perspective on compensation, trade-offs, and the types of information gathered is possibly the most significant aspect of the SIR method. As a result, the SIR methodology makes use of the qualities shared by the majority of MCDM techniques when working with unquantifiable, cardinal, and ordinal data. In order to address the MCDM issues, the beginning SIR technique has been used; real figures are used to evaluate the criteria.

9. Conclusions

Topics associated with mPSF topology have been examined in this work. Combining the notions of the mPSF-union and mPSF-intersection as well as the mPSF-absolute set and the mPSF-null set produces the mPSF-topology. Meanwhile, several components of mPSF-topology are specified, including mPSF-open sets, mPSF-closed sets, the mPSF-interior, mPSF-closure, and the mPSF-exterior. Other features include mPSF-open and mPSF-closed sets. In addition, this study emphasises the mPSF-base and the mPSF subbase. mPSF-topology is a type of fuzzy topology that is an extension of m-polar fuzzy topology and spherical fuzzy topology. In this article, we have demonstrated real-world applications of MCGDM using mPSF-sets and mPSF-topologies. SIR and LAM are two well-known and commonly used approaches that we employ. One of the phases is to create the appropriate algorithms and flowcharts to make the process easier to visualise. We extend the SIR and LAM to mPSFSs and apply it to obtain a ranking to find the main causes of road accidents. In addition, we include a case study illustrating the use of both techniques for evaluating the main reasons for roadside accidents.

Author Contributions

Conceptualization, R.K. and S.T.; methodology, M.R. and D.P.; software, R.K. and S.T.; validation, D.P., C.G. and M.R.; formal analysis, S.T.; investigation, R.K.; project administration, M.R; funding acquisition, D.P. and C.G. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

Abbreviations

The following abbreviations are used in this manuscript:
mPSFSm-polar spherical fuzzy set
mPSFNm-polar spherical fuzzy number
mPSFm-polar spherical fuzzy
mPSF-topologym-polar spherical fuzzy topology
HIhuman intelligence
MLImachine learning intelligence
LAMlinear assignment model
SIRsuperiority and inferiority ranking methodology
MCDMmulticriteria decision making
Notations
( ρ , μ ˜ A ( ρ ) ) membership of ρ in A.
γ ( ⨿ ˘ ) degree of hesitancy of ⨿ ˘
U i i-th alternative
E i i-th expert
W E i credibility weight of i-th expert

References

  1. Sardiu, M.E.; Gilmore, J.M.; Groppe, B.; Florens, L.; Washburn, M.P. Identification of Topological Network Modules in Perturbed Protein Interaction Networks. Sci. Rep. 2017, 7, srep43845. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  2. Lum, P.Y.; Singh, G.; Lehman, A.; Ishkanov, T.; Vejdemo-Johansson, M.; Alagappan, M.; Carlsson, G. Extracting insights from the shape of complex data using topology. Sci. Rep. 2013, 3, 1236. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  3. Nicolau, M.; Levine, A.J.; Carlsson, G. Topology based data analysis identifies a subgroup of breast cancers with a unique mutational profile and excellent survival. Proc. Natl. Acad. Sci. USA 2011, 108, 7265–7270. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  4. Li, L.; Cheng, W.Y.; Glicksberg, B.S.; Gottesman, O.; Tamler, R.; Chen, R.; Dudley, J.T. Identification of type 2 diabetes subgroups through topological analysis of patient similarity. Sci. Transl. Med. 2015, 7, 311ra174. [Google Scholar] [CrossRef] [Green Version]
  5. Chang, C.L. Fuzzy topological spaces. J. Math. Anal. Appl. 1968, 24, 182–190. [Google Scholar] [CrossRef] [Green Version]
  6. Kelley, J.L. General Topology; Van Nostrand: Princeton, NJ, USA, 1955. [Google Scholar]
  7. Hofer, C.; Kwitt, R.; Niethammer, M. Deep learning with topological signatures. Adv. Neural Inf. Process. Syst. 2017, 30, 1634–1644. [Google Scholar]
  8. Wong, C.K. Fuzzy point and local properties of fuzzy topology. J. Math. Anal. Appl. 1974, 46, 316–328. [Google Scholar] [CrossRef] [Green Version]
  9. Lowen, R. Fuzzy topological spaces and compactness. J. Math. Anal. Appl. 1976, 56, 621–633. [Google Scholar] [CrossRef] [Green Version]
  10. Hutton, B. Normality in fuzzy topological spaces. J. Math. Anal. Appl. 1975, 50, 74–79. [Google Scholar] [CrossRef] [Green Version]
  11. Ming, P.P.; Ming, L.Y. Fuzzy topology I. Neighborhood structure of a fuzzy point and Moore Smith convergence. J. Math. Anal. Appl. 1980, 76, 571–599. [Google Scholar] [CrossRef] [Green Version]
  12. Ying, M. A new approach for fuzzy topology (I). Fuzzy Sets Syst. 1991, 39, 303–321. [Google Scholar] [CrossRef]
  13. Ying, M. A new approach for fuzzy topology (II). Fuzzy Sets Syst. 1992, 47, 221–232. [Google Scholar] [CrossRef]
  14. Shen, J. Separation axiom in fuzzifying topology. Fuzzy Sets Syst. 1993, 57, 111–123. [Google Scholar] [CrossRef]
  15. Coker, D. An Introduction to Intuitionistic fuzzy topological spaces. Fuzzy Sets Syst. 1997, 88, 81–89. [Google Scholar] [CrossRef]
  16. Coker, D.; Haydar, E.A. On fuzzy compactness in Intuitionistic fuzzy topological spaces. J. Fuzzy Math. 1995, 3, 899–910. [Google Scholar]
  17. Shabir, M.; Naz, M. On soft topological spaces. Comput. Math. Appl. 2011, 61, 1786–1799. [Google Scholar] [CrossRef] [Green Version]
  18. Cagman, N.; Karatas, S.; Enginoglu, S. Soft topology. Comput. Math. Appl. 2011, 62, 351–358. [Google Scholar] [CrossRef] [Green Version]
  19. Riaz, M.; Çağman, N.; Zareef, I.; Aslam, M. N-soft topology and its applications to multi-criteria group decision making. J. Intell. Fuzzy Syst. 2019, 36, 6521–6536. [Google Scholar] [CrossRef]
  20. Olgun, M.; Unver, M.; Yardımcı, S. Pythagorean fuzzy topological spaces. Complex Intell. Syst. 2019, 5, 177–183. [Google Scholar] [CrossRef] [Green Version]
  21. Alshammari, I.; Parimala, M.; Jafari, S. On Pythagorean fuzzy soft topological spaces. J. Intell. Fuzzy Syst. 2021, 41, 6889–6897. [Google Scholar] [CrossRef]
  22. Black, M. Vagueness: An Exercise in Logical Analysis. Philos. Sci. 1973, 4, 427–455, Reprinted in Int. J. Gen. Syst. 2022, 17, 107–128. [Google Scholar] [CrossRef]
  23. Zadeh, L.A. Fuzzy sets. Inform. Control. 1965, 8, 338–353. [Google Scholar] [CrossRef]
  24. Atanassov, K.T. Intuitionistic fuzzy sets. Fuzzy Sets Syst. 1986, 20, 87–96. [Google Scholar] [CrossRef]
  25. Atanassov, K.T. Intuitionistic Fuzzy Sets. In Studies in Fuzziness and Soft Computing, Physica; Springer: Berlin/Heidelberg, Germany, 1999; Volume 35, pp. 1–137. [Google Scholar]
  26. Atanassov, K.T.; Stoeva, S. Intuitionistic fuzzy sets. In Polish Symposium on Interval and Fuzzy Mathematics, Poznan; 1983; pp. 23–26. [Google Scholar]
  27. Yager, R.R.; Abbasov, A.M. Pythagorean membership grades, complex numbers, and decision making. Int. J. Intell. Syst. 2013, 28, 436–452. [Google Scholar] [CrossRef]
  28. Yager, A.M. Pythagorean fuzzy subsets. In Proceedings of the Joint IFSAWorld Congress and NAFIPS Annual Meeting, Edmonton, AB, Canada, 24–28 June 2013; pp. 57–61. [Google Scholar]
  29. Yager, R.R. Generalized orthopair fuzzy sets. IEEE Trans. Fuzzy Syst. 2016, 25, 1222–1230. [Google Scholar] [CrossRef]
  30. Molodtsov, D. Soft set theory-first results. Comput. Math. Appl. 1999, 37, 19–31. [Google Scholar] [CrossRef] [Green Version]
  31. Alcantud, J.C.R.; García, G.S.; Akram, M. OWA aggregation operators and multi-agent decisions with N-soft sets. Expert Syst. Appl. 2022, 203, 117430. [Google Scholar] [CrossRef]
  32. Smarandache, F. A Unifying Field in Logics: Neutrosophy: Neutrosophic Probability, Set and Logic; American Research Press: Rehoboth, DE, USA, 1999; pp. 1–141. [Google Scholar]
  33. Cuong, B.C.; Kreinovich, V. Picture fuzzy sets. J. Comput. Sci. Cybern. 2014, 30, 409–420. [Google Scholar]
  34. Gündogdu, F.K.; Kahraman, C. Spherical fuzzy sets and spherical fuzzy TOPSIS method. J. Intell. Fuzzy Syst. 2019, 36, 337–352. [Google Scholar]
  35. Ashraf, S.; Abdullah, S.; Mahmood, T.; Ghani, F.; Mahmood, T. Spherical fuzzy sets and their applications in multi-attribute decision making problems. J. Intell. Fuzzy Syst. 2019, 36, 2829–2844. [Google Scholar] [CrossRef]
  36. Mahmood, T.; Ullah, K.; Khan, Q.; Jan, N. An Approach towards decision making and medical diagnosis problems using the concept of spherical fuzzy sets. Neural Comput. Appl. 2019, 31, 7041–7053. [Google Scholar] [CrossRef]
  37. Feng, F.; Zheng, Y.; Sun, B.; Akram, M. Novel score functions of generalized orthopair fuzzy membership grades with application to multiple attribute decision making. Granul. Comput. 2022, 7, 95–111. [Google Scholar] [CrossRef]
  38. Deveci, M.; Pamucar, D.; Gokasar, I.; Köppen, M.; Gupta, B.B. Personal Mobility in Metaverse With Autonomous Vehicles Using Q-Rung Orthopair Fuzzy Sets Based OPA-RAFSI Model. IEEE Trans. Intell. Transp. Syst. 2022. [Google Scholar] [CrossRef]
  39. Riaz, M.; Jamil, N.; Zararsiz, Z. Distance and similarity measures for bipolar fuzzy soft sets with application to pharmaceutical logistics and supply chain management. J. Intell. Fuzzy Syst. 2022, 42, 3169–3188. [Google Scholar] [CrossRef]
  40. Jana, C.; Pal, M.; Wang, J.Q. Bipolar fuzzy Dombi aggregation operators and its application in multiple-attribute-making process. J. Ambient. Intell. Humaniz. Comput. 2019, 10, 3533–3549. [Google Scholar] [CrossRef]
  41. Robinson, J.P.; Amirtharaj, E.C.H. MAGDM problems with correlation coefficient of triangular fuzzy IFS. Int. J. Fuzzy Syst. Appl. 2015, 4, 1–32. [Google Scholar] [CrossRef] [Green Version]
  42. Bernardo, J.J.; Blin, J.M. A programming model of consumer choice among multi-attributed brands. J.Consum. Res. 1977, 4, 111. [Google Scholar] [CrossRef]
  43. Senapati, T.; Yager, R.R. Fermatean fuzzy sets. J. Ambient. Intell. Humaniz. Comput. 2022, 11, 663–674. [Google Scholar] [CrossRef]
  44. Liang, D.; Darko, A.P.; Xu, Z.S.; Zhang, Y. Partitioned fuzzy measure-based linear assignment method for Pythagorean fuzzy multi-criteria decision-making with a new likelihood. J. Oper. Res. 2019, 71, 831–845. [Google Scholar] [CrossRef]
  45. Deveci, M.; Mishra, A.R.; Gokasar, I.; Rani, P.; Pamucar, D.; Ozcan, E. A Decision Support System for Assessing and Prioritizing Sustainable Urban Transportation in Metaverse. IEEE Trans. Fuzzy Syst. 2022. [Google Scholar] [CrossRef]
  46. Bashiri, M.; Badri, H.; Hejazi, T.H. Selecting optimum maintenance strategy by fuzzy interactive linear assignment method. Appl. Math. Model. 2011, 35, 152–164. [Google Scholar] [CrossRef]
  47. Chen, T.Y. A linear assignment method for multiple-criteria decision analysis with interval type-2 fuzzy sets. Appl. Soft Comput. J. 2013, 13, 2735–2748. [Google Scholar] [CrossRef]
  48. Chen, T.Y. The extended linear assignment method for multiple criteria decision analysis based on interval-valued intuitionistic fuzzy sets. Appl. Math. Model. 2014, 38, 2101–2117. [Google Scholar] [CrossRef]
  49. Wei, G.; Alsaadi, F.E.; Hayat, T.; Alsaedi, A. A linear assignment method for multiple criteria decision analysis with hesitant fuzzy sets based on fuzzy measure. Int. J. Fuzzy Syst. 2017, 19, 607–614. [Google Scholar] [CrossRef]
  50. Razavi Hajiagha, S.H.; Shahbazi, M.; Amoozad Mahdiraji, H.; Panahian, H. A Bi-objective scorevariance based linear assignment method for group decision making with hesitant fuzzy linguistic term sets. Technol. Econ. Dev. Econ. 2018, 24, 1125–1148. [Google Scholar] [CrossRef] [Green Version]
  51. Yang, W.; Shi, J.; Pang, Y.; Zheng, X. Linear assignment method for interval neutrosophic sets. Neural Comput. Appl. 2018, 29, 553–564. [Google Scholar]
  52. Donyatalab, Y.; Seyfi-Shishavan, S.A.; Farrokhizadeh, E.; Kutlu Gündoğdu, F.; Kahraman, C. Spherical fuzzy linear assignment method for multiple criteria group decision-making problems. Informatica 2020, 31, 707–722. [Google Scholar] [CrossRef]
  53. Gundogdu, F.K. Picture fuzzy linear assignment method and its application to selection of pest house location. In International Conference on Intelligent and Fuzzy Systems, Proceedings of the INFUS 2020 Conference, Istanbul, Turkey, 21–23 July 2020; Springer: Cham, Switzerland, 2020; pp. 101–109. [Google Scholar]
  54. Gündoğdu, F.K.; Duleba, S.; Moslem, S.; Aydın, S. Evaluating public transport service quality using picture fuzzy analytic hierarchy process and linear assignment model. Appl. Soft Comput. 2021, 100, 106920. [Google Scholar] [CrossRef]
  55. Xu, X. The SIR method: A superiority and inferiority ranking method for multiple criteria decision making. Eur. J. Oper. Res. 2001, 131, 587–602. [Google Scholar] [CrossRef]
  56. Tam, C.M.; Tong, T.K.L.; Wong, Y.W. Selection of concrete pump using the superiority and inferiority ranking method. J. Constr. Eng. Manag. 2004, 130, 827–834. [Google Scholar] [CrossRef]
  57. Tam, C.M.; Tong, T.K.L. Locating large-scale harbour-front project developments using SIR method with grey aggregation approach. Constr. Innov. 2008, 8, 120–136. [Google Scholar] [CrossRef]
  58. Liu, J.N.K. A novel multicriteria group decision making approach with intuitionistic fuzzy SIR method. In World Automation Congress (WAC); IEEE: Piscataway, NJ, USA, 2010; pp. 1–6. [Google Scholar]
  59. Ma, Z.J.; Zhang, N.; Dai, Y. A novel SIR method for multiple attributes group decision making problem under hesitant fuzzy environment. J. Intell. Fuzzy Syst. 2014, 26, 2119–2130. [Google Scholar] [CrossRef]
  60. Peng, X.D.; Yang, Y. Some results for Pythagorean fuzzy sets. Int. J. Intell. Syst. 2015, 30, 1133–1160. [Google Scholar] [CrossRef]
  61. Rouhani, S. A fuzzy superiority and inferiority ranking based approach for IT service management software selection. Kybernetes 2017, 46, 728–746. [Google Scholar] [CrossRef]
  62. Tavana, M.; Zareinejad, M.; Arteaga, F.J.S. An intuitionistic fuzzy-grey superiority and inferiority ranking method for third-party reverse logistics provider selection. Int. J. Syst. Sci. 2018, 5, 175–194. [Google Scholar]
  63. Zhao, N.; Xu, Z.; Ren, Z. Hesitant fuzzy linguistic prioritized superiority and inferiority ranking method and its application in sustainable energy technology evaluation. Inf. Sci. 2019, 478, 239–257. [Google Scholar] [CrossRef]
  64. Nawar, A.S.; El-Gayar, M.A.; El-Bably, M.K.; Hosny, R.A. θβ-ideal approximation spaces and their applications. AIMS Math. 2022, 7, 2479–2497. [Google Scholar] [CrossRef]
  65. El-Bably, M.K.; Abo-Tabl, E.A. A topological reduction for predicting of a lung cancer disease based on generalized rough sets. J. Intell. Fuzzy Syst. 2021, 41, 3045–3060. [Google Scholar] [CrossRef]
  66. El Sayed, M.; El Safty, M.A.; El-Bably, M.K. Topological approach for decision-making of COVID-19 infection via a nano-topology model. AIMS Math. 2021, 6, 7872–7894. [Google Scholar] [CrossRef]
  67. El-Bably, M.K.; El Atik, A.F.A. Soft β-rough sets and their application to determine COVID-19. Turk. J. Math. 2021, 45, 1133–1148. [Google Scholar] [CrossRef]
  68. El-Bably, M.K.; El-Sayed, M. Three methods to generalize Pawlak approximations via simply open concepts with economic applications. Soft Comput. 2022, 26, 4685–4700. [Google Scholar] [CrossRef]
  69. Gai, T.; Cao, M.; Chiclana, F.; Zhang, Z.; Dong, Y.; Herrera-Viedma, E.; Wu, J. Consensus-trust driven bidirectional feedback mechanism for improving consensus in social network large-group decision making. Group Decis. Negot. 2022, 1–30. [Google Scholar] [CrossRef]
  70. Zhang, Z.; Li, Z. Consensus-based TOPSIS-Sort-B for multi-criteria sorting in the context of group decision-making. Ann. Oper. Res. 2022, 1–28. [Google Scholar] [CrossRef]
  71. Gopalakrishnan, S. A public health perspective of road traffic accidents. J. Fam. Med. Prim. Care 2012, 1, 144. [Google Scholar] [CrossRef] [PubMed]
Figure 1. Major causes of death toll globally.
Figure 1. Major causes of death toll globally.
Symmetry 14 02216 g001
Figure 2. Braking distance dependence on driving speed.
Figure 2. Braking distance dependence on driving speed.
Symmetry 14 02216 g002
Figure 3. Number of accidents vs. year due to non-adherence to lane driving.
Figure 3. Number of accidents vs. year due to non-adherence to lane driving.
Symmetry 14 02216 g003
Figure 4. Overtaking as a cause of accidents.
Figure 4. Overtaking as a cause of accidents.
Symmetry 14 02216 g004
Figure 5. CCTV footage of an accident.
Figure 5. CCTV footage of an accident.
Symmetry 14 02216 g005
Table 1. Topological structures on fuzzy sets and soft sets.
Table 1. Topological structures on fuzzy sets and soft sets.
YearResearchersField of contribution
1968Chang [5]Fuzzy topological spaces and concepts
such as open set, closed set, neighbourhood,
interior set, continuity, and compactness
1955Kelley [6]Definitions, theorems,
and proofs of topological concepts
1974Wong [8]Fuzzy points and local countability, separability
1976Lowen [9]Definitions for fuzzy topological spaces
1975Hutton [10]Normality
1980Ming and Ming [11]Link between fuzzy sets and their systems
1991, 1992Ying [12,13]Technique of continuous valued logic
1993Shen [14]Introduced separation axioms and several of
their equivalences as well as their
relations with each other in fuzzifying topology
1995, 1997Coker [15,16]Invented the idea of intuitionistic fuzzy topological space
2011Shabir and Naz [17]Soft topological spaces
2011Cagman et al. [18]Soft topology
2019Riaz et al. [19]N-soft topology and decision analysis
2019Olgun et al. [20]Topological properties of Pythagorean fuzzy sets
2021Alshammari et al. [21]Pythagorean fuzzy soft topological spaces
Table 2. Applications based on LAM in different fuzzy domains.
Table 2. Applications based on LAM in different fuzzy domains.
ResearchersApplications
Bashiri et al. (2011) [46]Optimum maintenance strategy
Chen (2013) [47]Optimal preference
Chen (2014) [48]Solution of interval-valued MCDM problems
Wei et al. (2017) [49]Solution of MCDM problems
under a hesitant fuzzy environment
Hajiagha et al. (2018) [50]Solution of MCGDM using hesitant fuzzy linguistic term sets
Yang et al. (2018) [51]MCGDM based on interval neutrosophic sets
Liang et al. (2019) [44]Solution of MCDM problems under Pythagorean fuzzy environment
Donyatalab et al. (2020) [52]Determination of ranking
for allocation under spherical fuzzy environment
Gundogdu (2021) [53]Selection of penthouse location using picture fuzzy set
Moslem et al. (2021) [54]Evaluation of service quality ranking in picture fuzzy environment
Table 3. Applications based on SIR in different fuzzy domains.
Table 3. Applications based on SIR in different fuzzy domains.
ResearchersApplications
Tam et al. (2004) [56]Used the strategy to choose a solid siphon
Tam and Tong (2008) [57]Utilized the method for venture enhancements to locate the
an expansive harbour
Liu (2010) [58]Solutions fo supply chain management issues under intuitionistic
fuzzy environment
Ma et al. (2014) [59]Proposed an expanded SIR approach to HFS
Peng and Yang (2015) [60]Introduced the PF-SIR approach
Rouhani (2017) [61]Applied the F-SIR method to the selection of software in the
IT sector
Tavana et al. (2018) [62]Solved the third-party reverse logistics problem using the
IFG-SIR approach
Zhao et al. (2019) [63]Solve the investment selection problem, the IVIF-SIR method
was applied
Table 4. m-polar spherical fuzzy sets.
Table 4. m-polar spherical fuzzy sets.
S Γ ¯ mPSFSs
⨿ ˘ 1 μ ˜ ( 1 ) ( ⨿ ˘ 1 ) , γ ( 1 ) ( ⨿ ˘ 1 ) , η ˜ ( 1 ) ( ⨿ ˘ 1 ) μ ˜ ( 2 ) ( ⨿ ˘ 1 ) , γ ( 2 ) ( ⨿ ˘ 1 ) , η ˜ ( 2 ) ( ⨿ ˘ 1 ) μ ˜ ( m ) ( ⨿ ˘ 1 ) , γ ( m ) ( ⨿ ˘ 1 ) , η ˜ ( m ) ( ⨿ ˘ 1 )
⨿ ˘ 2 μ ˜ ( 1 ) ( ⨿ ˘ 2 ) , γ ( 1 ) ( ⨿ ˘ 2 ) , η ˜ ( 1 ) ( ⨿ ˘ 2 ) μ ˜ ( 2 ) ( ⨿ ˘ 2 ) , γ ( 2 ) ( ⨿ ˘ 2 ) , η ˜ ( 2 ) ( ⨿ ˘ 2 ) , μ ˜ ( m ) ( ⨿ ˘ 2 ) , γ ( m ) ( ⨿ ˘ 2 ) , η ˜ ( m ) ( ⨿ ˘ 2 )
⨿ ˘ 3 μ ˜ ( 1 ) ( ⨿ ˘ 3 ) , γ ( 1 ) ( ⨿ ˘ 3 ) , η ˜ ( 1 ) ( ⨿ ˘ 3 ) μ ˜ ( 2 ) ( ⨿ ˘ 3 ) , γ ( 2 ) ( ⨿ ˘ 3 ) , η ˜ ( 2 ) ( ⨿ ˘ 3 ) , μ ˜ ( m ) ( ⨿ ˘ 3 ) , γ ( m ) ( ⨿ ˘ 3 ) , η ˜ ( m ) ( ⨿ ˘ 3 )
⨿ ˘ k μ ˜ ( 1 ) ( ⨿ ˘ k ) , γ ( 1 ) ( ⨿ ˘ k ) , η ˜ ( 1 ) ( ⨿ ˘ k ) , μ ˜ ( 2 ) ( ⨿ ˘ k ) , γ ( 2 ) ( ⨿ ˘ k ) , η ˜ ( 2 ) ( ⨿ ˘ k ) , μ ˜ ( m ) ( ⨿ ˘ k ) , γ ( m ) ( ⨿ ˘ k ) , η ˜ ( m ) ( ⨿ ˘ k )
Table 5. 5-polar spherical fuzzy set S Γ ¯ .
Table 5. 5-polar spherical fuzzy set S Γ ¯ .
S Γ ¯ 5 PSFSs
⨿ ˘ 1 0.389 , 0.175 , 0.412 , 0.655 , 0.423 , 0.392 , 0.622 , 0.183 , 0.245 , 0.417 , 0.118 , 0.279 , 0.397 , 0.271 , 0.369
⨿ ˘ 2 0.546 , 0.253 , 0.645 , 0.391 , 0.125 , 0.629 , 0.620 , 0.187 , 0.390 , 0.445 , 0.198 , 0.322 , 0.467 , 0.218 , 0.329
⨿ ˘ 3 0.719 , 0.345 , 0.283 , 0.320 , 0.217 , 0.691 , 0.543 , 0.165 , 0.281 , 0.623 , 0.346 , 0.479 , 0.517 , 0.118 , 0.249
Table 6. 5-polar spherical fuzzy set A.
Table 6. 5-polar spherical fuzzy set A.
S Γ ¯ A 5 PSFSs
⨿ ˘ 1 0.389 , 0.145 , 0.422 , 0.665 , 0.126 , 0.351 , 0.682 , 0.183 , 0.295 , 0.678 , 0.112 , 0.299 , 0.419 , 0.197 , 0.382
⨿ ˘ 2 0.576 , 0.243 , 0.391 , 0.217 , 0.450 , 0.632 , 0.690 , 0.119 , 0.351 , 0.442 , 0.198 , 0.454 , 0.523 , 0.215 , 0.323
Table 7. 5-polar spherical fuzzy set B.
Table 7. 5-polar spherical fuzzy set B.
S Γ ¯ B 5 PSFSs
⨿ ˘ 1 0.362 , 0.189 , 0.614 , 0.699 , 0.009 , 0.298 , 0.389 , 0.267 , 0.510 , 0.477 , 0.120 , 0.321 , 0.411 , 0.179 , 0.399
⨿ ˘ 2 0.541 , 0.275 , 0.332 , 0.341 , 0.195 , 0.324 , 0.594 , 0.167 , 0.336 , 0.543 , 0.116 , 0.313 , 0.492 , 0.289 , 0.314
Table 8. Union of two 5-polar spherical fuzzy sets S Γ ¯ A S Γ ¯ B .
Table 8. Union of two 5-polar spherical fuzzy sets S Γ ¯ A S Γ ¯ B .
S Γ ¯ A S Γ ¯ B 5 PSFSs
⨿ ˘ 1 ⨿ ˘ 1 0.389 , 0.145 , 0.422 , 0.699 , 0.009 , 0.298 , 0.389 , 0.183 , 0.295 , 0.477 , 0.02 , 0.29 , 0.419 , 0.179 , 0.382
⨿ ˘ 2 ⨿ ˘ 2 0.576 , 0.243 , 0.332 , 0.341 , 0.195 , 0.324 , 0.690 , 0.119 , 0.336 , 0.543 , 0.116 , 0.313 , 0.523 , 0.215 , 0.314
Table 9. Intersection of two 5-polar spherical fuzzy sets S Γ ¯ A S Γ ¯ B .
Table 9. Intersection of two 5-polar spherical fuzzy sets S Γ ¯ A S Γ ¯ B .
S Γ ¯ A S Γ ¯ B 5 PSFSs
⨿ ˘ 1 ⨿ ˘ 1 0.362 , 0.189 , 0.614 , 0.665 , 0.126 , 0.351 , 0.389 , 0.267 , 0.510 , 0.477 , 0.120 , 0.321 , 0.411 , 0.197 , 0.399
⨿ ˘ 2 ⨿ ˘ 2 0.541 , 0.275 , 0.391 , 0.217 , 0.450 , 0.632 , 0.594 , 0.167 , 0.351 , 0.442 , 0.198 , 0.454 , 0.492 , 0.289 , 0.323
Table 10. Complement operation on 5-polar spherical fuzzy set.
Table 10. Complement operation on 5-polar spherical fuzzy set.
S Γ ¯ A c 5 PSFSs
⨿ ˘ 1 c 0.422 , 0.145 , 0.389 , 0.351 , 0.126 , 0.665 , 0.295 , 0.183 , 0.682 , 0.299 , 0.112 , 0.678 , 0.382 , 0.197 , 0.419
⨿ ˘ 2 c 0.391 , 0.243 , 0.576 , 0.632 , 0.450 , 0.217 , 0.351 , 0.119 , 0.690 , 0.454 , 0.198 , 0.442 , 0.323 , 0.215 , 0.523
Table 11. 4-polar spherical fuzzy set S 1 .
Table 11. 4-polar spherical fuzzy set S 1 .
S 1 4 PSFSs
⨿ ˘ 1 0.429 , 0.738 , 0.275 , 0.372 , 0.669 , 0.232 , 0.731 , 0.384 , 0.419 , 0.556 , 0.423 , 0.361
⨿ ˘ 2 0.542 , 0.821 , 0.121 , 0.734 , 0.298 , 0.467 , 0.657 , 0.156 , 0.279 , 0.459 , 0.325 , 0.576
⨿ ˘ 3 0.425 , 0.145 , 0.361 , 0.421 , 0.264 , 0.532 , 0.541 , 0.121 , 0.219 , 0.785 , 0.312 , 0.421
Table 12. 4-polar spherical fuzzy set S 2 .
Table 12. 4-polar spherical fuzzy set S 2 .
S 2 4 PSFSs
⨿ ˘ 1 0.411 , 0.761 , 0.312 , 0.352 , 0.731 , 0.248 , 0.653 , 0.451 , 0.527 , 0.418 , 0.598 , 0.426
⨿ ˘ 2 0.398 , 0.865 , 0.178 , 0.645 , 0.357 , 0.576 , 0.611 , 0.257 , 0.343 , 0.405 , 0.399 , 0.586
⨿ ˘ 3 0.365 , 0.198 , 0.376 , 0.405 , 0.357 , 0.545 , 0.445 , 0.267 , 0.376 , 0.634 , 0.398 , 0.499
Table 13. 4-polar spherical fuzzy set S 3 .
Table 13. 4-polar spherical fuzzy set S 3 .
S 3 4 PSFSs
⨿ ˘ 1 0.521 , 0.678 , 0.229 , 0.439 , 0.547 , 0.165 , 0.763 , 0.249 , 0.211 , 0.618 , 0.403 , 0.267
⨿ ˘ 2 0.632 , 0.765 , 0.18 , 0.76 , 0.269 , 0.424 , 0.721 , 0.136 , 0.234 , 0.532 , 0.234 , 0.477
⨿ ˘ 3 0.534 , 0.132 , 0.256 , 0.468 , 0.213 , 0.461 , 0.545 , 0.167 , 0.189 , 0.798 , 0.254 , 0.345
Table 14. 3-polar spherical fuzzy set S Γ ¯ 1 .
Table 14. 3-polar spherical fuzzy set S Γ ¯ 1 .
S Γ ¯ 1 3 PSFSs
⨿ ˘ 1 0.276 , 0.413 , 0.720 , 0.425 , 0.511 , 0.623 , 0.324 , 0.256 , 0.163 , 0.536 , 0.168 , 0.256
⨿ ˘ 2 0.424 , 0.563 , 0.471 , 0.265 , 0.891 , 0.314 , 0.476 , 0.145 , 0.67 , 0.406 , 0.211 , 0.321
Table 15. 4-polar spherical fuzzy set S Γ ¯ 2 .
Table 15. 4-polar spherical fuzzy set S Γ ¯ 2 .
S Γ ¯ 2 4 PSFSs
⨿ ˘ 1 0.414 , 0.320 , 0.646 , 0.387 , 0.569 , 0.648 , 0.368 , 0.217 , 0.11 , 0.571 , 0.116 , 0.215
⨿ ˘ 2 0.587 , 0.465 , 0.381 , 0.322 , 0.735 , 0.247 , 0.413 , 0.243 , 0.717 , 0.503 , 0.213 , 0.712
Table 16. 4-polar spherical fuzzy set S Γ ¯ 1 .
Table 16. 4-polar spherical fuzzy set S Γ ¯ 1 .
S Γ ¯ 1 4 PSFSs
⨿ ˘ 1 0.319 , 0.428 , 0.486 , 0.398 , 0.546 , 0.622 , 0.495 , 0.809 , 0.134 , 0.525 , 0.239 , 0.284
⨿ ˘ 2 0.268 , 0.297 , 0.432 , 0.660 , 0.447 , 0.081 , 0.168 , 0.439 , 0.134 , 0.295 , 0.099 , 0.534
⨿ ˘ 3 0.635 , 0.489 , 0.217 , 0.489 , 0.317 , 0.159 , 0.719 , 0.563 , 0.443 , 0.455 , 0.092 , 0.387
Table 17. 4-polar spherical fuzzy set S Γ ¯ 2 .
Table 17. 4-polar spherical fuzzy set S Γ ¯ 2 .
S Γ ¯ 2 4 PSFSs
⨿ ˘ 1 0.421 , 0.167 , 0.312 , 0.632 , 0.459 , 0.430 , 0.697 , 0.217 , 0.065 , 0.596 , 0.217 , 0.195
⨿ ˘ 2 0.523 , 0.211 , 0.148 , 0.692 , 0.216 , 0.056 , 0.389 , 0.301 , 0.112 , 0.364 , 0.008 , 0.112
⨿ ˘ 3 0.679 , 0.372 , 0.213 , 0.694 , 0.245 , 0.132 , 0.752 , 0.321 , 0.033 , 0.536 , 0.075 , 0.211
Table 18. 4-polar spherical fuzzy set Y ¯ .
Table 18. 4-polar spherical fuzzy set Y ¯ .
Y ¯ 4 PSFSs
⨿ ˘ 1 1.000 , 0.000 , 0.000 , 1.000 , 0.000 , 0.000 , 1.000 , 0.000 , 0.000 , 1.000 , 0.000 , 0.000
⨿ ˘ 3 1.000 , 0.000 , 0.000 , 1.000 , 0.000 , 0.000 , 1.000 , 0.000 , 0.000 , 1.000 , 0.000 , 0.000
Table 19. 4-polar spherical fuzzy set S Γ 1 .
Table 19. 4-polar spherical fuzzy set S Γ 1 .
Y ¯ S Γ ¯ 1 = S Γ ¯ 1 4 PSFSs
⨿ ˘ 1 0.319 , 0.428 , 0.486 , 0.398 , 0.546 , 0.622 , 0.495 , 0.809 , 0.134 , 0.525 , 0.239 , 0.284
⨿ ˘ 3 0.635 , 0.489 , 0.217 , 0.489 , 0.317 , 0.159 , 0.719 , 0.563 , 0.443 , 0.455 , 0.092 , 0.387
Table 20. 4-polar spherical fuzzy set S Γ ¯ 2 .
Table 20. 4-polar spherical fuzzy set S Γ ¯ 2 .
Y ¯ S Γ ¯ 2 = S Γ ¯ 2 4 PSFSs
⨿ ˘ 1 0.421 , 0.167 , 0.312 , 0.632 , 0.459 , 0.430 , 0.697 , 0.217 , 0.065 , 0.596 , 0.217 , 0.195
⨿ ˘ 3 0.679 , 0.372 , 0.213 , 0.694 , 0.245 , 0.132 , 0.752 , 0.321 , 0.033 , 0.536 , 0.075 , 0.211
Table 21. 4-polar spherical fuzzy set S Γ ¯ 1 .
Table 21. 4-polar spherical fuzzy set S Γ ¯ 1 .
S Γ ¯ 1 4 PSFSs
⨿ ˘ 1 0.276 , 0.435 , 0.394 , 0.254 , 0.337 , 0.325 , 0.548 , 0.440 , 0.122 , 0.248 , 0.462 , 0.282
⨿ ˘ 2 0.239 , 0.332 , 0.419 , 0.611 , 0.226 , 0.192 , 0.440 , 0.459 , 0.523 , 0.458 , 0.286 , 0.331
⨿ ˘ 3 0.316 , 0.297 , 0.196 , 0.632 , 0.149 , 0.218 , 0.198 , 0.387 , 0.291 , 0.627 , 0.312 , 0.112
Table 22. 4-polar spherical fuzzy set S Γ ¯ 2 .
Table 22. 4-polar spherical fuzzy set S Γ ¯ 2 .
S Γ ¯ 2 4 PSFSs
⨿ ˘ 1 0.412 , 0.229 , 0.323 , 0.254 , 0.325 , 0.190 , 0.630 , 0.382 , 0.110 , 0.418 , 0.362 , 0.172
⨿ ˘ 2 0.406 , 0.313 , 0.218 , 0.621 , 0.210 , 0.082 , 0.554 , 0.287 , 0.137 , 0.554 , 0.256 , 0.231
⨿ ˘ 3 0.652 , 0.267 , 0.134 , 0.674 , 0.149 , 0.145 , 0.731 , 0.329 , 0.290 , 0.687 , 0.212 , 0.092
Table 23. 4-polar spherical fuzzy set S Γ ¯ .
Table 23. 4-polar spherical fuzzy set S Γ ¯ .
S Γ ¯ 4 PSFSs
⨿ ˘ 1 0.416 , 0.344 , 0.389 , 0.465 , 0.256 , 0.276 , 0.597 , 0.385 , 0.049 , 0.388 , 0.453 , 0.231
⨿ ˘ 2 0.376 , 0.276 , 0.311 , 0.619 , 0.225 , 0.089 , 0.595 , 0.430 , 0.255 , 0.597 , 0.210 , 0.231
⨿ ˘ 3 0.654 , 0.271 , 0.123 , 0.740 , 0.112 , 0.194 , 0.291 , 0.372 , 0.115 , 0.736 , 0.218 , 0.105
Table 24. 4-polar spherical fuzzy set S Γ ¯ 1 c .
Table 24. 4-polar spherical fuzzy set S Γ ¯ 1 c .
S Γ ¯ 1 c 3 PSFSs
⨿ ˘ 1 0.394 , 0.435 , 0.276 , 0.325 , 0.337 , 0.254 , 0.122 , 0.440 , 0.548 , 0.282 , 0.462 , 0.248
⨿ ˘ 2 0.419 , 0.332 , 0.239 , 0.192 , 0.226 , 0.611 , 0.523 , 0.459 , 0.440 , 0.331 , 0.286 , 0.458
⨿ ˘ 3 0.196 , 0.297 , 0.316 , 0.218 , 0.149 , 0.632 , 0.291 , 0.387 , 0.198 , 0.112 , 0.312 , 0.627
Table 25. 4-polar spherical fuzzy set S Γ ¯ 2 c .
Table 25. 4-polar spherical fuzzy set S Γ ¯ 2 c .
S Γ ¯ 2 c 4 PSFSs
⨿ ˘ 1 0.323 , 0.229 , 0.412 , 0.190 , 0.325 , 0.254 , 0.110 , 0.382 , 0.630 , 0.172 , 0.362 , 0.418
⨿ ˘ 2 0.218 , 0.313 , 0.406 , 0.082 , 0.210 , 0.621 , 0.137 , 0.287 , 0.554 , 0.231 , 0.256 , 0.554
⨿ ˘ 3 0.134 , 0.267 , 0.652 , 0.145 , 0.149 , 0.674 , 0.290 , 0.329 , 0.731 , 0.092 , 0.212 , 0.687
Table 26. 4-polar spherical fuzzy set S Γ ¯ .
Table 26. 4-polar spherical fuzzy set S Γ ¯ .
S Γ ¯ 4 PSFSs
⨿ ˘ 1 0.233 , 0.317 , 0.450 , 0.189 , 0.484 , 0.390 , 0.108 , 0.487 , 0.651 , 0.163 , 0.412 , 0.508
⨿ ˘ 2 0.213 , 0.375 , 0.45 , 0.071 , 0.382 , 0.653 , 0.059 , 0.376 , 0.598 , 0.221 , 0.396 , 0.591
⨿ ˘ 3 0.120 , 0.365 , 0.718 , 0.142 , 0.221 , 0.689 , 0.286 , 0.342 , 0.733 , 0.092 , 0.422 , 0.693
Table 27. Weights associated with experts.
Table 27. Weights associated with experts.
W E 1 ( 0.63 , 0.15 , 0.23 ) ( 0.42 , 0.28 , 0.19 )
W E 2 ( 0.59 , 0.18 , 0.09 ) ( 0.36 , 0.41 , 0.13 )
W E 3 ( 0.81 , 0.07 , 0.13 ) ( 0.48 , 0.21 , 0.36 )
Table 28. Minimum and maximum reference weight.
Table 28. Minimum and maximum reference weight.
W E ( 0.59 , 0.18 , 0.23 ) ( 0.36 , 0.41 , 0.36 )
W E + ( 0.81 , 0.07 , 0.09 ) ( 0.48 , 0.21 , 0.18 )
Table 29. Distance table for relative proximity.
Table 29. Distance table for relative proximity.
d W E 1 , W E 0.1611
d W E 1 , W E + 0.18303
d W E 2 , W E 0.1904
d W E 2 , W E + 0.2423
d W E 3 , W E 0.2499
d W E 3 , W E + 0.1304
Table 30. Relative proximity coefficients.
Table 30. Relative proximity coefficients.
k Values
1 0.4681
2 0.4400
3 0.6571
sum 1.5652
Table 31. Criteria weights assigned by the experts.
Table 31. Criteria weights assigned by the experts.
Y 1 Y 2 Y 3
E 1 ( 0.367 , 0.284 , 0.490 ) ( 0.516 , 0.211 , 0.178 ) ( 0.245 , 0.387 , 0.421 ) ( 0.631 , 0.055 , 0.248 ) ( 0.481 , 0.332 , 0.271 ) ( 0.322 , 0.210 , 0.433 )
E 2 ( 0.251 , 0.365 , 0.418 ) ( 0.371 , 0.276 , 0.455 ) ( 0.167 , 0.385 , 0.480 ) ( 0.512 , 0.320 , 0.009 ) ( 0.672 , 0.024 , 0.218 ) ( 0.532 , 0.187 , 0.231 )
E 3 ( 0.210 , 0.376 , 0.422 ) ( 0.798 , 0.007 , 0.156 ) ( 0.292 , 0.328 , 0.473 ) ( 0.398 , 0.237 , 0.320 ) ( 0.527 , 0.271 , 0.119 ) ( 0.480 , 0.278 , 0.159 )
Table 32. Decision matrix by E 1 .
Table 32. Decision matrix by E 1 .
Y 1 Y 2 Y 3
U 1 ( 0.531 , 0.392 , 0.326 ) ( 0.424 , 0.283 , 0.317 ) ( 0.612 , 0.215 , 0.117 ) ( 0.317 , 0.421 , 0.284 ) ( 0.420 , 0.212 , 0.345 ) ( 0.823 , 0.135 , 0.089 )
U 2 ( 0.434 , 0.281 , 0.156 ) ( 0.291 , 0.353 , 0.115 ) ( 0.365 , 0.416 , 0.228 ) ( 0.813 , 0.056 , 0.133 ) ( 0.391 , 0.123 , 0.433 ) ( 0.611 , 0.136 , 0.247 )
U 3 ( 0.224 , 0.348 , 0.379 ) ( 0.593 , 0.186 , 0.345 ) ( 0.632 , 0.315 , 0.262 ) ( 0.154 , 0.423 , 0.391 ) ( 0.718 , 0.291 , 0.187 ) ( 0.384 , 0.241 , 0.412 )
Table 33. Decision matrix by E 2 .
Table 33. Decision matrix by E 2 .
Y 1 Y 2 Y 3
U 1 ( 0.522 , 0.178 , 0.231 ) ( 0.342 , 0.251 , 0.146 ) ( 0.418 , 0.232 , 0.179 ) ( 0.534 , 0.242 , 0.387 ) ( 0.623 , 0.156 , 0.241 ) ( 0.811 , 0.054 , 0.120 )
U 2 ( 0.489 , 0.234 , 0.156 ) ( 0.378 , 0.188 , 0.369 ) ( 0.554 , 0.210 , 0.114 ) ( 0.692 , 0.178 , 0.203 ) ( 0.257 , 0.316 , 0.345 ) ( 0.630 , 0.179 , 0.311 )
U 3 ( 0.812 , 0.109 , 0.089 ) ( 0.415 , 0.233 , 0.186 ) ( 0.723 , 0.129 , 0.159 ) ( 0.346 , 0.287 , 0.436 ) ( 0.628 , 0.195 , 0.249 ) ( 0.455 , 0.271 , 0.363 )
Table 34. Decision matrix by E 3 .
Table 34. Decision matrix by E 3 .
Y 1 Y 2 Y 3
U 1 ( 0.387 , 0.312 , 0.245 ) ( 0.562 , 0.089 , 0.431 ) ( 0.426 , 0.178 , 0.329 ) ( 0.516 , 0.119 , 0.230 ) ( 0.163 , 0.309 , 0.411 ) ( 0.589 , 0.178 , 0.254 )
U 2 ( 0.584 , 0.267 , 0.123 ) ( 0.287 , 0.344 , 0.461 ) ( 0.179 , 0.328 , 0.612 ) ( 0.451 , 0.245 , 0.361 ) ( 0.560 , 0.322 , 0.143 ) ( 0.811 , 0.131 , 0.067 )
U 3 ( 0.690 , 0.127 , 0.122 ) ( 0.389 , 0.287 , 0.497 ) ( 0.447 , 0.235 , 0.331 ) ( 0.567 , 0.107 , 0.213 ) ( 0.639 , 0.115 , 0.216 ) ( 0.383 , 0.264 , 0.419 )
Table 35. Aggregated decision matrix.
Table 35. Aggregated decision matrix.
Y 1 Y 2 Y 3
U 1 ( 0.475 , 0.313 , 0.262 ) ( 0.473 , 0.206 , 0.290 ) ( 0.493 , 0.207 , 0.204 ) ( 0.475 , 0.269 , 0.284 ) ( 0.433 , 0.237 , 0.336 ) ( 0.747 , 0.133 , 0.150 )
U 2 ( 0.519 , 0.263 , 0.141 ) ( 0.317 , 0.311 , 0.286 ) ( 0.384 , 0.328 , 0.284 ) ( 0.673 , 0.169 , 0.228 ) ( 0.450 , 0.283 , 0.255 ) ( 0.720 , 0.147 , 0.152 )
U 3 ( 0.667 , 0.185 , 0.156 ) ( 0.472 , 0.242 , 0.338 ) ( 0.604 , 0.239 , 0.251 ) ( 0.431 , 0.272 , 0.312 ) ( 0.663 , 0.214 , 0.215 ) ( 0.405 , 0.205 , 0.400 )
Table 36. Aggregated weights.
Table 36. Aggregated weights.
W Y 1 ( 0.278 , 0.347 , 0.440 ) ( 0.655 , 0.158 , 0.219 )
W Y 1 ( 0.249 , 0.363 , 0.459 ) ( 0.516 , 0.227 , 0.109 )
W Y 1 ( 0.565 , 0.244 , 0.180 ) ( 0.459 , 0.237 , 0.238 )
Table 37. Values of P + and P .
Table 37. Values of P + and P .
P + 0.667 , 0.185 , 0.141 ) ( 0.747 , 0.133 , 0.150 )
P ( 0.384 , 0.328 , 0.336 ) ( 0.317 , 0.311 , 0.400 )
Table 38. Relative performance.
Table 38. Relative performance.
d [ P 11 , P + ] = 0.2897 d [ P 11 , P ] = 0.1753 f 11 = 0.3769
d [ P 12 , P + ] = 0.2694 d [ P 12 , P ] = 0.2051 f 12 = 0.4322
d [ P 13 , P + ] = 0.2185 d [ P 13 , P ] = 0.3806 f 13 = 0.6353
d [ P 21 , P + ] = 0.3627 d [ P 21 , P ] = 0.1917 f 21 = 0.3458
d [ P 22 , P + ] = 0.2587 d [ P 22 , P ] = 0.2993 f 22 = 0.5364
d [ P 23 , P + ] = 0.1879 d [ P 23 , P ] = 0.3631 f 23 = 0.6590
d [ P 31 , P + ] = 0.2481 d [ P 31 , P ] = 0.2877 f 31 = 0.5370
d [ P 32 , P + ] = 0.2867 d [ P 32 , P ] = 0.2071 f 32 = 0.4194
d [ P 33 , P + ] = 0.3090 d [ P 33 , P ] = 0.2495 f 33 = 0.4467
Table 39. Values for superiority and inferiority.
Table 39. Values for superiority and inferiority.
S 12 = 0.01 I 12 = 0.01
S 13 = 0.01 I 13 = 0.01
S 21 = 0 I 21 = 0.02
S 22 = 0.02 I 22 = 0
S 23 = 0.02 I 23 = 0
S 31 = 0.02 I 31 = 0
S 32 = 0 I 32 = 0.02
S 33 = 0 I 33 = 0.02
Table 40. Superiority index and inferiority index values.
Table 40. Superiority index and inferiority index values.
Sr. No. F P i K F P i K
1 ( 0.6202 , 0.0519 , 0.3900 ) ( 0.1049 , 0.0434 , 0.3884 ) ( 0.6202 , 0.0519 , 0.3900 ) ( 0.1049 , 0.0434 , 0.3884 )
2 ( 0.0945 , 0.0693 , 0.9513 ) ( 0.1042 , 0.0538 , 0.9295 ) ( 0.0401 , 0.0528 , 0.9837 ) ( 0.1056 , 0.0297 , 0.9701 )
3 ( 0.0401 , 0.0528 , 0.9837 ) ( 0.1056 , 0.0297 , 0.9701 ) ( 0.0945 , 0.0693 , 0.9513 ) ( 0.1042 , 0.0538 , 0.9295 )
Table 41. Superiority rankings.
Table 41. Superiority rankings.
FunctionScore ValueRank
F P 1 K −0.87842
F P 2 K 0.04411
F P 3 K −0.94983
Table 42. Inferiority rankings.
Table 42. Inferiority rankings.
FunctionScore ValueRank
F P 1 K −0.94983
F P 2 K 0.04411
F P 3 K −0.87842
Table 43. Score values of alternatives.
Table 43. Score values of alternatives.
S P 1 S P 2 S P 3
P 1 k 0.0781 0.1156 0.2681
P 2 k 0.0511 0.1658 0.2655
P 3 k 0.2182 0.1296 0.1548
Table 44. Ranking of alternatives vs. criterion.
Table 44. Ranking of alternatives vs. criterion.
S P 1 S P 2 S P 3
1st P 3 k P 2 k P 1 k
2nd P 1 k P 1 k P 2 k
3rd P 2 k P 3 k P 3 k
Table 45. Rank frequency.
Table 45. Rank frequency.
1st2nd3rd
P 1 k 120
P 2 k 111
P 3 k 102
Table 46. Rank frequency (weighted).
Table 46. Rank frequency (weighted).
1st2nd3rd
P 1 k 0.34630.65370
P 2 k 0.35620.34630.2975
P 3 k 0.297500.7025
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Kausar, R.; Tanveer, S.; Riaz, M.; Pamucar, D.; Goran, C. Topological Data Analysis of m-Polar Spherical Fuzzy Information with LAM and SIR Models. Symmetry 2022, 14, 2216. https://doi.org/10.3390/sym14102216

AMA Style

Kausar R, Tanveer S, Riaz M, Pamucar D, Goran C. Topological Data Analysis of m-Polar Spherical Fuzzy Information with LAM and SIR Models. Symmetry. 2022; 14(10):2216. https://doi.org/10.3390/sym14102216

Chicago/Turabian Style

Kausar, Rukhsana, Shaista Tanveer, Muhammad Riaz, Dragan Pamucar, and Cirovic Goran. 2022. "Topological Data Analysis of m-Polar Spherical Fuzzy Information with LAM and SIR Models" Symmetry 14, no. 10: 2216. https://doi.org/10.3390/sym14102216

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