Placemaking strategies in greening Universiti Malaya Main Library

1.   Introduction

Uncertainty can be present in nearly every aspect of contemporary problems. To deal with the uncertainties, numerous uncertainty theories are available, including the fuzzy set (FS) ^[1], the intuitionistic FS (IFS) ^[2], the Pythagorean FS (PFS) ^[3,4], the neutrosophic set (NSS) ^[5], and the Fermatean fuzzy set (FFS) ^[6]. An element of a fuzzy set (FS), introduced by Zadeh ^[1], has a corresponding membership degree (MD). Later, Atanassov ^[2] introduced the concept of an IFS. According to Yager ^[4], the concept of PFSs was originally established in 2014, and it is classified by an MD and degree of non-membership (NMD) that satisfy the criterion, "that the sum of the squares of its MD and NMD is less than 1". Unfortunately, if the square sum of the MD and NMD of a certain property exceeds 1, decision making (DM) becomes problematic. Senapati et al. ^[6] proposed the concept of an FFS in 2019 and condition that the cubic total of the MD and NMD cannot exceed 1. Rahman et al. ^[7] utilized geometric AOs on interval-valued PFS (IVPFS) to approach DM problems in various geometric AOs on IVPFS. Rahman et al. ^[8] developed a method for MAGDM employing induced IVPFS with Einstein AO.

The TOPSIS process requires obtaining a preference order that is prioritized by relative proximity, calculating distances to the different ideal solutions, and combining these two distance measures. In 2018, Akram et al. ^[9] proposed the bipolar FS employing TOPSIS for group decision making (GDM). Adeel et al. ^[10] proposed the $m$-polar fuzzy linguistic TOPSIS technique for MCGDM. In 2018, Peng and Dai ^[11] generated the concept of single-valued neutrosophic set (NSS) using MABAC and TOPSIS. Zhang and Xu ^[12] reported an extension of PFS using TOPSIS. Hwang et al. ^[13] offered a practical explanation of the MADM concept. Jana et al. ^[14] discussed PFS using Dombi aggregating operators (AOs) in 2019. Ullah et al. ^[15] talked about complex PFS and the usage of pattern recognition in 2019. Jana et al. ^[16] for developed the Trapezoidal NSS using AOs and their application to the MADM in 2020. Jana et al. ^[17] proposed the idea of the MCDM technique based on SVTrN Dombi AOs. Yang et al. ^[18] described fuzzy c-numbers clustering algorithms for fuzzy data in 1996. Palanikumar et al. ^[19] investigated several algebraic structures and their applications in several studies. NSS is a recent theory that is attributed to Smarandache ^[5]. The term neutrosophy is defined as knowledge of the neutral mind and the neutrality that differentiates FS from IFS. Each element's of truth degree (TD), indeterminacy degree (ID) and false degree (FD) are represented by NSS, and they range from $0$ to $1$. The NSS approach generalizes the FS and IVFS. Smarandache et al. ^[20] established a new concept for Pythagorean neutrosophic sets with an interval-valued set. Using context analysis ^[21] and the NSS, a medical diagnosis can be made using the single-valued NSS ^[22]. The distances for IFSs, such as Hamming distance (HD), Euclidean distance (ED) normalized HD, and normalized ED, were expanded by Ejegwa ^[23]. It has been demonstrated that a NSS generalizes a classical set, FS and IVFS. The Pythagorean neutrosophic interval-valued set (PyNSIVS) was developed by Smarandache et al. ^[20]. The single-valued NSS is discussed using context analysis ^[21] and medical diagnosis ^[22]. Ejegwa ^[23] extended the distance measures for IFSs, such as HD, ED normalized HD and normalized ED. Recently, Palanikumar et al. ^[24] discussed the MADM using spherical vague normal operators and their applications for the selection of farmers. Recently, Garg et al. ^[25] discussed the new notion of confidence levels-based cubic Fermatean fuzzy AOs and their application to MCDM problems. Chakraborty et al. ^[26] discussed the real life applications based on Fermatean fuzzy Bonferroni mean AOs for selecting optimal health care waste treatment technology. Zeb et al. ^[27] interacted with the Fermatean fuzzy soft AOs and their application in symptomatic treatment of COVID-19. Khan et al. ^[28] discussed the concept of generalized neutrosophic cubic AOs using MADM method.

In order to better understand Type-Ⅱ Fermatean normal number (Type-Ⅱ FNN) information, this study will expand on the idea of Type-Ⅱ Fermatean information. We can get Type-Ⅱ FN data from AOs. This paper consists of seven sections. In Section 2, you will find a concise overview of Type-Ⅱ Fermatean information. A Type-Ⅱ FNN MADM is discussed in Section 3 for different AOs. For various AOs, Type-Ⅱ FNN MADM is discussed in Section 4. Section 5 presents an example, analysis, and discussion of a method based on Type-Ⅱ FNN. In Section 6, a conclusion is presented. In decision making, we may have one problem

So, we introduced the condition that

Consequently, this work makes the following contributions:

$(1)$ It has been established that Type-Ⅱ FNN satisfy some basic algebraic operations, such as associative, distributive and idempotent laws.

$(2)$ We introduced HD and ED for Type-Ⅱ FNNs. In order to calculate the ED between two Type-Ⅱ FNNs. Furthermore, there is a discussion regarding converting Type-Ⅱ FNNs to NFNs.

$(3)$ It is demonstrated numerically how MADMs and AOs are applied in Type-Ⅱ FNN to real-world scenarios. A Type-Ⅱ FNN algorithm needs to be developed. We also need to determine a normalized decision matrix using a Type-Ⅱ FNN algorithm.

$(4)$ In relation to Type-Ⅱ FNWA, Type-Ⅱ FNWG, Type-Ⅱ GFNWA, and Type-Ⅱ GFNWG. We determined the ideal value of each concept.

$(5)$ By using the Type-Ⅱ FNWA, Type-Ⅱ FNWG, Type-Ⅱ GFNWA, and Type-Ⅱ GFNWG operators, different ranking results of alternatives can be derived flexibly, so that a decision-maker may select the ranking result according to his or her preferences. Due to its strong flexibility, the method proposed in this paper is appealing. The results of the DM are based on integer $\delta$.

2.   Basic concepts

We discuss some common definitions in this section.

Definition 2.1. ^[4] Let $\Theta$ be a universe. The PyFS $\Xi$ in $\Theta$ is $\Xi = \Big\{\varepsilon, \big\langle \tau^{{t}}_{\Xi}(\varepsilon), \tau^{{f}}_{\Xi}(\varepsilon)\big\rangle \big| \varepsilon\in \Theta\Big\}$, where $\tau^{{t}}_{\Xi}: \Theta \rightarrow [0, 1]$ and $\tau^{{f}}_{\Xi}: \Theta\rightarrow [0, 1]$ denotes the MD and NMD of $\varepsilon\in \Theta$ to $\Xi$, respectively, and $0 \preceq (\tau^{{t}}_{\Xi}(\varepsilon))^{2}+(\tau^{{f}}_{\Xi}(\varepsilon))^{2} \preceq 1$. For convenience, $\Xi = \big\langle \tau^{{t}}_{\Xi}, \tau_{\Xi}^{{f}} \big\rangle$ is called the Pythagorean fuzzy number (PyFN).

Definition 2.2. ^[5] The NSS $\Xi$ in $\Theta$ is $\Xi = \Big\{\varepsilon, \big\langle \tau^{{t}}_{\Xi}(\varepsilon), \tau^{{i}}_{\Xi}(\varepsilon), \tau^{{f}}_{\Xi}(\varepsilon)\big\rangle \big| \varepsilon\in \Theta\Big\}$, where $\tau^{{t}}_{\Xi}: \Theta \rightarrow [0, 1]$, $\tau^{{i}}_{\Xi}: \Theta \rightarrow [0, 1]$ and $\tau^{{f}}_{\Xi}: \Theta \rightarrow [0, 1]$ denotes the TD, ID and FD of $\varepsilon\in \Theta$ to $\Xi$, respectively and $0 \preceq \tau^{{t}}_{\Xi}(\varepsilon) + \tau^{{i}}_{\Xi}(\varepsilon)+ \tau^{{f}}_{\Xi}(\varepsilon) \preceq 3$. Here, $\Xi = \big\langle \tau^{{t}}_{\Xi}, \tau^{{i}}_{\Xi}, \tau_{\Xi}^{{f}} \big\rangle$ represents a neutrosophic number (NSN).

Definition 2.3. ^[20] The Pythagorean NSS (PyNSS) $\Xi$ in $\Theta$ is $\Xi = \Big\{\varepsilon, \big\langle \tau^{{t}}_{\Xi}(\varepsilon), \tau^{{i}}_{\Xi}(\varepsilon), \tau^{{f}}_{\Xi}(\varepsilon)\big\rangle \big|\varepsilon\in \Theta\Big\}$, where $\tau^{{t}}_{\Xi}: \Theta \rightarrow [0, 1]$, $\tau^{{i}}_{\Xi}: \Theta \rightarrow [0, 1]$ and $\tau^{{f}}_{\Xi}: \Theta \rightarrow [0, 1]$ denotes the TD, ID and FD of $\varepsilon\in \Theta$ to $\Xi$, respectively, and $0 \preceq (\tau^{{t}}_{\Xi}(\varepsilon))^{2}+(\tau^{{i}}_{\Xi}(\varepsilon))^{2} +(\tau^{{f}}_{\Xi}(\varepsilon))^{2} \preceq 2$. Here, $\Xi = \big\langle \tau^{{t}}_{\Xi}, \tau^{{i}}_{\Xi}, \tau_{\Xi}^{{f}} \big\rangle$ represents a Pythagorean neutrosophic number (PyNSN).

Definition 2.4. ^[6] A FFS $\Xi$ in $\Theta$ is $\Xi = \Big\{\varepsilon, \big\langle \tau^{{t}}_{\Xi}(\varepsilon), \tau^{{f}}_{\Xi}(\varepsilon)\big\rangle \big|\varepsilon\in \Theta\Big\}$, where $\tau^{{t}}_{\Xi}(\varepsilon)$ and $\tau^{{f}}_{\Xi}(\varepsilon)$ denotes MD and NMD of $u$ respectively, where $\tau^{{t}}_{\Xi}: \Theta \rightarrow [0, 1]$ and $\tau^{{f}}_{\Xi} : \Theta \rightarrow [0, 1]$ and $0 \preceq (\tau^{{t}}_{\Xi}(\varepsilon))^{3}+(\tau^{{f}}_{\Xi}(\varepsilon))^{3} \preceq 1$. Here, $\Xi = \big\langle \tau^{{t}}_{\Xi}, \tau_{\Xi}^{{f}} \big\rangle$ represents a Fermatean fuzzy number (FFN).

Definition 2.5. ^[6] For any FFNs, $\Xi = \langle \tau^{{t}}, \tau^{{f}}\rangle$, $\Xi_{1} = \langle \tau^{{t}}_{1}, \tau^{{f}}_{1} \rangle$ and $\Xi_{2} = \langle \tau^{{t}}_{2}, \tau^{{f}}_{2} \rangle$. Let $\tau^{{t}}, \tau^{{f}}$ denote MD and NMD of $u$, respectively, and $\delta$ is a positive integer. Then,

(1) $\Xi_{1}\oslash \Xi_{2} = \begin{pmatrix} \sqrt[3]{(\tau^{{t}}_{1})^{3} + (\tau^{{t}}_{2})^{3} -(\tau^{{t}}_{1})^{3} \cdot (\tau^{{t}}_{2})^{3}}, (\tau^{{f}}_{1}\cdot\tau^{{f}}_{2}) \end{pmatrix}$.

(2) $\Xi_{1} \circledast \Xi_{2} = \begin{pmatrix} (\tau^{{t}}_{1}\cdot \tau^{{t}}_{2}), \sqrt[3]{(\tau^{{f}}_{1})^{3} + (\tau^{{f}}_{2})^{3} -(\tau^{{f}}_{1})^{3} \cdot (\tau^{{f}}_{2})^{3}} \end{pmatrix}$.

(3) $\delta \cdot\Xi = \begin{pmatrix} \sqrt[3]{1-\big(1- (\tau^{{t}})^{3}\big)^{\delta}}, (\tau^{{f}})^{\delta} \end{pmatrix}$.

(4) $\Xi^{\delta} = \begin{pmatrix} (\tau^{{t}})^{\delta}, \sqrt[3]{1-\big(1- (\tau^{{f}})^{3}\big)^{\delta}}\, \, \end{pmatrix}$.

Definition 2.6. ^[6] Let $\Xi = \big\langle \tau^{{t}}, \tau^{{f}} \big\rangle$ be a FFN. Then, $S(\Xi) = (\tau^{{t}})^{3} - (\tau^{{f}})^{3}, \, \, S(\Xi)\in [-1, 1]$, is called the score function, and $H(\Xi) = (\tau^{{t}})^{3} +(\tau^{{f}})^{3}, \, \, H(\Xi)\in [0, 1]$, is called the accuracy function.

Definition 2.7. ^[18] Let $M_{1} = (\upsilon_{1}, \varsigma_{1})$ and $M_{2} = (\upsilon_{2}, \varsigma_{2})$ and then the distance between $M_{1}$ and $M_{2}$ is $\mathscr{\mho}(M_{1}, M_{2}) = \sqrt[2]{(\upsilon_{1}-\upsilon_{2})^{2} + \frac{1}{2}(\varsigma_{1}-\varsigma_{2})^{2}}$.

Definition 2.8. ^[18] Let $M(x) = e^{-\big(\frac{x-\upsilon}{\varsigma}\big)^{2}}, (\varsigma > 0)$, be a fuzzy number (FN). It is said to be a normal fuzzy number (NFN) if $M = (\upsilon, \varsigma)$, and $\mathbb{N}$.

3.   Distance measure for Type-Ⅱ FNN

We discuss the distance between two Type-Ⅱ Fermatean normal numbers (Type-Ⅱ FNNs) in this section.

Definition 3.1. A Type-II Fermatean set $\Xi$ in $\Theta$ is $\Xi = \Big\{\varepsilon, \big\langle \tau^{{t}}_{\Xi}(\varepsilon), \tau^{{i}}_{\Xi}(\varepsilon), \tau^{{f}}_{\Xi}(\varepsilon)\big\rangle$ $\big| \varepsilon\in \Theta\Big\}$, where $\tau^{{t}}_{\Xi}(\varepsilon)$, $\tau^{{i}}_{\Xi}(\varepsilon)$ and $\tau^{{f}}_{\Xi}(\varepsilon)$ are called TD, ID and FD of $\Xi$, respectively. The mapping $\tau^{{t}}_{\Xi}: \Theta \rightarrow [0, 1]$, $\tau^{{i}}_{\Xi} : \Theta \rightarrow [0, 1]$, $\tau^{{f}}_{\Xi} : \Theta \rightarrow [0, 1]$, and $0 \preceq (\tau^{{t}}_{\Xi}(\varepsilon))^{3}+(\tau^{{i}}_{\Xi}(\varepsilon))^{3} +(\tau^{{f}}_{\Xi}(\varepsilon))^{3} \preceq 2$. Here, $\Xi = \big\langle \tau^{{t}}_{\Xi}, \tau^{{i}}_{\Xi}, \tau_{\Xi}^{{f}} \big\rangle$ represents a Type-II Fermatean number (Type-II FN).

Definition 3.2. Let $(\upsilon, \varsigma) \in \mathbb{N}$, $\Xi = \big\langle (\upsilon, \varsigma); \tau^{{t}}, \tau^{{i}}, \tau^{{f}}\big\rangle$ is a Type-II FNN, where its TD, ID and FD are defined as $\tau_{\Xi}^{{t}} = \tau_{\Xi}^{{t}} e^{-\big(\frac{x-\upsilon}{\varsigma}\big)^{3}}$, $\tau_{\Xi}^{{i}} = \tau_{\Xi}^{{i}} e^{-\big(\frac{x-\upsilon}{\varsigma}\big)^{3}}$ and $\tau_{\Xi}^{{f}} = 1-\big(1-\tau_{\Xi}^{{f}}\big) e^{-\big(\frac{x-\upsilon}{\varsigma}\big)^{3}}$, $x \in X$, respectively, where $X$ is a non-empty set, $\tau_{\Xi}^{{t}}, \tau_{\Xi}^{{i}}, \tau_{\Xi}^{{f}}\in [0, 1]$, and $0 \preceq \big(\tau_{\Xi}^{{t}}(x)\big)^{3} + \big(\tau_{\Xi}^{{i}}(x)\big)^{3}+ \big(\tau_{\Xi}^{{f}}(x)\big)^{3} \preceq 2$.

Definition 3.3. If $\Xi_{1} = \big\langle (\upsilon_{1}, \varsigma_{1}); \tau^{{t}}_{1}, \tau^{{i}}_{1}, \tau^{{f}}_{1} \big\rangle$ and $\Xi_{2} = \big\langle (\upsilon_{2}, \varsigma_{2}); \tau^{{t}}_{2}, \tau^{{i}}_{2}, \tau^{{f}}_{2} \big\rangle$ are any two Type-II FNNs, and $\delta$ is a positive integer. Then,

(1) $\Xi_{1}\oslash \Xi_{2} = \begin{pmatrix} (\upsilon_{1} + \upsilon_{2}, \varsigma_{1} + \varsigma_{2}); \sqrt[3\delta]{(\tau^{{t}}_{1})^{3\delta} + (\tau^{{t}}_{2})^{3\delta} -(\tau^{{t}}_{1})^{3\delta} \cdot (\tau^{{t}}_{2})^{3\delta}}, \\ \sqrt[\delta]{(\tau^{{i}}_{1})^{\delta} + (\tau^{{i}}_{2})^{\delta} -(\tau^{{i}}_{1})^{\delta} \cdot (\tau^{{i}}_{2})^{\delta}}, (\tau^{{f}}_{1}\cdot \tau^{{f}}_{2}) \end{pmatrix}$.

(2) $\Xi_{1} \circledast \Xi_{2} = \begin{pmatrix} (\upsilon_{1} \cdot \upsilon_{2}, \varsigma_{1} \cdot \varsigma_{2}); (\tau^{{t}}_{1}\cdot \tau^{{t}}_{2}), \sqrt[\delta]{(\tau^{{i}}_{1})^{\delta} + (\tau^{{i}}_{2})^{\delta} -(\tau^{{i}}_{1})^{\delta} \cdot (\tau^{{i}}_{2})^{\delta}}, \\ \sqrt[3\delta]{(\tau^{{f}}_{1})^{3\delta} + (\tau^{{f}}_{2})^{3\delta} -(\tau^{{f}}_{1})^{3\delta} \cdot (\tau^{{f}}_{2})^{3\delta}} \end{pmatrix}$.

(3) $\delta \cdot \Xi_{1} = \begin{pmatrix} (\delta \cdot \upsilon_{1}, \delta \cdot \varsigma_{1}); \sqrt[3\delta]{1-\big(1- (\tau^{{t}}_{1})^{3\delta}\big)^{\delta}}, (\tau^{{i}}_{1})^{\delta}, (\tau^{{f}}_{1})^{\delta} \end{pmatrix}$.

(4) $\Xi_{1}^{\delta} = \begin{pmatrix} (\upsilon_{1}^{\delta}, \varsigma_{1}^{\delta}); (\tau^{{t}}_{1})^{\delta}, (\tau^{{i}}_{1})^{\delta}, \sqrt[3\delta]{1-\big(1- (\tau^{{f}}_{1})^{3\delta}\big)^{\delta}}\, \, \end{pmatrix}$.

We now define the ensuing theorem in terms of the operator mentioned earlier.

Theorem 3.1. Let $\Xi_{1} = \big\langle (\upsilon_{1}, \varsigma_{1}); \tau^{{t}}_{1}, \tau^{{i}}_{1}, \tau^{{f}}_{1} \big\rangle$, $\Xi_{2} = \big\langle (\upsilon_{2}, \varsigma_{2}); \tau^{{t}}_{2}, \tau^{{i}}_{2}, \tau^{{f}}_{2} \big\rangle$ and $\Xi_{3} = \big\langle (\upsilon_{3}, \varsigma_{3}); \tau^{{t}}_{3}, \tau^{{i}}_{3}, \tau^{{f}}_{3} \big\rangle$ be the Type-II FNNs. Then,

(1) $\Xi_{1} \oslash \Xi_{2} = \Xi_{2} \oslash \Xi_{1}$.

(2) $(\Xi_{1} \oslash \Xi_{2})\oslash {\Xi_{3}} = \Xi_{1} \oslash (\Xi_{2}\oslash {\Xi_{3}})$.

(3) $\Xi_{1} \circledast \Xi_{2} = \Xi_{2} \circledast \Xi_{1}$.

(4) $(\Xi_{1} \circledast \Xi_{2})\circledast {\Xi_{3}} = \Xi_{1} \circledast (\Xi_{2}\circledast {\Xi_{3}})$.

Proof. The proofs are straightforward.

Definition 3.4. Let $\Xi_{1} = \big\langle (\upsilon_{1}, \varsigma_{1}); \tau^{{t}}_{1}, \tau^{{i}}_{1}, \tau^{{f}}_{1} \big\rangle$ and $\Xi_{2} = \big\langle (\upsilon_{2}, \varsigma_{2}); \tau^{{t}}_{2}, \tau^{{i}}_{2}, \tau^{{f}}_{2} \big\rangle$ be the Type-II FNNs. Then, the ED between $\Xi_{1}$ and $\Xi_{2}$ is

The HD between $\Xi_{1}$ and $\Xi_{2}$ is

Theorem 3.2. Let $\Xi_{1} = \big\langle (\upsilon_{1}, \varsigma_{1}); \tau^{{t}}_{1}, \tau^{{i}}_{1}, \tau^{{f}}_{1} \big\rangle$, $\Xi_{2} = \big\langle (\upsilon_{2}, \varsigma_{2}); \tau^{{t}}_{2}, \tau^{{i}}_{2}, \tau^{{f}}_{2} \big\rangle$ and ${\Xi_{3}} = \big\langle (\upsilon_{3}, \varsigma_{3}); \tau^{{t}}_{3}, \tau^{{i}}_{3}, \tau^{{f}}_{3} \big\rangle$ be any three Type-II FNNs. Then,

(1) $\mathscr{\mho}_{\mathscr{E}}(\Xi_{1}, \Xi_{2}) = 0$ if and only if $\Xi_{1} = \Xi_{2}$.

(2) $\mathscr{\mho}_{\mathscr{E}}(\Xi_{1}, {\Xi_{3}}) \preceq \mathscr{\mho}_{\mathscr{E}}(\Xi_{1}, \Xi_{2}) + \mathscr{\mho}_{\mathscr{E}}(\Xi_{2}, {\Xi_{3}})$.

Proof. We will prove (2). Now,

Here, $\Phi_{1} = \frac{1+(\tau^{{t}}_{1})^{3}+(\tau^{{i}}_{1})^{3}- (\tau^{{f}}_{1})^{3}}{3}, \Phi_{2} = \frac{1+(\tau^{{t}}_{2})^{3}+ (\tau^{{i}}_{2})^{3}-(\tau^{{f}}_{2})^{3}}{3}$ and $\Phi_{3} = \frac{1+(\tau^{{t}}_{3})^{3}+(\tau^{{i}}_{3})^{3}- (\tau^{{f}}_{3})^{3}}{3}$.

Thus, $\mathscr{\mho}_{\mathscr{E}}(\Xi_{1}, {\Xi_{3}}) \preceq \mathscr{\mho}_{\mathscr{E}}(\Xi_{1}, \Xi_{2}) + \mathscr{\mho}_{\mathscr{E}}(\Xi_{2}, {\Xi_{3}})$.

Theorem 3.3. For any three Type-II FNNs $\Xi_{1} = \big\langle (\upsilon_{1}, \varsigma_{1}); \tau^{{t}}_{1}, \tau^{{i}}_{1}, \tau^{{f}}_{1} \big\rangle$, $\Xi_{2} = \big\langle (\upsilon_{2}, \varsigma_{2}); \tau^{{t}}_{2}, \tau^{{i}}_{2}, \tau^{{f}}_{2} \big\rangle$ and ${\Xi_{3}} = \big\langle (\upsilon_{3}, \varsigma_{3}); \tau^{{t}}_{3}, \tau^{{i}}_{3}, \tau^{{f}}_{3} \big\rangle$,

(1) $\mathscr{\mho}_{\mathscr{H}}(\Xi_{1}, \Xi_{2}) = 0$ if and only if $\Xi_{1} = \Xi_{2}$.

(2) $\mathscr{\mho}_{\mathscr{H}}(\Xi_{1}, \Xi_{2}) = \mathscr{\mho}_{\mathscr{H}}(\Xi_{2}, \Xi_{1})$.

(3) $\mathscr{\mho}_{\mathscr{H}}(\Xi_{1}, {\Xi_{3}}) \preceq \mathscr{\mho}_{\mathscr{H}}(\Xi_{1}, \Xi_{2}) + \mathscr{\mho}_{\mathscr{H}}(\Xi_{2}, {\Xi_{3}})$.

Remark 3.1. Since $\Xi_{1} = \big\langle \tau^{{t}}_{1}, \tau^{{i}}_{1}, \tau^{{f}}_{1} \big\rangle = \langle 1, 1, 0 \rangle$, $\Xi_{2} = \big\langle \tau^{{t}}_{2}, \tau^{{i}}_{2}, \tau^{{f}}_{2} \big\rangle = \langle 1, 1, 0 \rangle$. Then, the distance between Type-II FNN is transformed to the distance between NFN.

4.   Aggregation operators for Type-Ⅱ FNN

We introduced the new AOs for Type-Ⅱ FNN in this section.

4.1.   Type-Ⅱ FN weighted averaging (Type-Ⅱ FNWA) operator

Definition 4.1. Let $\Xi_{p} = \big\langle (\upsilon_{p}, \varsigma_{p}); \tau^{{t}}_{p}, \tau^{{i}}_{p}, \tau^{{f}}_{p} \big\rangle$ be the Type-II FNNs, where $p = 1, 2, ..., n$, $\xi_{p}$ be a weight of $\Xi_{p}$ and $\xi_{p} \succeq 0$, $\sum^{n}_{p = 1} \xi_{p} = 1$. Then, Type-II FNWA$(\Xi_{1}, \Xi_{2}, ..., \Xi_{n}) = \sum^{n}_{p = 1} \xi_{p}\Xi_{p}$.

Theorem 4.1. Let $\Xi_{p} = \big\langle (\upsilon_{p}, \varsigma_{p}); \tau^{{t}}_{p}, \tau^{{i}}_{p}, \tau^{{f}}_{p} \big\rangle$ be Type-II FNNs, where $p = 1, 2, ..., n$. Then,

Proof. The mathematical induction method yields the proof.

If $n = 2$, Type-Ⅱ FNWA$(\Xi_{1}, \Xi_{2}) = \xi_{1} \Xi_{1} \oslash \xi_{2}\Xi_{2}$, where,

and

Using Definition 3.3, we get

Using induction, $n \succeq 3$,

If $n = k+1$,

It holds for any $k$.

Theorem 4.2. If $\Xi_{p} = \big\langle (\upsilon_{p}, \varsigma_{p}); \tau^{{t}}_{p}, \tau^{{i}}_{p} \tau^{{f}}_{p} \big\rangle$ are Type-II FNNs, and $\Xi_{p} = \Xi$, then Type-II FNWA $(\Xi_{1}, \Xi_{2}, ..., \Xi_{n}) = \Xi$, where $p = 1, 2, ..., n$.

Proof. Given that, $(\upsilon_{p}, \varsigma_{p}) = (\upsilon, \varsigma)$, $(\tau^{{t}}_{p}, \tau^{{i}}_{p}, \tau^{{f}}_{p}) = (\tau^{{t}}, \tau^{{i}}, \tau^{{f}})$, for $p = 1, 2, ..., n$ and $\sum^{n}_{p = 1}{\xi_{p}} = 1$. By using Definition 3.3, we get,

4.2.   Type-Ⅱ FN weighted geometric (Type-Ⅱ FNWG) operator

We define the Type-Ⅱ FN weighted geometric operator (Type-Ⅱ FNWG) in this section.

Definition 4.2. Let $\Xi_{p} = \big\langle(\upsilon_{p}, \varsigma_{p}); \tau^{{t}}_{p}, \tau^{{i}}_{p}, \tau^{{f}}_{p}\big\rangle$ be the Type-II FNNs and $\xi_{p}$ be a weight of $\Xi_{p}$. Then Type-II FNWG $(\Xi_{1}, \Xi_{2}, ..., \Xi_{n}) = \prod^{n}_{p = 1} \Xi_{p}^{\xi_{p}}$, where $p = 1, 2, ..., n$.

Theorem 4.3. If $\Xi_{p} = \big\langle (\upsilon_{p}, \varsigma_{p}); \tau^{{t}}_{p}, \tau^{{f}}_{p} \big\rangle$ are Type-II FNNs where $p = 1, 2, ..., n$, then

Proof. The mathematical induction method yields the proof.

If $n = 2$, Type-Ⅱ FNWG$(\Xi_{1}, \Xi_{2}) = \Xi_{1}^{\xi_{1}} \circledast \Xi_{2}^{\xi_{2}}$, where,

By using Definition 3.3, we get,

Hence,

For $n = k \succeq 3$,

If $n = k+1$,

Corollary 4.1. Let $\Xi_{p} = \big\langle (\upsilon_{p}, \varsigma_{p}); \tau^{{t}}_{p}, \tau^{{i}}_{p} \tau^{{f}}_{p} \big\rangle$ be Type-II FNNs, and all are equal with $\Xi_{p} = \Xi$. Then Type-II FNWG$(\Xi_{1}, \Xi_{2}, ..., \Xi_{n}) = \Xi$.

4.3.   Type-Ⅱ generalized FNWA (Type-Ⅱ GFNWA) operator

We define the Type-Ⅱ generalized FNWA operator in this section.

Definition 4.3. Let $\Xi_{p} = \big\langle (\upsilon_{p}, \varsigma_{p}); \tau^{{t}}_{p}, \tau^{{i}}_{p}, \tau^{{f}}_{p} \big\rangle$ be Type-II FNNs and $\xi_{p}$ be a weight of $\Xi_{p}$ for $p = 1, 2, ..., n$. Then, Type-II GFNWA$(\Xi_{1}, \Xi_{2}, ..., \Xi_{n}) = \Big(\sum^{n}_{p = 1} \xi_{p}\Xi_{p}^{\delta} \Big)^{1/\delta}$.

Theorem 4.4. Let $\Xi_{p} = \big\langle (\upsilon_{p}, \varsigma_{p}); \tau^{{t}}_{p}, \tau^{{i}}_{p}, \tau^{{f}}_{p} \big\rangle$ be the Type-II FNNs. Then,

Proof. The mathematical induction procedure leads to the proof. Let us first demonstrate that,

If $n = 2$, then

and

By using Definition 3.3, we get,

In general,

If $n = k+1, \sum^{k}_{p = 1} \xi_{p}\Xi_{p}^{\delta} +\xi_{k+1} \Xi_{k+1}^{\delta} = \sum^{k+1}_{p = 1} \xi_{p}\Xi_{p}^{\delta}.$

Hence,

and

This theorem holds for any $k\in \mathbb{N}$.

Remark 4.1. If $\delta = 1$, then the Type-Ⅱ GFNWA is converted to the Type-II FNWA.

Corollary 4.2. Let $\Xi_{p} = \big\langle (\upsilon_{p}, \varsigma_{p}); \tau^{{t}}_{p}, \tau^{{i}}_{p} \tau^{{f}}_{p} \big\rangle$, where $p = 1, 2, ..., n$, be Type-II FNNs, and all are equal with $\Xi$. Prove that Type-II GFNWA $(\Xi_{1}, \Xi_{2}, ..., \Xi_{n}) = \Xi$.

4.4.   Type-Ⅱ Generalized FNWG (Type-Ⅱ GFNWG) operator

We define the Type-Ⅱ generalized FNWG operator in this section.

Definition 4.4. Let $\Xi_{p} = \big\langle (\upsilon_{p}, \varsigma_{p}); \tau^{{t}}_{p}, \tau^{{i}}_{p}, \tau^{{f}}_{p} \big\rangle$ be Type-II FNNs and $\xi_{p}$ be a weight of $\Xi_{p}$, where $p = 1, 2, ..., n$. Then, Type-II GFNWG$(\Xi_{1}, \Xi_{2}, ..., \Xi_{n}) = \frac{1}{\delta}\Big(\prod^{n}\limits_{p = 1} (\delta \Xi_{p})^{\xi_{p}} \Big)$.

Theorem 4.5. Let $\Xi_{p} = \big\langle (\upsilon_{p}, \varsigma_{p}); \tau^{{t}}_{p}, \tau^{{i}}_{p}, \tau^{{f}}_{p} \big\rangle$ be a collection of Type-II FNNs. Then,

Proof. Mathematical induction leads to the proof. Let us first demonstrate that

If $n = 2$, then

and

By using Definition 3.3, we get

If $n = k$,

If $n = k+1$, then

Now,

Remark 4.2. If $\delta = 1$, the Type-II GFNWG is converted to the Type-II FNWG.

Corollary 4.3. Let $\Xi_{p} = \big\langle (\upsilon_{p}, \varsigma_{p}); \tau^{{t}}_{p}, \tau^{{i}}_{p} \tau^{{f}}_{p} \big\rangle$ be a finite collection of Type-II FNNs, and all are equal. Prove that Type-II GFNWG $(\Xi_{1}, \Xi_{2}, ..., \Xi_{n}) = \Xi$.

5.   MADM based on Type-Ⅱ FN

Let $\mathscr{\Game} = \{\mathscr{\Game}_{1}, \mathscr{\Game}_{2}, ..., \mathscr{\Game}_{n}\}$ be the set of $n$ alternatives, $A = \{\kappa_{1}, \kappa_{2}, ..., \kappa_{m}\}$ represents a set of $m$ attributes, $w = \{\xi_{1}, \xi_{2}, ..., \xi_{m}\}$ represents weights, and $\mathscr{\Game}_{ij} = \big\langle (\upsilon_{ij}, \varsigma_{ij}); \tau^{{t}}_{ij}, \tau^{{i}}_{ij} \tau^{{f}}_{ij} \big\rangle$ is the Type-Ⅱ FNN of alternative $\mathscr{\Game}_{p}$ in attribute $\kappa_{p}$. We consider $\tau^{{t}}_{ij}, \tau^{{i}}_{ij}, \tau_{ij}^{{f}}\in [0, 1]$ and $0 \preceq (\tau^{{t}}_{ij}(\varepsilon))^{3}+(\tau^{{i}}_{ij}(\varepsilon))^{3} +(\tau_{ij}^{{f}}(\varepsilon))^{3} \preceq 2$, $i = 1, 2, ..., n$ and $p = 1, 2, ..., m$. Here, the decision matrix $\mathscr{\mho} = (\mathscr{\Game}_{ij})_{n \times m}$.

5.1.   Algorithm

This section contains the algorithm for Type-Ⅱ FN information. The best option is chosen according to this algorithm.

Step 1: Enter the decision values for Type-Ⅱ FN.

Step 2: Construct a normalized decision matrix. Here, $\mathscr{\mho} = (\mathscr{\Game}_{ij})_{n \times m}$ is normalized into $\widehat{\mathscr{\mho}} = (\widehat{\mathscr{\Game}_{ij}})_{n \times m}$; put $\widehat{\mathscr{\Game}_{ij}} = \Big\langle (\widehat{\upsilon_{ij}}, \widehat{\varsigma_{ij}}); \widehat{\tau^{{t}}_{ij}}, \widehat{\tau^{{i}}_{ij}}, \widehat{\tau^{{f}}_{ij}} \Big\rangle$ and $\widehat{\upsilon_{ij}} = \frac{\upsilon_{ij}} {\sup_{j}(\upsilon_{ij})}, \widehat{\varsigma_{ij}} = \frac{\varsigma_{ij}}{\sup_{j}(\varsigma_{ij})} \cdot \frac{\varsigma_{ij}}{\upsilon_{ij}}, \, \, \widehat{\tau^{{t}}_{ij}} = \tau^{{t}}_{ij}, \widehat{\tau^{{i}}_{ij}} = \tau^{{i}}_{ij}, \widehat{\tau^{{f}}_{ij}} = \tau^{{f}}_{ij}.$

Step 3: For each attribute $e_{j}$ in $\mathscr{\Game}_{j}$, $\widehat{\mathscr{\Game}_{ij}} = \Big\langle (\widehat{\upsilon_{ij}}, \widehat{\varsigma_{ij}}); \widehat{\tau^{{t}}_{ij}}, \widehat{\tau^{{i}}_{ij}}, \widehat{\tau^{{f}}_{ij}} \Big\rangle$ is aggregated into $\widehat{\mathscr{\Game}_{j}} = \Big\langle (\widehat{\upsilon_{j}}, \widehat{\varsigma_{j}}); \widehat{\tau^{{t}}_{j}}, \widehat{\tau^{{i}}_{j}}, \widehat{\tau^{{f}}_{j}}\Big\rangle$.

Step 4: Calculate the optimal values using both positive and negative Type-Ⅱ FNN.

and

Step 5: Calculate the HDs using two ideal values with each choice.

Step 6: Ranking the choices based on relative closeness values.

Step 7: In order to find the best solution to the problem, the output yields are determined by $\sup \mathscr{\mho}^{\ast}_{j}$.

5.2.   Selection of robot sensors

Sensors on robots are used to monitor a robot's condition and environmental conditions by passing these signals to a controller. In robots, sensors are based on the sensory organs of humans. It is imperative that robots have extensive knowledge of their environment in order to function properly. It is possible to measure a physical quantity with a sensor. These inputs can be converted into electrical signals to be recorded and monitored. In order to choose the right sensor, one must consider the robot's use and the environment in which it is operating. Sensor that measure the same input can differ in accuracy, precision, and sensitivity. It is important to keep this in mind when designing robots. There is a wide array of inputs that sensors can measure. Among these are the environment, force, speed, pressure, temperature, vibration, rotation, imaging, light, biometrics, acceleration, current, orientation, gravity and speech. Automation of robotics requires sensors. It is not possible for a robot to function without them. As a robot interacts with its environment through sensors, it overcomes obstacles and obtains information from the environment. A sensor can be selected according to its characteristics, and the characteristics of a sensor determine the type of sensor to be used for a given application.

$(1)$ Light sensor $(\mathscr{\Game}1)$: The light sensor is a transducer that detects light and creates a voltage difference that reflects the intensity of light falling on it. Generally, robots use photovoltaic cells and photo resistors as light sensors. There are a few other kinds of light sensors in use, such as photo transistors and photo tubes. In robotics, the following types of light sensors are used: A photo resistor is a type of resistor that detects light. The resistance of a photo-resistor changes with the intensity of light. As the resistance of a photo resistor increases, a current passing through it decreases. A photo resistor can also be known as a light dependent resistor (LDR). A photovoltaic cell is a device that converts solar radiation into electricity. It is used for building solar robots. Photovoltaic cells are considered energy sources by themselves; however, they can be converted to sensors when combined with capacitors and transistors.

$(2)$ Proximity sensor $(\mathscr{\Game}2)$: A proximity sensor detects nearby objects without physical contact. Proximity sensors are simple devices. Electromagnetic radiation is transmitted by a proximity sensor, and a return signal is received and analyzed for interruptions by the receiver. Therefore, the amount of light a receiver receives from its surroundings can be used to detect nearby objects. In robotics, proximity sensors are used in the following ways: A transceiver transmits infrared (IR) light via LEDs, but if it encounters an obstacle, the beam of IR light is reflected back, which is captured by a receiver. In ultrasonic sensors, high frequency sound waves are sent out by a transmitter, and the received echo pulse indicates that an object has been interrupted. In robotic systems, ultrasonic sensors are used to measure distance.

$(3)$ Acceleration sensor $(\mathscr{\Game}3)$: The acceleration sensor measures acceleration as well as tilt. Using an accelerometer, you can measure acceleration. An accelerometer is affected by two types of forces: An object's frictional force is called static force. It is possible to determine how much tilt the robot is experiencing by measuring the gravitational force. In this measurement, robots are able to balance themselves, or determine whether they are driving flat or uphill. Dynamic force can be measured using an accelerometer to determine robot velocity and speed.

$(4)$ Temperature sensor $(\mathscr{\Game}4)$: Temperature sensors measure the temperature change around them. According to theory, a change in voltage will provide the equivalent temperature value of a change in temperature. The following are some commonly used temperature sensor ICs: LM34, LM35, TMP35, TMP37 etc.

$(5)$ Sound sensor $(\mathscr{\Game}5)$: It is generally a microphone that detects sound and returns a voltage corresponding to the sound level. Using sound sensors, a simple robot can navigate by listening to sounds. Unlike light sensors, sound sensors generate a very small voltage difference which will be amplified to produce measurable voltage changes.

A set of selection criteria for sensors is given. In order to compare the sensors, you should consider the following factors:

$(1)$ Resolution $(e_{1})$: The smallest change that can be detected by the sensor. There is no guarantee that high is always positive. It would pick up even very minute fluctuations, requiring additional processing if it is too high.

$(2)$ Sensitivity $(e_{2})$: An indicator of the ratio of change in output to change in input. Sensitivity that is too high can be problematic. It is also true that in most cases, the higher the sensitivities are the higher the costs.

$(3)$ Error $(e_{3})$: The difference between the true value and the measured value. You want this value to be as low as possible. Is that margin of error allowed in your application?

$(4)$ Environment $(e_{4})$: Extreme conditions are one of the most significant parameters since not every sensor can withstand them. It is possible for sensors to be affected by conditions that are not ideal (such as temperature, humidity, etc.) and may result in an insufficient measure of output.

A sensor is scored according to the following attributes: $A = \{\kappa_1 : \text{Resolution, }$ $\kappa_2 : \text{Sensitivity},$ $\kappa_3 : \text{Error},$ $\kappa_4 : \text{Environment}\}$ and their corresponding weights are $w = \{0.35, 0.27, 0.23, 0.15\}$. The following are the DM details:

Step 1: Table 1 is created using the DM data.

Step 2: A normalized decision matrix is shown in Table 2.

Step 3: Each alternative's data with Type-Ⅱ FNWA operators is summarized in Table 3.

Step 4: Both ideal values are listed as follows:

Step 5: To calculate the HD between each option with ideal values, we use the values in Tables 4 and 5.

Step 6: We calculate each option's relative closeness value (see Table 6).

Step 7: The ranking of alternatives is $\mathscr{\Game}_{5} \succeq \mathscr{\Game}_{2} \succeq \mathscr{\Game}_{4} \succeq \mathscr{\Game}_{3} \succeq \mathscr{\Game}_{1}$. Consequently, selecting the most suitable sound sensor $\mathscr{\Game}_{5}$ is a great solution.

5.3.   Comparison of suggested and existing models

In this subsection, we give a comparison between the proposed models and some of the existing models, demonstrating their applicability and advantages. We used Type-Ⅱ FNWA, Type-Ⅱ FNWG, Type-Ⅱ GFNWA and Type-Ⅱ GFNWG approaches based on HD. The different distances are shown in Table 7.

On the basis of these four aggregating operators, the HDs of proposed strategies and existing techniques are shown in Figure 1.

By altering various values of $\delta$, we can obtain Table 8.

A graph of the different values for the Type-Ⅱ FNWA operator is presented in Figure 2.

A graph of the different values for the Type-Ⅱ FNWA operator is presented in Figure 3.

5.4.   Sensitivity analysis

The aforementioned analysis demonstrates that, the ranking of the alternatives is $\mathscr{\Game} {5} \succeq \mathscr{\Game} {4} \succeq \mathscr{\Game} {2} \succeq \mathscr{\Game} {3} \succeq \mathscr{\Game} {1}$ when $2 \preceq \delta \preceq 12$. In the event when $13 \preceq \delta \preceq 33$, the ordering of the alternatives becomes $\mathscr{\Game}_{5} \succeq \mathscr{\Game}_{4} \succeq \mathscr{\Game}_{3} \succeq \mathscr{\Game}_{2} \succeq \mathscr{\Game}_{1}$. The ranking of the alternatives, in a new order, is $\mathscr{\Game}_{4} \succeq \mathscr{\Game}_{5} \succeq \mathscr{\Game}_{3} \succeq \mathscr{\Game}_{2} \succeq \mathscr{\Game}_{1}$ when $\delta = 34$. As a result, the preferred option was changed from $\mathscr{\Game}_{5}$ to $\mathscr{\Game}_{4}$. The basis of the alternate rankings is similarly composed of Type-Ⅱ FNWG, Type-Ⅱ GFNWA and Type-Ⅱ GFNWG operators with values of $\delta$.

5.5.   Advantages

This paper proposes a method that offers the following benefits, as shown by the above analysis. In the article, NFN and neutrosophic number are combined to introduce the concept of Type-Ⅱ FNN. A Type-Ⅱ FNN interprets human behavior and natural phenomena that have a normal distribution in nature and describes ambiguous information. Therefore, type-II FNN information is characterized more broadly and is more in line with how humans think. The decision-maker may use parameter $\delta$ to select the decision result according to their preferences. In this paper, the mode of ranking alternatives will be discussed in terms of Type-Ⅱ FNWAs, Type-Ⅱ FNWGs, Type-Ⅱ GFNWAs and Type-Ⅱ GFNWGs.

6.   Conclusions

We used HD for Type-Ⅱ FNNs, whose algebraic accessibility provides an added benefit. The HD of Type-Ⅱ Fermatean sets has a wide range of practical applications in data analysis. Using persuasive statistical examples, the benefits of the HD are demonstrated. Many illustrations of Type-Ⅱ FNWA, Type-Ⅱ FNWG, Type-Ⅱ GFNWA and Type-Ⅱ GFNWG with AOs were shown, and for the first time, models were proposed. The Type-Ⅱ FNS method can assist persons in selecting the best alternative from a selection of choices. We have proposed changes for the Type-Ⅱ FNWA, Type-Ⅱ FNWG, Type-Ⅱ GFNWA, and Type-Ⅱ GFNWG AOs to the MADM problem on $\delta$. The distinct ranking of options may be found for the Type-Ⅱ FNWA, Type-Ⅱ FNWG, Type-Ⅱ GFNWA, and Type-Ⅱ GFNWG AOs on $\delta$. The results demonstrated that the generalized values of $\delta$ have the most impact on the ranking of options at the last stage. The DM may set the values of $\delta$ in accordance with the present parameters and then proceed to make appropriate decisions in order to attain the best reasonable ranking. As a result, the values of $\delta$ can provide guidance to the decision-maker in arriving at the outcome. Since this is a wide open field, the ideas presented here will be useful to future academics with an interest in the subject. Ideas require a great deal of work because of their applicability to real-world issues. Graphs of Fermatean fuzzy sets and aggregation operators on these sets are some directions that will help us address a variety of real-world problems.

Conflict of interest

The authors declare no conflicts of interest.