1 Introduction

Decision-making is a common activity in various aspects of our daily lives. It is generally defined as the act of seeking the best alternative from a set of alternatives based on the judgments of one or several decision makers (DMs). Multi-attribute decision-making (MADM), an important branch of decision-making, involves the generation of decisions by DMs based on the information evaluated on a set of feasible alternatives, in which multiple attributes are used to find a common solution [1]. MADM has been widely used in many fields, such as pattern recognition [2, 3], medical diagnosis [3, 4], supplier selection [5], emergency decision [6], and disaster assessment [7]. However, the decision-making problem has become increasingly complicated owing to the growing amount of decision information and alternatives, the inherent uncertainty and complexity of decision problems, and the fuzzy nature of human thinking [8]. In some sudden, complicated situations in particular, some decision information is often not represented accurately; instead, it is often expressed as fuzzy, vague, hesitant, incomplete, indeterminate, and inconsistent. Thus, the fuzzy set (FS), hesitant fuzzy set, rough set, intuitionistic fuzzy set (IFS), Pythagorean fuzzy set (PFS), and neutrosophic set are used to model the decision information. Zadeh [9] proposed FSs, which are characterized by a membership degree, in 1965. Atanassov [10] proposed IFSs, which are characterized by a membership degree and non-membership degree, in 1986. Yager [11] proposed the PFS, which is the second type of IFS. In the past few decades, FSs, IFSs, and PFSs have become research hotspots [12, 13]. However, the incomplete, indeterminate, and inconsistent problems in real life cannot be explained using these theories because they cannot handle independent components and some dependent components. Therefore, the neutrosophic set [14], which is the latest theory in fuzzy fields, is proposed to deal with the above situations.

The neutrosophic set (NS), which consists of the truth-membership degree (T), an indeterminacy-membership degree (I), and a falsity-membership degree (F), was proposed by Smarandache from a philosophical point of view in 1999. It is a generalization of sets such as crisp sets, FSs, and IFSs. In recent years, this novel concept has become a research hotspot and many scholars have proposed various forms of neutrosophic sets. For example, Wang et al. introduced single-valued neutrosophic sets (SVNSs) [15] for the practical application of NSs, along with interval neutrosophic sets (INSs) [16]. Ye [17] introduced simplified neutrosophic sets (SNSs) and applied them to MADM. Wang et al. defined the concept of multi-valued neutrosophic sets (MVNSs) [18] and multi-valued interval neutrosophic sets (MVINSs) [19]. Deli et al. introduced bipolar neutrosophic sets (BNSs) [20] and bipolar neutrosophic refined sets (BNRSs) [21]. Ali et al. [22] proposed the concept of bipolar neutrosophic soft sets (BNSSs). Tian et al. [23] defined simplified neutrosophic linguistic sets (SNLSs) and applied them to MADM. Biswas et al. [24], Ye [25], and Tan et al. [26] studied the trapezoidal fuzzy neutrosophic sets (TrFNSs). Broumi et al. [27], Tan et al. [28], and others combined the neutrosophic sets and graph theory to propose neutrosophic graphs (NGs), and used them to solve the shortest path problem. Liu et al. [29] studied linguistic neutrosophic sets (LNSs) and their application to multi-attribute group decision-making (MAGDM). Abdel-Basset et al. [30] defined the concept of type-2 neutrosophic number sets (T2NNSs). However, because there are both arguments and sub-arguments/refined arguments in the truth, indeterminacy, and falsity membership degrees of T, I, F in the neutrosophic set to express complex problems of the real world in detail, the truth, indeterminacy, and falsity information should be refined [31]. Hence, Smarandache [32] further extended the neutrosophic logic to n-valued refined neutrosophic logic by refining each neutrosophic component T, I, F into T1, T2, ⋯, Tm, I1, I2, ⋯, IP, and F1, F2, ⋯, Fr, respectively. Broumi et al. [33] presented the cosine similarity measure of neutrosophic refined sets and applied it to medical diagnosis problems. Broumi et al. [34] proposed correlation measures for neutrosophic refined sets and applied them to medical diagnosis. Ye et al. [35] proposed the Dice similarity measure between single-valued neutrosophic multisets and applied it to medical diagnosis. Mondal et al. [36] proposed neutrosophic refined similarity measure based on a tangent function and applied it to MADM. In fact, the multi-valued neutrosophic sets/neutrosophic refined sets are neutrosophic multisets in their expressed forms [31, 37, 38]. Hence, these multi-valued neutrosophic sets/neutrosophic refined sets, i.e., neutrosophic multisets, and their decision-making methods cannot express and deal with decision-making problems with both attributes and sub-attributes [31]. Therefore, Ye and Smarandache [37] proposed a refined single-valued neutrosophic set, where the neutrosophic set {T, I, F} is refined into RSVNS {(T1, T2, ⋯, Tr), (I1, I2, ⋯, Ir), (F1, F2, ⋯, Fr)}, and proposed the similarity measures based on RSVNSs to solve decision-making problems with both attributes and sub-attributes. Then, Fan and Ye [38] further presented the cosine measures of RSVNSs and refined interval neutrosophic sets (RINSs) based on the distance and cosine function and applied them to the decision-making problems with both attributes and sub-attributes under RSVNSs/RINSs environments. Chen et al. [31] proposed the vector similarity measures between refined simplified neutrosophic sets (RSNSs), which contain the RSVNS and RINS, and their MADM method. Throughout the existing literature, not many studies have been conducted on RSVNSs. Therefore, this study investigates the decision-making method with both attributes and sub-attributes, where the attribute weight is unknown, under the RSVNSs environment.

The objective determination of attribute weights is a key point in decision-making. For example, Chen et al. [39] established an objective programming model and used the Lagrange equation model to obtain the weights in a multi-granular hesitant fuzzy linguistic term environment. Harish [40] proposed linear programming based on these preferences and an improved score function to solve the MADM problems. Han et al. [41] used the deviation entropy weight method to determine the attribute weights based on the quantitative and qualitative indexes. Liu et al. [42] used the entropy weight method to determine the weights of attributes of the hybrid multiple attributes. Ye [43] proposed two weight models based on the improved similarity measures to derive the weights of the DMs and the attributes based on single-valued neutrosophic numbers (SVNNs). Tan et al. [44] used the entropy of neutrosophic linguistic sets (NLSs) to determine the attribute weights. Xiong et al. [45] presented a novel and simple nonlinear optimization model to determine the attribute weights by maximizing the total deviation in all attribute values based on SVNNs. Li et al. [46] constructed a single-objective programming model based on the smallest deviation degree between each alternative and linguistic neutrosophic positive ideal solution to determine attribute weights based on the linguistic neutrosophic numbers. However, there are few researches on the attribute weight determination methods based on RSVNSs. Therefore, this study examines the method of determining attribute weights based on the new distance measure and neutrosophic entropy in the RSVNSs environment.

Sorting methods are a research hotspot in decision making. Existing classic and commonly used methods include interactive multi-criteria decision making (which has the acronym TODIM in Portuguese) [47], technique for order preference by similarity to ideal solution (TOPSIS) [48], preference ranking organization method for enrichment evaluations (PROMETHEE) [49], elimination and choice expressing the reality (ELECTRE) [50], vlsekriterijumska optimizacija I kompromisno resenje (VIKOR) [51], grey relational analysis (GRA) [52], multi-objective optimization by ratio analysis (MULTIMOORA) [53], prospect theory (PT) [54], case-based reasoning (CBR) [55], Dempster–Shafer (D–S) theory, function method (score function, accuracy function, expectation function, etc.), and other correlation methods [56]. Here, the evaluation based on distance from average solution (EDAS) method, which can consider the conflicting attributes, is a relatively new method proposed by Keshavarz et al. [57] in 2015. It aims to find the best solution by using two distance measures, namely the positive distance from average (PDA) and the negative distance from average (NDA). The alternative with larger PDA and lower NDA is determined to be the best alternative [58]. Compared to the existing work, the EDAS model has the merit of only considering average solutions with respect to the intangibility of DMs and the uncertainty of the decision-making environment to obtain more accurate and effective aggregation results [59]. Zhang et al. [59] extended the EDAS method based on picture 2-tuple linguistic numbers. Liang et al. [60] proposed an extended EDAS method based on picture fuzzy information. Kahraman et al. [61] proposed an intuitionistic fuzzy EDAS method. Peng et al. [62] proposed algorithms for neutrosophic soft decision making based on EDAS. Although EDAS has been studied in recent years, the research is still limited. We expect to use the EDAS tool to manage the MADM problems and overcome the originality and simplicity of traditional compromise methods. Thus, we propose an extended EDAS-based MADM method whose evaluation information is expressed as refined single-valued neutrosophic sets.

A typhoon is a natural disaster with highly destructive power. Historically, the southeastern coastline of China has been prone to typhoons annually [63]. Typhoons are often accompanied by strong winds, rainstorms, and storm surges, which have the characteristics of high frequency, sudden occurrence, wide range of influence, and great intensity of disaster [64]. In the vulnerable areas of the geological environment, the rainstorms caused by typhoons can easily trigger geological disasters, such as collapses, landslides, and debris flow, and bring about heavy casualties and property losses. The destructive power of a typhoon typically exceeds that of an earthquake, making it one of the biggest disasters facing humanity; but to date no method has been developed to avoid it. Therefore, the assessment of typhoon disasters is a very important issue that can help disaster relief and management departments. However, the factors influencing typhoon disasters are difficult to describe accurately. For example, general economic loss includes many aspects, such as building collapse, number of deaths and missing persons, affected local economic conditions, degree of environmental damage, and degree of social instability. The assessment information is usually expressed as hesitant, ambiguous, incomplete, inconsistent, and uncertain. In an effort to mitigate these problems, FSs and IFSs have been used in typhoon disaster assessment (TDA) in recent years. Shi et al. [65] proposed a TDA method based on an MADM hybrid approach using analytic hierarchy process (AHP) and TOPSIS with fuzzy numbers. He et al. [66] proposed a TDA method based on Dombi aggregation operators with hesitant fuzzy information. Li et al. [67] proposed a TDA method based on TOPSIS with intuitionistic fuzzy numbers (IFNs). Yu [68] proposed a TDA method based on generalized intuitionistic fuzzy interactive aggregation operators. Tang et al. [69] studied the nature disaster risk evaluation based on incomplete hesitant fuzzy linguistic preference relations. Tan et al. [7] studied the TDA method based on the exponential aggregation operator of interval neutrosophic numbers (INNs). However, there are not many studies on TDA based on neutrosophic numbers. Thus, we propose an MADM method based on neutrosophic entropy and the EDAS method under the RSVNSs environment, and apply it to TDA.

The remainder of this paper is organized as follows. Section 2 briefly introduces some basic concepts, including neutrosophic sets and refined single-valued neutrosophic sets. Section 3 gives the definition of new distance measure, similarity measure, and entropy of RSVNSs, and discusses the relationship between them. Section 4 describes the problem and the attribute weights calculation method based on RSVNSs. Then, the MADM method based on the neutrosophic entropy and EDAS method with RSVNSs is presented. Section 5 gives two examples of typhoon disaster evaluation to verify the applicability of the proposed approach and its advantages by sensitive analysis and comparative analysis. Section 6 presents concluding remarks and suggestions for further research.

2 Preliminaries

In this section, we briefly outline various essential concepts, such as NSs, RSVNS, and operational rules of RSVNSs.

Definition 1

[14] Let X be a space of points (objects), with a generic element in X denoted by x. Then, a neutrosophic set A in X is characterized by a truth-membership function TA(x), an indeterminacy-membership function IA(x), and a falsity-membership function FA(x). The functions TA(x), IA(x), and FA(x) are real standard or nonstandard subsets of ]0, 1+[, i.e., TA(x) : X → ]0, 1+[, IA(x) : X → ]0, 1+[, and FA(x) : X → ]0, 1+[. Therefore, the sum of TA(x), IA(x) and FA(x) satisfies the condition 0 ≤ TA(x) + IA(x) + FA(x) ≤ 3+.

Definition 2

[15] Let X be a universal set. A single-valued neutrosophic set A in X is characterized by a truth-membership function TA(x), an indeterminacy-membership function IA(x), and a falsity-membership function FA(x). Then, an SVNS A can be denoted by

$$ A=\left\{\left\langle x,{T}_A(x),{I}_A(x),{F}_A(x)\right\rangle \left|x\in X\right.\right\}. $$
(1)

where TA(x), IA(x), FA(x) ∈ [0, 1] for each x in X. Then, the sum of TA(x), IA(x), and FA(x) satisfies the condition 0 ≤ TA(x) + IA(x) + FA(x) ≤ 3. For convenience, we can use a = 〈T, I, F〉 to represent a single-valued neutrosophic number (SVNN).

Definition 3

[37] Let X = {x1, x2, ⋯, xn} be a universe of discourse. Then, a refined single-valued neutrosophic set R in X can be expressed by the following form.

$$ R=\left\{\left\langle {x}_i,\left({T}_{1R}\left({x}_i\right),{T}_{2R}\left({x}_i\right),\cdots, {T}_{kR}\left({x}_i\right)\right),\left({I}_{1R}\left({x}_i\right),{I}_{2R}\left({x}_i\right),\cdots, {I}_{kR}\left({x}_i\right)\right),\left({F}_{1R}\left({x}_i\right),{F}_{2R}\left({x}_i\right),\cdots, {F}_{kR}\left({x}_i\right)\right)\right\rangle \left|{x}_i\in X\right.\right\}. $$
(2)

where k is a positive integer, T1R(xi), T2R(xi), ⋯, TkR(xi) ∈ [0, 1], I1R(xi), I2R(xi), ⋯, IkR(xi) ∈ [0, 1], F1R(xi), F2R(xi), ⋯, FkR(xi) ∈ [0, 1], and 0 ≤ TjR(xi) + IjR(xi) + FjR(xi) ≤ 3 for i = 1, 2, ⋯, n, j = 1, 2, ⋯, k.

Definition 4

[37] Let X = {x1, x2, ⋯, xn} be a universe of discourse, and M and N be two RSVNSs,

$$ M=\left\{\left\langle {x}_i,\left({T}_{1M}\left({x}_i\right),{T}_{2M}\left({x}_i\right),\cdots, {T}_{kM}\left({x}_i\right)\right),\left({I}_{1M}\left({x}_i\right),{I}_{2M}\left({x}_i\right),\cdots, {I}_{kM}\left({x}_i\right)\right),\left({F}_{1M}\left({x}_i\right),{F}_{2M}\left({x}_i\right),\cdots, {F}_{kM}\left({x}_i\right)\right)\right\rangle |{x}_i\in X\operatorname{}\right\},N=\left\{\left\langle {x}_i,\left({T}_{1N}\left({x}_i\right),{T}_{2N}\left({x}_i\right),\cdots, {T}_{kN}\left({x}_i\right)\right),\left({I}_{1N}\left({x}_i\right),{I}_{2N}\left({x}_i\right),\cdots, {I}_{kN}\left({x}_i\right)\right),\left({F}_{1N}\left({x}_i\right),{F}_{2N}\left({x}_i\right),\cdots, {F}_{kN}\left({x}_i\right)\right)\right\rangle |{x}_i\in X\operatorname{}\right\}. $$

Then, the relations between M and N are given as follows.

  1. (1)

    Containment: M ⊆ N, if and only if TjM(xi) ≤ TjN(xi), IjM(xi) ≥ IjN(xi), FjM(xi) ≥ FjN(xi) for i = 1, 2, ⋯, n, j = 1, 2, ⋯, k.

  2. (2)

    Equality: M = N, if and only if TjM(xi) = TjN(xi), IjM(xi) = IjN(xi), FjM(xi) = FjN(xi) for i = 1, 2, ⋯, n, j = 1, 2, ⋯, k.

  3. (3)

    Union: \( M\cup N=\left\{\left\langle \begin{array}{c}{x}_i,\left({T}_{1M}\left({x}_i\right)\vee {T}_{1N}\left({x}_i\right),{T}_{2M}\left({x}_i\right)\vee {T}_{2N}\left({x}_i\right),\cdots, {T}_{kM}\left({x}_i\right)\vee {T}_{kN}\left({x}_i\right)\right),\\ {}\left({I}_{1M}\left({x}_i\right)\wedge {I}_{1N}\left({x}_i\right),{I}_{2M}\left({x}_i\right)\wedge {I}_{2N}\left({x}_i\right),\cdots, {I}_{kM}\left({x}_i\right)\wedge {I}_{kN}\left({x}_i\right)\right),\\ {}\left({F}_{1M}\left({x}_i\right)\wedge {F}_{1N}\left({x}_i\right),{F}_{2M}\left({x}_i\right)\wedge {F}_{2N}\left({x}_i\right),\cdots, {F}_{kM}\left({x}_i\right)\wedge {F}_{kN}\left({x}_i\right)\right)\end{array}\right\rangle \left|{x}_i\in X\right.\right\}. \)

  4. (4)

    Intersection: \( M\cap N=\left\{\left\langle \begin{array}{c}{x}_i,\left({T}_{1M}\left({x}_i\right)\wedge {T}_{1N}\left({x}_i\right),{T}_{2M}\left({x}_i\right)\wedge {T}_{2N}\left({x}_i\right),\cdots, {T}_{kM}\left({x}_i\right)\wedge {T}_{kN}\left({x}_i\right)\right),\\ {}\left({I}_{1M}\left({x}_i\right)\vee {I}_{1N}\left({x}_i\right),{I}_{2M}\left({x}_i\right)\vee {I}_{2N}\left({x}_i\right),\cdots, {I}_{kM}\left({x}_i\right)\vee {I}_{kN}\left({x}_i\right)\right),\\ {}\left({F}_{1M}\left({x}_i\right)\vee {F}_{1N}\left({x}_i\right),{F}_{2M}\left({x}_i\right)\vee {F}_{2N}\left({x}_i\right),\cdots, {F}_{kM}\left({x}_i\right)\vee {F}_{kN}\left({x}_i\right)\right)\end{array}\right\rangle \left|{x}_i\in X\right.\right\}. \)

For convenient expression, a basic element

{〈xi, (T1R(xi), T2R(xi), ⋯, TkR(xi)), (I1R(xi), I2R(xi), ⋯, IkR(xi)), (F1R(xi), F2R(xi), ⋯, FkR(xi))〉} in R is simply denoted as r = 〈(T1r, T2r, ⋯, Tkr), (I1r, I2r, ⋯, Ikr), (F1r, F2r, ⋯, Fkr)〉, which is called a refined single-valued neutrosophic number (RSNN).

Definition 5

Let r = 〈(T1r, T2r, ⋯, Tkr), (I1r, I2r, ⋯, Ikr), (F1r, F2r, ⋯, Fkr)〉 and l = 〈(T1l, T2l, ⋯, Tkl), (I1l, I2l, ⋯, Ikl), (F1l, F2l, ⋯, Fkl)〉 be two RSVNNs. Then, the following operational rules apply:

$$ \lambda r=\left\langle \begin{array}{c}\left(1-{\left(1-{T}_{1r}\right)}^{\lambda },1-{\left(1-{T}_{2r}\right)}^{\lambda },\cdots, 1-{\left(1-{T}_{kr}\right)}^{\lambda}\right),\\ {}\left({\left({I}_{1r}\right)}^{\lambda },{\left({I}_{2r}\right)}^{\lambda },\cdots, {\left({I}_{kr}\right)}^{\lambda}\right),\left({\left({F}_{1r}\right)}^{\lambda },{\left({F}_{2r}\right)}^{\lambda },\cdots, {\left({F}_{kr}\right)}^{\lambda}\right)\end{array}\right\rangle, \lambda >0. $$
$$ {r}^{\lambda }=\left\langle \begin{array}{c}\left({\left({T}_{1r}\right)}^{\lambda },{\left({T}_{2r}\right)}^{\lambda },\cdots, {\left({T}_{kr}\right)}^{\lambda}\right),\left(1-{\left(1-{I}_{1r}\right)}^{\lambda },1-{\left(1-{I}_{2r}\right)}^{\lambda },\cdots, 1-{\left(1-{I}_{kr}\right)}^{\lambda}\right),\\ {}\left(1-{\left(1-{F}_{1r}\right)}^{\lambda },1-{\left(1-{F}_{2r}\right)}^{\lambda },\cdots, 1-{\left(1-{F}_{kr}\right)}^{\lambda}\right)\end{array}\right\rangle, \lambda >0. $$
$$ r+l=\left\langle \begin{array}{c}\left({T}_{1r}+{T}_{1l}-{T}_{1r}\cdot {T}_{1l},{T}_{2r}+{T}_{2l}-{T}_{2r}\cdot {T}_{2l},\cdots, {T}_{kr}+{T}_{kl}-{T}_{kr}\cdot {T}_{kl}\right),\\ {}\left({I}_{1r}\cdot {I}_{1l},{I}_{2r}\cdot {I}_{2l},\cdots, {I}_{kr}\cdot {I}_{kl}\right),\left({F}_{1r}\cdot {F}_{1l},{F}_{2r}\cdot {F}_{2l},\cdots, {F}_{kr}\cdot {F}_{kl}\right)\end{array}\right\rangle . $$
$$ r\cdot l=\left\langle \begin{array}{c}\left({T}_{1r}\cdot {T}_{1l},{T}_{2r}\cdot {T}_{2l},\cdots, {T}_{kr}\cdot {T}_{kl}\right),\left({I}_{1r}+{I}_{1l}-{I}_{1r}\cdot {I}_{1l},{I}_{2r}+{I}_{2l}-{I}_{2r}\cdot {I}_{2l},\cdots, {I}_{kr}+{I}_{kl}-{I}_{kr}\cdot {I}_{kl}\right),\\ {}\left({F}_{1r}+{F}_{1l}-{F}_{1r}\cdot {F}_{1l},{F}_{2r}+{F}_{2l}-{F}_{2r}\cdot {F}_{2l},\cdots, {F}_{kr}+{F}_{kl}-{F}_{kr}\cdot {F}_{kl}\right)\end{array}\right\rangle . $$

3 New distance measure, similarity measure, and entropy of RSVNSs

3.1 Score function and accuracy function

Inexact numbers (such as fuzzy numbers, interval numbers, intuitionistic fuzzy numbers, and neutrosophic numbers) can represent the ambiguity, hesitation, uncertainty, and inconsistency of information. When solving some complex problems, the decision information expressed as inexact number will more fully reflect the problem attributes, but its calculation is more complicated and cannot be directly sorted. Therefore, most of the existing research work on inexact number processing convert it to exact numbers to complete the calculation and comparison of inexact numbers at the cost of losing some information. This conversion is best placed in the middle and late stages of the decision-making process. This practice can avoid the problem of inaccurate decision-making results caused by information loss. The score function and accuracy function are widely used in fuzzy decision methods because they are simple to calculate. Therefore, to deal with the problem of converting RSVNS into exact numbers, this study proposes the definition of score function and accuracy function based on RSVNS.

Because the size comparison of RSNN is used in the comparative analysis of the example, we define the score function and accuracy function of RSNN in this section. Inspired by the literature [70, 71], we defined the score function and accuracy function of the refined single-valued neutrosophic set. In the literature, there are several published studies on score function and accuracy function in different information environments [70,71,72]. However, their formula expression and calculation complexity differ. For some special cases, the calculation formula is more complicated. To simplify the calculation, we define simpler score and accuracy functions as follows.

Definition 6

Let r = 〈(T1r, T2r, ⋯, Tkr), (I1r, I2r, ⋯, Ikr), (F1r, F2r, ⋯, Fkr)〉 be an RSVNN. Then, the score function of an RSVNN can be defined as

$$ Sc(r)=\frac{1}{k}\sum \limits_{j=1}^k\frac{1}{3}\left(2+{T}_{jr}-{I}_{jr}-{F}_{jr}\right), Sc(r)\in \left[0,1\right]. $$
(3)

where a larger value of Sc(r) indicates a larger RSVNN r.

Definition 7

Let r = 〈(T1r, T2r, ⋯, Tkr), (I1r, I2r, ⋯, Ikr), (F1r, F2r, ⋯, Fkr)〉 be an RSVNN. Then, the accuracy function of an RSVNN can be defined as

$$ H(r)=\frac{1}{k}\sum \limits_{j=1}^k\left({T}_{jr}-{F}_{jr}\right),H(r)\in \left[-1,1\right]. $$
(4)

where a larger value of H(r) indicates bigger the accuracy of RSVNN r.

Here, our accuracy function does not consider the indeterminacy-membership for three reasons. First, because the score function considers the indeterminacy membership and it is the main preferred sorting method, the accuracy function is only used when the score function cannot be distinguished. Therefore, the accuracy function can be simply defined to reduce the computational complexity. Second, the RSNN studied in this work has more data than the single-valued neutrosophic number. Thus, it is easier to distinguish based on the two functions. Finally, we study the TDA problem, which needs timeliness. Therefore, we need to reduce the calculation amount of the model. In summary, we define simpler score functions and accuracy functions that can solve the sorting problem. Even if they cannot solve some very special cases, the literature [72] can be referenced; that is, based on the literature [72], we can propose more complex accuracy functions to solve these special cases. The accuracy function definition is shown below.

$$ {H}_2(r)=\frac{1}{k}\sum \limits_{j=1}^k\left({T}_{jr}-{I}_{jr}\cdot \left(1-{T}_{jr}\right)-{F}_{jr}\cdot \left(1-{I}_{jr}\right)\right),{H}_2(r)\in \left[-1,1\right]. $$

Compared with the above two accuracy functions, H(r) only considers the truth-membership function value and the falsity-membership function value of the evaluation information. Its purpose is to reduce the amount of calculation and speed up the evaluation process at the cost of losing some information. The advantage of H2(r) is that it considers the three membership values of the evaluation information, the information evaluation is more comprehensive, and the evaluation results will be more objective and reasonable. The choice of two functions can be based on the following principles: In the processing of inexact data, Sc(·) and H(·) are preferentially used to process information. If they cannot solve the problem, H2(·) is selected, which is suitable for dealing with more complex problems and some special situations. For example, if r = 〈(0,0.5), (0.5,1), (0,0.5)〉, l = 〈(0.5,1), (0.5,1), (0.5,1)〉 are two RSVNNs, using the above functions to calculate Sc(·), we obtain \( Sc(r)=\frac{1}{2}\left(\frac{1.5}{3}+\frac{1}{3}\right)=\frac{2.5}{6} \) and \( Sc(l)=\frac{1}{2}\left(\frac{1.5}{3}+\frac{2}{3}\right)=\frac{2.5}{6} \). Then, when we calculate H(·), we obtain \( H(r)=\frac{1}{2}\left(0+0\right)=0 \) and \( H(l)=\frac{1}{2}\left(0+0\right)=0 \). Obviously, r and l cannot be distinguished by Sc(·) and H(·), so we calculate H2(·), and obtain \( {H}_2(r)=\frac{1}{2}\left(-0.5+0\right)=-0.25 \) and \( {H}_2(l)=\frac{1}{2}\left(0+1\right)=0.5 \). Therefore, we can get r < l, which is also in line with people’s subjective judgments.

On the basis of the score function Sc(r) and accuracy function H(r), we give the following ordered relation between two RSVNNs.

Definition 8

Let r = 〈(T1r, T2r, ⋯, Tkr), (I1r, I2r, ⋯, Ikr), (F1r, F2r, ⋯, Fkr)〉 and l = 〈(T1l, T2l, ⋯, Tkl), (I1l, I2l, ⋯, Ikl), (F1l, F2l, ⋯, Fkl)〉 be two RSVNNs. Thus, Sc(r) and Sc(l) are the scores of r and l, respectively, and H(r) and H(l) are the accuracy degree of r and l, respectively. Consequently, the ordered relation between two RSVNNs is defined as follows.

  1. (1)

    If Sc(r) > Sc(l), then r > l;

  2. (2)

    If Sc(r) < Sc(l), then r < l;

  3. (3)

    If Sc(r) = Sc(l), and

  • H(r) > H(l), then r > l;

  • H(r) < H(l), then r < l.

In particular, in some special cases, if the alternative cannot be sorted based on Sc(·) and H(·), H(·) can be replaced by H2(·) in the sorting method of definition 7.

3.2 New distance measure, similarity measure of RSVNSs

Distance measure and similarity measure are widely researched and applied techniques in decision problems. The new distance measure of RSVNSs proposed in this study has several functions. On the one hand, the information entropy can be obtained based on the distance measure to calculate the attribute weight. On the other hand, it is used for comparative analysis in the example part, that is, one of the comparison methods with TOPSIS needs to calculate the distance between the solution and the positive/negative ideal solution. Distance measurement involves more than just that. The similarity measure is also a hotspot for many scholars. It can be used for scheme ranking. Based on the relationship between distance and similarity measure, this study can easily and conveniently obtain the similarity measure and use it for the comparative analysis of calculation examples. Therefore, we provide the following definitions for the new distance measure and similarity measure with RSVNSs in various forms.

Definition 9

Let M and N be two RSVNSs. Then, the distance measure D(M, N) between M and N is defined as follows.

$$ D\left(M,N\right)=\frac{1}{n}\sum \limits_{i=1}^n\frac{1}{k}\sum \limits_{j=1}^k{\left\{\frac{1}{3}\left({\left|{T}_{jM}\left({x}_i\right)-{T}_{jN}\left({x}_i\right)\right|}^{\lambda }+{\left|{I}_{jM}\left({x}_i\right)-{I}_{jN}\left({x}_i\right)\right|}^{\lambda }+{\left|{F}_{jM}\left({x}_i\right)-{F}_{jN}\left({x}_i\right)\right|}^{\lambda}\right)\right\}}^{\raisebox{1ex}{$1$}\!\left/ \!\raisebox{-1ex}{$\lambda $}\right.},\lambda \ge 0. $$
(5)

If λ = 1, the distance Eq. (5) is reduced to the following Hamming distance.

$$ {D}_H\left(M,N\right)=\frac{1}{n}\sum \limits_{i=1}^n\frac{1}{k}\sum \limits_{j=1}^k\left\{\frac{1}{3}\left(\left|{T}_{jM}\left({x}_i\right)-{T}_{jN}\left({x}_i\right)\right|+\left|{I}_{jM}\left({x}_i\right)-{I}_{jN}\left({x}_i\right)\right|+\left|{F}_{jM}\left({x}_i\right)-{F}_{jN}\left({x}_i\right)\right|\right)\right\}. $$
(6)

If λ = 2, the distance Eq. (5) is reduced to the following Euclidean distance.

$$ {D}_E\left(M,N\right)=\frac{1}{n}\sum \limits_{i=1}^n\frac{1}{k}\sum \limits_{j=1}^k\sqrt{\frac{1}{3}\left({\left|{T}_{jM}\left({x}_i\right)-{T}_{jN}\left({x}_i\right)\right|}^2+{\left|{I}_{jM}\left({x}_i\right)-{I}_{jN}\left({x}_i\right)\right|}^2+{\left|{F}_{jM}\left({x}_i\right)-{F}_{jN}\left({x}_i\right)\right|}^2\right)}. $$
(7)

Theorem 1

The above-defined distance D(M, N) satisfies the following properties.

  • (P1) 0 ≤ D(M, N) ≤ 1;

  • (P2) D(M, N) = 0 if and only if M = N;

  • (P3) D(M, N) = D(N, M);

The proof process of Theorem 1 can be found in the Appendix.

Because DH(M, N) and DE(M, N) are special cases of D(M, N), they also satisfy Theorem 1.

Here, we can get the similarity measures of RSVNSs based on the relationship between distance and similarity,

$$ S\left(M,N\right)=1-D\left(M,N\right)=1-\frac{1}{n}\sum \limits_{i=1}^n\frac{1}{k}\sum \limits_{j=1}^k{\left\{\frac{1}{3}\left({\left|{T}_{jM}\left({x}_i\right)-{T}_{jN}\left({x}_i\right)\right|}^{\lambda }+{\left|{I}_{jM}\left({x}_i\right)-{I}_{jN}\left({x}_i\right)\right|}^{\lambda }+{\left|{F}_{jM}\left({x}_i\right)-{F}_{jN}\left({x}_i\right)\right|}^{\lambda}\right)\right\}}^{\raisebox{1ex}{$1$}\!\left/ \!\raisebox{-1ex}{$\lambda $}\right.}. $$
(8)

If λ = 1, the similarity measure based on the Hamming distance is as follows.

$$ {S}_H\left(M,N\right)=1-{D}_H\left(M,N\right)=1-\frac{1}{n}\sum \limits_{i=1}^n\frac{1}{k}\sum \limits_{j=1}^k\left\{\frac{1}{3}\left(\left|{T}_{jM}\left({x}_i\right)-{T}_{jN}\left({x}_i\right)\right|+\left|{I}_{jM}\left({x}_i\right)-{I}_{jN}\left({x}_i\right)\right|+\left|{F}_{jM}\left({x}_i\right)-{F}_{jN}\left({x}_i\right)\right|\right)\right\}. $$
(9)

If λ= 2, the similarity measure based on the Euclidean distance is as follows.

$$ {S}_E\left(M,N\right)=1-{D}_E\left(M,N\right)=1-\frac{1}{n}\sum \limits_{i=1}^n\frac{1}{k}\sum \limits_{j=1}^k\sqrt{\frac{1}{3}\left({\left|{T}_{jM}\left({x}_i\right)-{T}_{jN}\left({x}_i\right)\right|}^2+{\left|{I}_{jM}\left({x}_i\right)-{I}_{jN}\left({x}_i\right)\right|}^2+{\left|{F}_{jM}\left({x}_i\right)-{F}_{jN}\left({x}_i\right)\right|}^2\right)}. $$
(10)

Theorem 2

The similarity measures above evidently satisfy the following properties.

  • (P1) 0 ≤ S(M, N) ≤ 1;

  • (P2) S(M, N) = S(N, M);

  • (P3) S(M, N) = 1 for M = N, i.e., TjM(xi) = TjN(xi), IjM(xi) = IjN(xi), FjM(xi) = FjN(xi).

Owing to the establishment of Theorem 1, Theorem 2 is also established, and no further proof is given here.

In general, we usually consider the weights of primary attributes. Assume that the weight of each primary attribute xi is ωi  (i = 1, 2, ⋯, n), with ωi ∈ [0, 1] and \( \sum \limits_{i=1}^n{\omega}_i=1 \). Then, we can introduce the weighted similarity measure formulas of RSVNS.

The generalized weighted similarity measure of RSVNS is as follows.

$$ S\left(M,N\right)=1-D\left(M,N\right)=1-\sum \limits_{i=1}^n{\omega}_i\frac{1}{k}\sum \limits_{j=1}^k{\left\{\frac{1}{3}\left({\left|{T}_{jM}\left({x}_i\right)-{T}_{jN}\left({x}_i\right)\right|}^{\lambda }+{\left|{I}_{jM}\left({x}_i\right)-{I}_{jN}\left({x}_i\right)\right|}^{\lambda }+{\left|{F}_{jM}\left({x}_i\right)-{F}_{jN}\left({x}_i\right)\right|}^{\lambda}\right)\right\}}^{\raisebox{1ex}{$1$}\!\left/ \!\raisebox{-1ex}{$\lambda $}\right.}. $$
(11)

If λ = 1, the weighted similarity measure based on the Hamming distance is as follows.

$$ {S}_H\left(M,N\right)=1-{D}_H\left(M,N\right)=1-\sum \limits_{i=1}^n{\omega}_i\frac{1}{k}\sum \limits_{j=1}^k\left\{\frac{1}{3}\left(\left|{T}_{jM}\left({x}_i\right)-{T}_{jN}\left({x}_i\right)\right|+\left|{I}_{jM}\left({x}_i\right)-{I}_{jN}\left({x}_i\right)\right|+\left|{F}_{jM}\left({x}_i\right)-{F}_{jN}\left({x}_i\right)\right|\right)\right\}. $$
(12)

If λ = 2, then the weighted similarity measure based on the Euclidean distance is as follows:

$$ {S}_E\left(M,N\right)=1-{D}_E\left(M,N\right)=1-\sum \limits_{i=1}^n{\omega}_i\frac{1}{k}\sum \limits_{j=1}^k\sqrt{\frac{1}{3}\left({\left|{T}_{jM}\left({x}_i\right)-{T}_{jN}\left({x}_i\right)\right|}^2+{\left|{I}_{jM}\left({x}_i\right)-{I}_{jN}\left({x}_i\right)\right|}^2+{\left|{F}_{jM}\left({x}_i\right)-{F}_{jN}\left({x}_i\right)\right|}^2\right)}. $$
(13)

3.3 New entropy of RSVNN

Determining attribute weights based on information entropy is a widely used method. Entropy is an important tool for measuring uncertain attribute information. A greater entropy value implies greater uncertainty in the information. Information entropy is a hot issue in the research of uncertain information [73, 74]. The neutrosophic set is mainly used to deal with uncertain, inconsistent information. Thus, using entropy to calculate weights is very suitable in the neutrosophic set environment. Simultaneously, we use the distance measure to define the neutrosophic entropy, which can simplify the overall decision-making model, reduce the calculation amount, and strike a balance between method objectivity, rationality, and complexity. Therefore, inspired by the literature [75, 76], this study proposes the extended entropy measures of RSVNN and gives the following definition of entropy for RSVNN in various forms.

Definition 10

A real function ERSVNN : RSVNN → [0, 1] is called an entropy measure for an RSVNN, and r = 〈(T1r, T2r, ⋯, Tkr), (I1r, I2r, ⋯, Ikr), (F1r, F2r, ⋯, Fkr)〉 is an RSVNN. Then, the entropy measure is ERSVNN(r) = 1 − 2D(r, r), and r = 〈(0.5,0.5, ⋯, k  times), (0.5,0.5, ⋯, k  times), (0.5,0.5, ⋯, k  times)〉. The new entropy of RSVNN based on the distance measure is as follows.

$$ {E}_{RSVNN}(r)=1-2D\left(r,{r}^{\prime}\right)=1-2\frac{1}{k}\sum \limits_{j=1}^k{\left\{\frac{1}{3}\left({\left|{T}_{jr}\left({x}_i\right)-{T}_{j{r}^{\prime }}\left({x}_i\right)\right|}^{\lambda }+{\left|{I}_{jr}\left({x}_i\right)-{I}_{j{r}^{\prime }}\left({x}_i\right)\right|}^{\lambda }+{\left|{F}_{jr}\left({x}_i\right)-{F}_{j{r}^{\prime }}\left({x}_i\right)\right|}^{\lambda}\right)\right\}}^{\raisebox{1ex}{$1$}\!\left/ \!\raisebox{-1ex}{$\lambda $}\right.}. $$
(14)

Theorem 3

The defined entropy ERSVNN(r) of Definition 10 satisfies the following properties.

(P1) ERSVNN(r) = 0if r is a crisp number;

(P2) ERSVNN(r) = 1, if and only if r = r = 〈(0.5,0.5, ⋯, k  times), (0.5,0.5, ⋯, k  times), (0.5,0.5, ⋯, k  times)〉;

(P3) If D(r, r) ≥ D(l, r), then ERSVNN(r) ≤ ERSVNN(l) for r, l are RSVNNs, where D is the distance of two RSVNNs;

(P4) ERSVNN(r) = ERSVNN(rc), where rc is the complement of r.

The proof process of Theorem 3 can be found in the Appendix.

Remark 1

In Theorem 3, some properties of entropy for RSVNN are introduced based on the above distance measures. These conditions in Theorem 3 imply the following properties.

(P1) A crisp set is not fuzzy, i.e., when an RSVNN reduces to a crisp number, it is not vague;

(P2) The RSVNN r = 〈(0.5,0.5, ⋯, k  times), (0.5,0.5, ⋯, k  times), (0.5,0.5, ⋯, k  times)〉 is the fuzziest one;

(P3) The closer an RSVNN is to r, the fuzzier it is;

(P4) An RSVNN has the same fuzziness as its complement;

Meanwhile, according to the relationship between similarity measure and distance measure S(r, r) = 1 − D(r, r), we can get

$$ {E}_{RSVNN}(r)=1-2D\left(r,{r}^{\prime}\right)=2S\left(r,{r}^{\prime}\right)-1 $$
(15)

When λ = 1, \( D\left(r,{r}^{\prime}\right)=\frac{1}{k}\sum \limits_{j=1}^k\left\{\frac{1}{3}\left(\left|{T}_{jr}\left({x}_i\right)-0.5\right|+\left|{I}_{jr}\left({x}_i\right)-0.5\right|+\left|{F}_{jr}\left({x}_i\right)-0.5\right|\right)\right\} \) is a Hamming distance; then, the new entropy based on distance measure is given by

$$ {E}_{RSVNN}\left(\overset{\sim }{n}\right)=1-2\frac{1}{k}\sum \limits_{j=1}^k\left\{\frac{1}{3}\left(\left|{T}_{jr}\left({x}_i\right)-0.5\right|+\left|{I}_{jr}\left({x}_i\right)-0.5\right|+\left|{F}_{jr}\left({x}_i\right)-0.5\right|\right)\right\} $$
(16)

When λ = 2, \( D\left(r,{r}^{\prime}\right)=\frac{1}{k}\sum \limits_{j=1}^k\sqrt{\frac{1}{3}\left({\left|{T}_{jr}\left({x}_i\right)-0.5\right|}^2+{\left|{I}_{jr}\left({x}_i\right)-0.5\right|}^2+{\left|{F}_{jr}\left({x}_i\right)-0.5\right|}^2\right)} \) is a Euclidean distance; then, the new entropy based on distance measure is as follows.

$$ {E}_{RSVNN}\left(\overset{\sim }{n}\right)=1-2\frac{1}{k}\sum \limits_{j=1}^k\sqrt{\frac{1}{3}\left({\left|{T}_{jr}\left({x}_i\right)-0.5\right|}^2+{\left|{I}_{jr}\left({x}_i\right)-0.5\right|}^2+{\left|{F}_{jr}\left({x}_i\right)-0.5\right|}^2\right)} $$
(17)

4 Multi-attribute decision making method based on neutrosophic entropy and EDAS method with RSVNSs

4.1 Problem description

RSVNSs can not only represent the primary attribute value and the sub-attribute value, but also represent the state value of the attribute at different times. To achieve our objectives, the problem description and the proposed method consist of the following several steps that are depicted graphically in Fig. 1.

Fig. 1
figure 1

Framework of the proposed MADM based on neutrosophic entropy and EDAS method with RSVNS

In a decision-making problem with multiple attributes and sub-attributes, there is a set of alternatives X = {X1, X2, ⋯, Xm} and a set of attributes C = {C1, C2, ⋯, Cn}, where Cj(j = 1, 2, ⋯, n) may be split into a set of ksub-criteria \( {C}_j=\left\{{c}_{1j},{c}_{2j},\cdots, {c}_{k_jj}\right\}\kern0.33em \left(j=1,2,\cdots, n\right) \). Let ω = {ω1, ω2, ⋯, ωn} be the potential weighting vector of the attribute, where ωj ∈ [0, 1]  (j = 1, 2, ⋯, n) and \( \sum \limits_{j=1}^n{\omega}_j=1 \). If the DMs provide refined single-valued neutrosophic set to evaluate the alternative Xi(i = 1, 2, ⋯, m) under the attribute Cj(j = 1, 2, ⋯, n), it can be characterized by.

SVNS\( {X}_i=\left\{\left\langle \begin{array}{c}{C}_j,\left({T}_{X_i}\left({c}_{1j}\right),{T}_{X_i}\left({c}_{2j}\right),\cdots, {T}_{X_i}\left({c}_{k_jj}\right)\right),\\ {}\left({I}_{X_i}\left({c}_{1j}\right),{I}_{X_i}\left({c}_{2j}\right),\cdots, {I}_{X_i}\left({c}_{k_jj}\right)\right),\left({F}_{X_i}\left({c}_{1j}\right),{F}_{X_i}\left({c}_{2j}\right),\cdots, {F}_{X_i}\left({c}_{k_jj}\right)\right)\end{array}\right\rangle \left|{C}_j\in C,{c}_{kj}\in {C}_j\right.\right\} \). Then, for convenience, each basic element in the RSVNS is represented by the RSVNN \( {x}_{ij}=\left\langle \left({T}_{i1j},{T}_{i2j},\cdots, {T}_{i{k}_jj}\right),\left({I}_{i1j},{I}_{i2j},\cdots, {I}_{i{k}_jj}\right),\left({F}_{i1j},{F}_{i2j},\cdots, {F}_{i{k}_jj}\right)\right\rangle \) for i = 1, 2, ⋯, m, j = 1, 2, ⋯, n. Hence, we can construct the refined single-valued neutrosophic decision matrix D = (xij)m × n, as shown in Table 1.

Table 1 Refined single-valued neutrosophic decision matrix D = (xij)m × n

4.2 Determination of attribute weight-based entropy

For decision problems with unknown attribute weight, this study proposes a method based on neutrosophic entropy to determine the attribute weight. Information entropy represents the uncertainty in the attribute information. The greater the entropy value, the greater the uncertainty of the information. In this article, attribute indicators are divided into primary attributes and sub-attributes. Therefore, the calculation of attribute weight is a little complicated, which can be evaluated by the following formula.

$$ {\omega}_j=\frac{1-\frac{1}{m}\sum \limits_{i=1}^m{E}_{RSVNN}\left({x}_{ij}\right)}{\sum_{j=1}^n\left(1-\frac{1}{m}\sum \limits_{i=1}^m{E}_{RSVNN}\left({x}_{ij}\right)\right)}. $$
(18)

Of course, for the problem of unknown expert weight in group decision-making, information entropy can also be used to determine the expert weight.

$$ {e}^f=\frac{\sum_{j=1}^n{\omega}_j\left(1-\frac{1}{m}\sum \limits_{i=1}^m{E}_{RSVNN}\left({x}_{ij}^f\right)\right)}{\sum_{f=1}^g{\sum}_{j=1}^n{\omega}_j\left(1-\frac{1}{m}\sum \limits_{i=1}^m{E}_{RSVNN}\left({x}_{ij}^f\right)\right)}. $$
(19)

where ef represents the weight of the fth expert in the decision-making group composed of g experts and \( {x}_{ij}^f \) represents the decision value in the decision matrix \( {D}^f={\left({x}_{ij}^f\right)}_{m\times n} \) of the f-th expert.

4.3 Steps in the proposed method

The current decision-making environment is increasingly complicated, where ωj is unknown, and the evaluation information is expressed as RSVNSs. Thus, the steps in the proposed method are as follows.

  • Step 1: Give the decision matrix D = (xij)m × n provided by DMs in the form of RSVNS.

  • Step 2: Obtain the normalized decision matrix \( \overline{D}={\left({\overline{x}}_{ij}\right)}_{m\times n} \). We need to standardize the decision information to ensure consistency in information. In general, attributes can be categorized into two types: benefit attributes and cost attributes. In this paper, all attribute values are converted to benefit-type attribute values, and if they are cost-type attribute values, they are changed using the following formula:

    $$ {x}_{ij}^c=\left\langle \left({F}_{i1j},{F}_{i2j},\cdots, {F}_{i{k}_jj}\right),\left(1-{I}_{i1j},1-{I}_{i2j},\cdots, 1-{I}_{i{k}_jj}\right),\left({T}_{i1j},{T}_{i2j},\cdots, {T}_{i{k}_jj}\right)\right\rangle . $$
  • Step 3: Determine the attribute weights using the neutrosophic entropy based on Eq. (14) and Eq. (18).

  • Step 4: Aggregate the decision matrix to obtain the average solution (AV) for all attributes based on the RSVNS aggregation operator for aggregation operation. Here, because the essence of RSVNS is a set of single-valued neutrosophic numbers, we can define the RSVNS weighted arithmetic averaging (RSVNSWAA) operator such that the relevant calculation formula is as follows.

$$ {\displaystyle \begin{array}{l} AV={\left[A{V}_j\right]}_{1\times n}={\left[\frac{\sum_{i=1}^m{\overline{x}}_{ij}}{m}\right]}_{1\times n},\\ {} RSVNSWAA\left({x}_{1j},{x}_{2j},\cdots, {x}_{mj}\right)=\frac{\sum_{i=1}^m{\overline{x}}_{ij}}{m}\\ {}=\left\langle \begin{array}{c}\left(\left(1-\prod \limits_{i=1}^m{\left(1-{T}_{i1j}\right)}^{\raisebox{1ex}{$1$}\!\left/ \!\raisebox{-1ex}{$m$}\right.}\right),\left(1-\prod \limits_{i=1}^m{\left(1-{T}_{i2j}\right)}^{\raisebox{1ex}{$1$}\!\left/ \!\raisebox{-1ex}{$m$}\right.}\right),\cdots, \left(1-\prod \limits_{i=1}^m{\left(1-{T}_{i{k}_jj}\right)}^{\raisebox{1ex}{$1$}\!\left/ \!\raisebox{-1ex}{$m$}\right.}\right)\right),\\ {}\left(\prod \limits_{i=1}^m{\left({I}_{i1j}\right)}^{\raisebox{1ex}{$1$}\!\left/ \!\raisebox{-1ex}{$m$}\right.},\prod \limits_{i=1}^m{\left({I}_{i2j}\right)}^{\raisebox{1ex}{$1$}\!\left/ \!\raisebox{-1ex}{$m$}\right.},\cdots, \prod \limits_{i=1}^m{\left({I}_{i{k}_jj}\right)}^{\raisebox{1ex}{$1$}\!\left/ \!\raisebox{-1ex}{$m$}\right.}\right),\\ {}\left(\prod \limits_{i=1}^m{\left({F}_{i1j}\right)}^{\raisebox{1ex}{$1$}\!\left/ \!\raisebox{-1ex}{$m$}\right.},\prod \limits_{i=1}^m{\left({F}_{i2j}\right)}^{\raisebox{1ex}{$1$}\!\left/ \!\raisebox{-1ex}{$m$}\right.},\cdots, \prod \limits_{i=1}^m{\left({F}_{i{k}_jj}\right)}^{\raisebox{1ex}{$1$}\!\left/ \!\raisebox{-1ex}{$m$}\right.}\right)\end{array}\right\rangle .\end{array}} $$
(20)
  • Step 5: Calculate the PDA and NDA based on AV, where

$$ PDA={\left[ PD{A}_{ij}\right]}_{m\times n}=\frac{\max \left(0,\left( Sc\left({\overline{x}}_{ij}\right)- Sc\left(A{V}_j\right)\right)\right)}{Sc\left(A{V}_j\right)}, $$
(21)
$$ NDA={\left[ ND{A}_{ij}\right]}_{m\times n}=\frac{\max \left(0,\left( Sc\left(A{V}_j\right)- Sc\left({\overline{x}}_{ij}\right)\right)\right)}{Sc\left(A{V}_j\right)}. $$
(22)

Here, for convenience, we can use the score function of RSVNS in Definition 6 to compare the two RSVNNs. However, if the PDA and NDA of the two schemes are the same, it is necessary to further recalculate the PDA and NDA based on the accuracy function to ensure that the alternatives can be fully sorted.

  • Step 6: Calculate the weighted PDAij and weighted NDAij to obtain SPi and SNi, where

$$ S{P}_i=\sum \limits_{j=1}^n{\omega}_j PD{A}_{ij}, $$
(23)
$$ S{N}_i=\sum \limits_{j=1}^n{\omega}_j ND{A}_{ij}. $$
(24)
  • Step 7: Normalize SPi and SNi to obtain NSPi and NSNi, where

$$ NS{P}_i=\frac{S{P}_i}{\max \left(S{P}_i\right)}, $$
(25)
$$ NS{N}_i=1-\frac{S{N}_i}{\max \left(S{N}_i\right)}. $$
(26)
  • Step 8: Calculate the appraisal score (AS) values of every alternative based on NSPi and NSNi, where

$$ A{S}_i=\frac{1}{2}\left( NS{P}_i+ NS{N}_i\right). $$
(27)
  • Step 9: Rank the alternatives according to the AS. Thus, we can choose the best alternative (alternatives) or rank alternatives. In general, the bigger the value of Ui is, the better the selected alternative will be.

5 Case study and comparative analysis

5.1 Case study

Fujian Province is located in the southeastern coastal area of China and is one of the most economically developed areas in China. However, the region has been devastated by typhoons on an annual basis, affecting the economic development of the region and causing huge losses in terms of people’s lives and property. Effectively estimating the disaster losses caused by typhoons is a matter of great concern to the decision-making departments and the people. Thus, we evaluate the post-stroke situation and apply the theory of neutrosophic set to the disaster losses due to typhoons to provide auxiliary decision-making for the disasters in relevant departments and provide assistance for keeping the people informed and for social stability. Taking the strong typhoon “Maria” that occurred in Fujian Province in July 2018 as an example, after the disaster, we quickly obtained data from multiple sources for disaster assessment. Inspired by the literature [68, 77], we constructed an evaluation indicator system. The assessment targets X = {X1, X2, ⋯, X9} were nine counties and cities in Fujian Province; specifically, Nanping (X1), Ningde (X2), Sanming (X3), Fuzhou (X4), Putian (X5), Longyan (X6), Quanzhou (X7), Xiamen (X8), and Zhangzhou (X9). The primary indicators C = {C1, C2, C3, C4} in the assessment included People’s safety (C1), Economic loss (C2), Environmental damage (C3), and Social impact (C4). The sub-indicators were \( {C}_1=\left\{{c}_{11},{c}_{2_11}\right\} \) with Population death (c11) and Population affected (\( {c}_{2_11} \)), \( {C}_2=\left\{{c}_{12},{c}_{2_22}\right\} \) with Housing damage (c12) and Economic damage (\( {c}_{2_22} \)), \( {C}_3=\left\{{c}_{13},{c}_{2_33}\right\} \) with Environmental impact (c13) and Agricultural damage (\( {c}_{2_33} \)), and \( {C}_4=\left\{{c}_{14},{c}_{2_44}\right\} \) with Social stability (c14) and Other impact (\( {c}_{2_44} \)). The nine assessment objects were evaluated using the refined single-valued neutrosophic sets by DMs or experts under two-level indicators. Thus, the assessment matrix D = (xij)m × n was given in the form of RSVNSs. In addition, in this section, we study the disaster assessment problem in two cases from practical problems, where the evaluation indicators are divided into first-level indicators and sub-indicators. One case is multi-level indicator evaluation; that is, the evaluation indicators are divided into first and second-level indicators. Another case is dynamic evaluation, that is, the value of the evaluation matrix is not static; it has multiple evaluation values under different states in different periods.

5.1.1 Case 1: Typhoon disaster assessment with multi-layer indicators

It is suitable to use RSVNS to evaluate the multi-layer indicators of typhoon disasters. It can not only express the uncertainty of the evaluation, but also express the evaluation data simply and concisely, and it is convenient to calculate. According to Section 4, TDA using the proposed MADM model contains the following steps.

  • Step 1: Obtain evaluation data. First, we invited several experts to give the assessment data expressed by RSVNSs in Table 2.

Table 2 Multi-layer indicators assessment matrix D = (xij)m × n
  • Step 2: Obtain the normalized evaluation matrix \( \overline{D} \). Because all the attributes in this article are of the same type, they do not need to be standardized.

  • Step 3: Determine the attribute weights using the neutrosophic entropy based on Eq. (14) and Eq. (18). First, the entropy values of evaluation information based on Eq. (14) are presented in Table 3.

Table 3 Entropy values of evaluation information

Then, the attribute weights are determined according to Eq. (18).

ω1 = 0.2283, ω2 = 0.2554, ω3 = 0.2659, ω4 = 0.2503.

  • Step 4: Obtain average solution (AV) for all attributes using the RSVNSWAA operator defined in Eq. (20).

$$ A{V}_1=\left\langle \left(\mathrm{0.6768,0.6505}\right),\left(\mathrm{0.3209,0.3427}\right),\left(\mathrm{0.3541,0.3898}\right)\right\rangle, $$
$$ A{V}_2=\left\langle \left(\mathrm{0.5923,0.6202}\right),\left(\mathrm{0.3998,0.3725}\right),\left(\mathrm{0.4404,0.3430}\right)\right\rangle, $$
$$ A{V}_3=\left\langle \left(\mathrm{0.5210,0.5357}\right),\left(\mathrm{0.4666,0.4531}\right),\left(\mathrm{0.5342,0.5102}\right)\right\rangle, $$
$$ A{V}_4=\left\langle \left(\mathrm{0.3522,0.7087}\right),\left(\mathrm{0.6319,0.2601}\right),\left(\mathrm{0.6037,0.2319}\right)\right\rangle . $$
  • Step 5: Calculate the PDAij and NDAij based on Eq. (21) and Eq. (22), respectively. The calculation results are presented in Table 4.

Table 4 The values of PDAij and NDAij
  • Step 6: Obtain SPi and SNi based on the weighted PDAij and NDAij in Eq. (23) and Eq. (24), respectively.

SP1 = 0.0000, SP2 = 0.2987, SP3 = 0.0000, SP4 = 0.1207, SP5 = 0.2509, SP6 = 0.0000, SP7 = 0.0388, SP8 = 0.0000,SP9 = 0.2071.

SN1 = 0.7615, SN2 = 0.000, SN3 = 0.8054, SN4 = 0.0000, SN5 = 0.0000, SN6 = 0.4809, SN7 = 0.2738, SN8 = 0.2907, SN9 = 0.0075.

  • Step 7: Obtain NSPi and NSNi by normalizing SPi and SNi based on Eq. (25) and Eq. (26), respectively .

NSP1 = 0.0000, NSP2 = 1.000, NSP3 = 0.0000, NSP4 = 0.4040, NSP5 = 0.8400, NSP6 = 0.0000, NSP7 = 0.1299, NSP8 = 0.0000, NSP9 = 0.6935.

NSN1 = 0.0546, NSN2 = 1.000, NSN3 = 0.0000, NSN4 = 1.0000, NSN5 = 1.0000, NSN6 = 0.4030, NSN7 = 0.6600, NSN8 = 0.6391, NSN9 = 0.9907.

  • Step 8: Calculate the ASi values using NSPi and NSNi based on Eq. (27).

AS1 = 0.0273, AS2 = 1.0000, AS3 = 0.0000, AS4 = 0.7020, AS5 = 0.9200, AS6 = 0.2015, AS7 = 0.3950, AS8 = 0.3195, AS9 = 0.8421.

  • Step 9: Rank the alternatives based on ASi. From the calculation results in step 8 and Fig. 2, it is evident that UND ≻ UPT ≻ UZZ ≻ UFZ ≻ UQZ ≻ UXM ≻ ULY ≻ UNP ≻ USM. Thus, the ranking results of the impact of typhoons in nine cities are ND ≻ PT ≻ ZZ ≻ FZ ≻ QZ ≻ XM ≻ LY ≻ NP ≻ SM. According to the assessment results, the relevant management departments can effectively respond to disasters while rationally distributing relief materials and resources, thereby reducing the bad impact of typhoon disasters on people’s lives.

Fig. 2
figure 2

Ranking results of the evaluation cities

5.1.2 Case 2: Dynamic assessment of typhoon disaster

The dynamic decision algorithm differs from the traditional static decision method. It takes multiple values at different time points. The decision result of the dynamic decision method is more scientific and effective, and it can better provide decision support for relevant departments. Assume the assessment targets X = {X1, X2, ⋯, X9} are nine counties and the indicator system is C = {C1, C2, C3, C4} in the assessment, including People’s life safety (C1), Economic loss (C2), Environmental damage (C3), and Social impact (C4). The evaluation values are sampled at three time points t1, t2, t3 after the typhoon disaster occurs. Thus, it is appropriate that the nine assessment objects are to be evaluated using the refined single-valued neutrosophic sets by DMs or experts at multiple points in time. Hence, the assessment matrix  D = (xij)m × n  with \( {x}_{ij}=\left\langle \left({T}_{i1j},{T}_{i2j},\cdots, {T}_{i{k}_jj}\right),\left({I}_{i1j},{I}_{i2j},\cdots, {I}_{i{k}_jj}\right),\left({F}_{i1j},{F}_{i2j},\cdots, {F}_{i{k}_jj}\right)\right\rangle \) is given in the form of RSVNS. According to Section 4, the dynamic assessment of typhoon disasters using the proposed MADM model contains the following steps:

  • Step 1: Obtain evaluation data. First, we invited several experts to give the assessment data sampled at three time points expressed by RSVNSs in Table 5.

Table 5 Dynamic assessment matrix D = (xij)m × n
  • Step 2: Because all attributes are of the same type, the assessment matrix D = (xij)m × n does not need to be standardized.

  • Step 3: Determine the attribute weights for the dynamic assessment matrix based on Eq. (14) and Eq. (18), as follows.

ω1 = 0.2333, ω2 = 0.2372, ω3 = 0.2863, ω4 = 0.2431.

  • Step 4: Obtain the AV for all attributes using the RSVNSWAA operator defined in Eq. (20).

$$ A{V}_1=\left\langle \left(\mathrm{0.5893,0.5906,0.7055}\right),\left(\mathrm{0.4081,0.3983},0.2830\right),\left(\mathrm{0.4435,0.3454,0.3298}\right)\right\rangle, $$
$$ A{V}_2=\left\langle \left(\mathrm{0.5225,0.5081,0.6202}\right),\left(\mathrm{0.4681,0.4757,0.3725}\right),\left(\mathrm{0.5342,0.4296,0.3430}\right)\right\rangle, $$
$$ A{V}_3=\left\langle \left(\mathrm{0.4967,0.5456,0.5425}\right),\left(\mathrm{0.4864,0.4423,0.4465}\right),\left(\mathrm{0.5695,0.5040,0.4267}\right)\right\rangle, $$
$$ A{V}_4=\left\langle \left(\mathrm{0.5562,0.5529,0.5618}\right),\left(\mathrm{0.4269,0.4106,0.3972}\right),\left(\mathrm{0.4054,0.3753,0.3654}\right)\right\rangle . $$
  • Step 5: Calculate PDAij and NDAij based on Eq. (21) and Eq. (22), respectively; the calculation results are presented in Table 6.

Table 6 The values of PDAij and NDAij for dynamic assessment
  • Step 6: Obtain SPi and SNi based on the weighted PDAij and weighted NDAij in Eq. (23) and Eq. (24), respectively.

SP1 = 0.0000, SP2 = 0.2881, SP3 = 0.0000, SP4 = 0.1570, SP5 = 0.2416, SP6 = 0.0000, SP7 = 0.0257, SP8 = 0.0418, SP9 = 0.2167.

SN1 = 0.7040, SN2 = 0.000, SN3 = 0.7149, SN4 = 0.0087, SN5 = 0.0000, SN6 = 0.4545, SN7 = 0.3157, SN8 = 0.3447, SN9 = 0.0000.

  • Step 7: Obtain NSPi and NSNi by normalizing SPi and SNi based on Eq. (25) and Eq. (26), respectively.

NSP1 = 0.0000, NSP2 = 1.000, NSP3 = 0.0000, NSP4 = 0.5449, NSP5 = 0.8336, NSP6 = 0.0000, NSP7 = 0.0893, NSP8 = 0.1452, NSP9 = 0.7521.

NSN1 = 0.0152, NSN2 = 1.000, NSN3 = 0.0000, NSN4 = 0.9878, NSN5 = 1.0000, NSN6 = 0.3643, NSN7 = 0.5582, NSN8 = 0.5178, NSN9 = 1.000.

  • Step 8: Calculate the ASi values using NSPi and NSNi based on Eq. (27).

AS1 = 0.0076, AS2 = 1.0000, AS3 = 0.0000, AS4 = 0.7664, AS5 = 0.9193, AS6 = 0.1821, AS7 = 0.3238, AS8 = 0.3315, AS9 = 0.8760.

  • Step 9: Rank the alternatives based on ASi. From the calculation results in the previous step and Fig. 3, it is evident that UND ≻ UPT ≻ UZZ ≻ UFZ ≻ UXM ≻ UQZ ≻ ULY ≻ UNP ≻ USM. Thus, the ranking results of the impact of typhoons in the nine cities are ND ≻ PT ≻ ZZ ≻ FZ ≻ XM ≻ QZ ≻ LY ≻ NP ≻ SM. The results of dynamic assessment are basically consistent with the results of multi-level indicator evaluation. Only a slight difference was observed because dynamic assessment takes data at different time points and the data is large. Simultaneously, the severity of the typhoon disaster is different at different time points. In particular, in the short time immediately after the typhoon, the data monitored by the public sentiment are uncertain and not sufficiently accurate. Therefore, the average evaluation value after multiple sampling can eliminate the adverse effects.

Fig. 3
figure 3

Ranking results of the evaluation cities

5.2 Validity test for the proposed method

Inspired by the literature [78, 79], this study ascertained the validity of the proposed method. The preference relationship between the alternatives meets the following three criteria:

  1. (1)

    Non-substitutability: An effective MADM method should not change the indication of the best alternative on replacing a non-optimal alternative by another worse alternative without changing the relative importance of each decision criterion [79].

  2. (2)

    Transitivity: An effective method should follow the transitive property. That is, if Xi ≻ Xj and Xj ≻ Xk, then Xi ≻ Xk, (i, j, k = 1, 2, ⋯, m).

  3. (3)

    Consistency: If all alternatives are considered as a set and each subset of the set is ranked by the same evaluation method, the preference relations of the alternatives of the subset and those of the alternatives in the set are consistent. That is, there is a set of alternatives X = {Xi, Xj, Xk, Xl, Xm}, and the sorting result based on our method is Xi ≻ Xj ≻ Xk ≻ Xl ≻ Xm. If X = {Xj, Xl, Xm} is a subset of X, the sorting result is Xj ≻ Xl ≻ Xm.

5.2.1 Validity test of the assessment methods using criterion 1

  1. (1)

    For the validity test of the multi-layer indicator assessment method, first, we exchange the truth-membership degree (T) with the falsity-membership degree (F) for any non-optimal and worse alternative, and then apply the proposed method to evaluate them. If we choose X1 (NP) as the non-optimal alternative and X3 (SM) as the worse alternative, then the transformed evaluation matrix is Dc = (xijc)m × n:

    $$ {D}_1^c={\displaystyle \begin{array}{c}\begin{array}{c}\\ {} NP\\ {}\end{array}\\ {} ND\\ {}\begin{array}{c}\\ {} SM\\ {}\end{array}\\ {} FZ\\ {} PT\\ {} LY\\ {} QZ\\ {} XM\\ {} ZZ\end{array}}\left[\begin{array}{cccc}\left\langle \begin{array}{c}\left(0.60,0.90\right),\\ {}\left(0.65,0.85\right),\\ {}\left(0.35,0.10\right)\end{array}\right\rangle, & \left\langle \begin{array}{c}\left(0.95,0.95\right),\\ {}\left(0.90,0.90\right),\\ {}\left(0.05,0.05\right)\end{array}\right\rangle, & \left\langle \begin{array}{c}\left(0.90,0.95\right),\\ {}\left(0.85,0.90\right),\\ {}\left(0.10,0.05\right)\end{array}\right\rangle, & \left\langle \begin{array}{c}\left(0.95,0.75\right),\\ {}\left(0.90,0.60\right),\\ {}\left(0.05,0.20\right)\end{array}\right\rangle \\ {}\cdots & \cdots & \cdots & \cdots \\ {}\left\langle \begin{array}{c}\left(0.80,0.95\right),\\ {}\left(0.75,0.90\right),\\ {}\left(0.20,0.05\right)\end{array}\right\rangle, & \left\langle \begin{array}{c}\left(0.90,0.95\right),\\ {}\left(0.85,0.90\right),\\ {}\left(0.10,0.05\right)\end{array}\right\rangle & \left\langle \begin{array}{c}\left(0.90,0.95\right),\\ {}\left(0.85,0.90\right),\\ {}\left(0.10,0.05\right)\end{array}\right\rangle, & \left\langle \begin{array}{c}\left(0.95,0.85\right),\\ {}\left(0.90,0.66\right),\\ {}\left(\mathrm{0.05,0.10}\right)\end{array}\right\rangle \\ {}\cdots & \cdots & \cdots & \cdots \\ {}\cdots & \cdots & \cdots & \cdots \\ {}\cdots & \cdots & \cdots & \cdots \\ {}\cdots & \cdots & \cdots & \cdots \\ {}\cdots & \cdots & \cdots & \cdots \\ {}\cdots & \cdots & \cdots & \cdots \end{array}\right] $$

Based on the transformed matrix, the new ASi for each alternative can be obtained as AS1 = 0.4354, AS2 = 0.9952, AS3 = 0.4542, AS4 = 0.5718, AS5 = 0.8451, AS6 = 0.0000, AS7 = 0.1844, AS8 = 0.1351, AS9 = 0.8861. It is evident that UND ≻ UZZ ≻ UPT ≻ UFZ ≻ USM ≻ UNP ≻ UQZ ≻ UXM ≻ ULY. and the ranking results of the impact of typhoons in nine cities are ND ≻ ZZ ≻ PT ≻ FZ ≻ SM ≻ NP ≻ QZ ≻ XM ≻ LY. Because the best alternative is again ND, which is the same as that of the evaluation problem before exchanging data, it is confirmed that the proposed method does not change the indication of the best alternative when a non-optimal alternative is replaced by another worst alternative. Hence the proposed multi-layer indicator assessment method is valid for the non-substitutability of criterion 1 [78, 79].

  1. (2)

    For the validity test of the dynamic assessment method, we use X1 (NP) and X3 (SM) as the transformation objects. The transformed \( {X}_1^c \) (NP) and \( {X}_3^c \) (SM) are as follows.

    $$ {X}_1^c=\left\{\left\langle \begin{array}{c}\left(0.45,0.60,0.90\right),\\ {}\left(0.50,0.65,0.85\right),\\ {}\left(0.50,0.35,0.10\right)\end{array}\right\rangle, \left\langle \begin{array}{c}\left(0.90,0.95,0.95\right),\\ {}\left(0.85,0.90,0.90\right),\\ {}\left(0.10,0.05,0.05\right)\end{array}\right\rangle, \left\langle \begin{array}{c}\left(0.80,0.90,0.95\right),\\ {}\left(0.75,0.85,0.90\right),\\ {}\left(0.20,0.10,0.05\right)\end{array}\right\rangle, \left\langle \begin{array}{c}\left(0.95,0.90,0.75\right),\\ {}\left(0.90,0.85,0.60\right),\\ {}\left(0.05,0.10,0.20\right)\end{array}\right\rangle \right\}, $$
$$ {X}_3^c=\left\{\left\langle \begin{array}{c}\left(0.60,0.80,0.95\right),\\ {}\left(0.65,0.75,0.90\right),\\ {}\left(0.35,0.20,0.05\right)\end{array}\right\rangle, \left\langle \begin{array}{c}\left(0.90,0.80,0.95\right),\\ {}\left(0.85,0.75,0.90\right),\\ {}\left(0.10,0.20,0.05\right)\end{array}\right\rangle, \left\langle \begin{array}{c}\left(0.80,0.90,0.95\right),\\ {}\left(0.75,0.85,0.90\right),\\ {}\left(0.20,0.10,0.05\right)\end{array}\right\rangle, \left\langle \begin{array}{c}\left(0.95,0.75,0.85\right),\\ {}\left(0.90,0.60,0.66\right),\\ {}\left(\mathrm{0.05,0.20},0.10\right)\end{array}\right\rangle \right\}. $$

Based on the transformed matrix, the new ASi for each alternative can be obtained as AS1 = 0.4453, AS2 = 0.9927, AS3 = 0.4611, AS4 = 0.6979, AS5 = 0.8342, AS6 = 0.0000, AS7 = 0.1355, AS8 = 0.1158, AS9 = 0.9053. Thus, UND ≻ UZZ ≻ UPT ≻ UFZ ≻ USM ≻ UNP ≻ UQZ ≻ UXM ≻ ULY, and the ranking results of the impact of typhoons in the nine cities are ND ≻ ZZ ≻ PT ≻ FZ ≻ SM ≻ NP ≻ QZ ≻ XM ≻ LY. Hence, the proposed dynamic assessment method is valid for the non-substitutability of criterion 1.

5.2.2 Validity test for the assessment methods using criterion 2 and criterion 3

  1. (1)

    We first decompose this large evaluation problem into a small problem set, and then solve the small problem separately using the proposed method. The results are listed in Table 7:

Table 7 Small problems of decomposition and their sorting results

If we merge the sorting results of small problems, we can get the overall sorting results of case 1 and case 2 as ND ≻ PT ≻ ZZ ≻ FZ ≻ QZ ≻ XM ≻ LY ≻ NP ≻ SM and ND ≻ PT ≻ ZZ ≻ FZ ≻ XM ≻ QZ ≻ LY ≻ NP ≻ SM, respectively. These results are consistent with the ranking results of the undecomposed evaluation questions. Thus, the proposed method is valid for the transitivity of criterion 2 and consistency of criterion 3.

5.3 Comparative analysis

5.3.1 Sensitivity analysis of parameter in distance measure

To illustrate the robustness of the proposed evaluation method, sensitivity analysis was conducted in this study on the parameters λ in the proposed new distance formula. The results are shown in Table 8 and Fig. 4.

Table 8 Ranking result R and attribute weight ω for different λ
Fig. 4
figure 4

Ranking results of the evaluation cities for different λ in distance measure for case 1

It is evident from Fig. 4 that when the parameter λ in distance measurement takes different values, the ranking results of the evaluated objects are exactly the same, which shows that the parameters have little or no influence on the evaluation results, thus indicating that the proposed method has certain compatibility and robustness.

5.3.2 Comparative analysis of evaluation methods based on different distance measures

In this section, inspired by the literature [80], we compare our decision-making methods with several existing approaches. First, this study modified the distance measures proposed in the literature [31, 37, 38, 81,82,83,84] to adapt to the refined single-valued neutrosophic sets environment, and then compared them with the distance measures proposed in this study. The corresponding comparison results of the two cases (case 1 is an evaluation example with multi-level indicators and case 2 is an example for dynamic evaluation) are given in Table 9, Table 10, and Fig. 5.

  1. 1.

    Jaccard, Dice, and cosine distance measures proposed by Chen et al. [31, 81].

Table 9 Ranking results based on different distance measures for Case 1
Table 10 Ranking results based on different distance measures for Case 2
Fig. 5
figure 5

Comparison results of evaluation methods based on different distance measures

$$ {D}_{Jaccard}\left(M,N\right)=1-{R}_{Jaccard}\left(M,N\right)=1-\frac{1}{n}\sum \limits_{i=1}^n\frac{1}{k}\sum \limits_{j=1}^k\frac{T_{jM}\left({x}_i\right){T}_{jN}\left({x}_i\right)+{I}_{jM}\left({x}_i\right){I}_{jN}\left({x}_i\right)+{F}_{jM}\left({x}_i\right){F}_{jN}\left({x}_i\right)}{\begin{array}{c}\Big[\left({T}_{jM}^2\left({x}_i\right)+{I}_{jM}^2\left({x}_i\right)+{F}_{jM}^2\left({x}_i\right)\right)+\left({T}_{jN}^2\left({x}_i\right)+{I}_{jN}^2\left({x}_i\right)+{F}_{jN}^2\left({x}_i\right)\right)\\ {}-\left({T}_{jM}\left({x}_i\right){T}_{jN}\left({x}_i\right)+{I}_{jM}\left({x}_i\right){I}_{jN}\left({x}_i\right)+{F}_{jM}\left({x}_i\right){F}_{jN}\left({x}_i\right)\right)\Big]\end{array}}. $$
(28)
$$ {D}_{Dice}\left(M,N\right)=1-{R}_{Dice}\left(M,N\right)=1-\frac{1}{n}\sum \limits_{i=1}^n\frac{1}{k}\sum \limits_{j=1}^k\frac{2\left({T}_{jM}\left({x}_i\right){T}_{jN}\left({x}_i\right)+{I}_{jM}\left({x}_i\right){I}_{jN}\left({x}_i\right)+{F}_{jM}\left({x}_i\right){F}_{jN}\left({x}_i\right)\right)}{\left({T}_{jM}^2\left({x}_i\right)+{I}_{jM}^2\left({x}_i\right)+{F}_{jM}^2\left({x}_i\right)\right)+\left({T}_{jN}^2\left({x}_i\right)+{I}_{jN}^2\left({x}_i\right)+{F}_{jN}^2\left({x}_i\right)\right)}. $$
(29)
$$ {D}_{cosine}\left(M,N\right)=1-{R}_{cosine}\left(M,N\right)=1-\frac{1}{n}\sum \limits_{i=1}^n\frac{1}{k}\sum \limits_{j=1}^k\frac{T_{jM}\left({x}_i\right){T}_{jN}\left({x}_i\right)+{I}_{jM}\left({x}_i\right){I}_{jN}\left({x}_i\right)+{F}_{jM}\left({x}_i\right){F}_{jN}\left({x}_i\right)}{\sqrt{T_{jM}^2\left({x}_i\right)+{I}_{jM}^2\left({x}_i\right)+{F}_{jM}^2\left({x}_i\right)}\sqrt{T_{jN}^2\left({x}_i\right)+{I}_{jN}^2\left({x}_i\right)+{F}_{jN}^2\left({x}_i\right)}}. $$
(30)
  1. 2.

    Distance measure proposed by Fan and Ye [38].

$$ D\left(M,N\right)=1-\frac{1}{n}\sum \limits_{i=1}^n\sum \limits_{j=1}^k\cos \left\{\frac{\pi }{6}\left(\left|{T}_{jM}\left({x}_i\right)-{T}_{jN}\left({x}_i\right)\right|+\left|{I}_{jM}\left({x}_i\right)-{I}_{jN}\left({x}_i\right)\right|+\left|{F}_{jM}\left({x}_i\right)-{F}_{jN}\left({x}_i\right)\right|\right)\right\}/k. $$
(31)
  1. 3.

    Modified distance measure based on the cosine similarity measure proposed by Ye [82].

$$ D\left(M,N\right)=1-S\left(M,N\right)=1-\frac{1}{n}\sum \limits_{i=1}^n\frac{1}{k}\sum \limits_{j=1}^k\cos \left\{\frac{\pi }{2}\left(\left|{T}_{jM}\left({x}_i\right)-{T}_{jN}\left({x}_i\right)\right|\vee \left|{I}_{jM}\left({x}_i\right)-{I}_{jN}\left({x}_i\right)\right|\vee \left|{F}_{jM}\left({x}_i\right)-{F}_{jN}\left({x}_i\right)\right|\right)\right\}. $$
(32)
  1. 4.

    Modified distance measure-1 based on the tangent similarity measure proposed by Ye [83].

$$ D\left(M,N\right)=1-S{T}_1\left(M,N\right)=\frac{1}{n}\sum \limits_{i=1}^n\frac{1}{k}\sum \limits_{j=1}^k\tan \left(\frac{\pi }{4}\max \left(\left|{T}_{jM}\left({x}_i\right)-{T}_{jN}\left({x}_i\right)\right|,\left|{I}_{jM}\left({x}_i\right)-{I}_{jN}\left({x}_i\right)\right|,\left|{F}_{jM}\left({x}_i\right)-{F}_{jN}\left({x}_i\right)\right|\right)\right). $$
(33)
  1. 5.

    Modified distance measure-2 based on tangent similarity measure proposed by Ye [83].

$$ D\left(M,N\right)=1-S{T}_2\left(M,N\right)=\frac{1}{n}\sum \limits_{i=1}^n\frac{1}{k}\sum \limits_{j=1}^k\tan \left(\frac{\pi }{12}\left(\left|{T}_{jM}\left({x}_i\right)-{T}_{jN}\left({x}_i\right)\right|+\left|{I}_{jM}\left({x}_i\right)-{I}_{jN}\left({x}_i\right)\right|+\left|{F}_{jM}\left({x}_i\right)-{F}_{jN}\left({x}_i\right)\right|\right)\right). $$
(34)
  1. 6.

    Modified distance measure based on Majumdar and Samanta’s similarity measure proposed by Ye and Smarandache [37].

$$ D\left(M,N\right)=1-M\left(M,N\right)=1-\frac{\sum \limits_{i=1}^n\sum \limits_{j=1}^k\left\{\min \left({T}_{jM}\left({x}_i\right),{T}_{jN}\left({x}_i\right)\right)+\min \left({I}_{jM}\left({x}_i\right),{I}_{jN}\left({x}_i\right)\right),\min \left({F}_{jM}\left({x}_i\right),{F}_{jN}\left({x}_i\right)\right)\right\}}{\sum \limits_{i=1}^n\sum \limits_{j=1}^k\left\{\max \left({T}_{jM}\left({x}_i\right),{T}_{jN}\left({x}_i\right)\right)+\max \left({I}_{jM}\left({x}_i\right),{I}_{jN}\left({x}_i\right)\right),\max \left({F}_{jM}\left({x}_i\right),{F}_{jN}\left({x}_i\right)\right)\right\}}. $$
(35)
  1. 7.

    Modified distance measure based on the hybrid vector similarity measure proposed by Pramanik et al. [84].

$$ D\left(M,N\right)=1- Hy{b}_{SVRNS}\left(M,N\right)=1-\frac{1}{k}\sum \limits_{j=1}^k\left\langle \frac{1}{n}\left[\begin{array}{c}\alpha \sum \limits_{i=1}^n\frac{2\left({T}_{jM}\left({x}_i\right)\cdot {T}_{jN}\left({x}_i\right)+{I}_{jM}\left({x}_i\right)\cdot {I}_{jN}\left({x}_i\right)+{F}_{jM}\left({x}_i\right)\cdot {F}_{jN}\left({x}_i\right)\right)}{\left[{\left({T}_{jM}\left({x}_i\right)\right)}^2+{\left({I}_{jM}\left({x}_i\right)\right)}^2+{\left({F}_{jM}\left({x}_i\right)\right)}^2+{\left({T}_{jN}\left({x}_i\right)\right)}^2+{\left({I}_{jN}\left({x}_i\right)\right)}^2+{\left({F}_{jN}\left({x}_i\right)\right)}^2\right]}\\ {}+\left(1-\alpha \right)\sum \limits_{i=1}^n\frac{\left({T}_{jM}\left({x}_i\right)\cdot {T}_{jN}\left({x}_i\right)+{I}_{jM}\left({x}_i\right)\cdot {I}_{jN}\left({x}_i\right)+{F}_{jM}\left({x}_i\right)\cdot {F}_{jN}\left({x}_i\right)\right)}{\left[\sqrt{{\left({T}_{jM}\left({x}_i\right)\right)}^2+{\left({I}_{jM}\left({x}_i\right)\right)}^2+{\left({F}_{jM}\left({x}_i\right)\right)}^2}\cdot \sqrt{{\left({T}_{jN}\left({x}_i\right)\right)}^2+{\left({I}_{jN}\left({x}_i\right)\right)}^2+{\left({F}_{jN}\left({x}_i\right)\right)}^2}\right]}\end{array}\right]\right\rangle . $$
(36)

From Table 9, Table 10, and Fig. 5, it is evident that the results of the proposed method and the existing methods are completely consistent, which illustrates the rationality and effectiveness of the proposed method.

5.3.3 Comparative analysis of different methods

In this section, we consider the proposed method based on the EDAS approach and nine other methods (specifically, the function-based method, TOPSIS-based method, our similarity-based method, method proposed by Fan et al. [38], method of weighted Jaccard similarity proposed by Chen et al. [31, 81], method of weighted dice similarity proposed by Chen et al. [31, 81], method of weighted cosine similarity proposed by Chen et al. [31, 81], method of hybrid vector similarity proposed by Pramanik et al. [84], and the method of extended similarity proposed by Ye and Smarandache [37]) to illustrate the advantages of the proposed method. The comparison results are presented in Table 11 and Fig. 6.

Table 11 Comparative analysis of different methods
Fig. 6
figure 6

Comparative analysis of different methods

In this section, the traditional function-based method is used to calculate the weighted score function value of each scheme based on Eq. (3) proposed in this study, and obtain the sorting result. The TOPSIS-based method calculates the distance between each solution and the positive ideal solution \( {x}_{ij}^{+}=\left\langle \left(\max {T}_{i1j},\max {T}_{i2j},\cdots, \max {T}_{ik_jj}\right),\left(\min {I}_{i1j},\min {I}_{i2j},\cdots, \min {I}_{ik_jj}\right),\left(\min {F}_{i1j},\min {F}_{i2j},\cdots, \min {F}_{ik_jj}\right)\right\rangle \) and the distance between each solution and the negative ideal solution.

\( {x}_{ij}^{-}=\left\langle \left(\min {T}_{i1j},\min {T}_{i2j},\cdots, \min {T}_{ik_jj}\right),\left(\max {I}_{i1j},\max {I}_{i2j},\cdots, \max {I}_{ik_jj}\right),\left(\max {F}_{i1j},\max {F}_{i2j},\cdots, \max {F}_{ik_jj}\right)\right\rangle \), to obtain the values of closeness coefficients, and finally, the sorting result. Our similarity-based method calculates the weighted similarity value (OS) for each alternative. The positive ideal solution based on the proposed similarity measure is calculated to be \( {x}_{ij}^{+} \). The method proposed by Fan et al. [38] first introduced a cosine similarity measure, then calculated the weighted cosine similarity (WCS) measure value for each alternative and the positive ideal solution \( {x}_{ij}^{+} \), and finally ranked the alternatives according to WCS. The method-1 proposed by Chen et al. and Karaaslan [31, 81] is similar to the method proposed by Fan and Ye [38], which calculates the weighted Jaccard similarity (WJS) measure value for each alternative and the positive ideal solution \( {x}_{ij}^{+} \), and finally ranks the alternatives according to WJS. Method-2 proposed by Chen et al. and Karaaslan [31, 81] calculates the weighted dice similarity (WDS) measure value for each alternative and the positive ideal solution \( {x}_{ij}^{+} \), and finally ranks the alternatives according to WDS. Method-3 proposed by Chen et al. and Karaaslan [31, 81] calculates the weighted cosine similarity (WCS) measure value for each alternative and the positive ideal solution \( {x}_{ij}^{+} \), and finally ranks the alternatives according to WCS. The method proposed by Pramanik et al. [84] calculates the weighted hybrid vector similarity (WHVS) measure value for each alternative and the positive ideal solution \( {x}_{ij}^{+} \), and finally ranks the alternatives according to WHVS. The method proposed by Ye and Smarandache [37] calculates the weighted extended similarity (WES) measure value for each alternative and the positive ideal solution \( {x}_{ij}^{+} \), and finally ranks the alternatives according to WES. It is evident from Table 11 and Fig. 6 that the sorting results for the five methods are basically the same, and the optimal alternative is identical, except for the methods proposed by Chen et al. [31, 81], literature [38], and Pramanik et al. [84] for case 1. We believe that this happened because the weights of the attributes used in the calculation are uniformly obtained using the information entropy method in this study; the other reason is that as compared to the proposed EDAS and TOPSIS methods, these methods only consider the relationship between the scheme and ideal solution, instead of that between the scheme and negative ideal solution. Although the methods proposed by Chen et al. [31, 81], Fan et al. [38], and Pramanik et al. [84] are simple, they only calculate the weighted similarity between each alternative and the ideal solution, which has certain irrationality. However, the EDAS method in this study considers the solution more comprehensively. In addition, the relative value of the evaluation object based on the EDAS method is more evident and easy to distinguish.

5.4 Advantages of the proposed method

In this section, we analyze and summarize the advantages of the proposed method as follows.

  1. (1)

    We proposed a multi-criteria decision-making method under refined single-valued neutrosophic sets environment, for which, to the best of our knowledge, not many related studies have been conducted. Then, we applied the method to the typhoon disaster assessment problem and studied multi-level index evaluation and dynamic evaluation, which have not been seen in related research.

  2. (2)

    The EDAS method adopted here aims to find the best solution through two distance measures, namely, the PDA and the NDA. In comparison to previously proposed methods [31,32,33,34,35,36,37,38], which only considered the weighted similarity between the alternatives and the positive ideal solution, our method is more comprehensive and reasonable.

  3. (3)

    In this study, the generalized distance measure of refined single-valued neutrosophic sets is proposed, and the definition of refined single-valued neutrosophic entropy is introduced based on this distance measure which helps in determining the attribute weight. Such distance and information entropy balance definition makes our evaluation method simple and effective, and ensures that the evaluation results are more objective and effective in comparison with the direct assumptions of other methods [31,32,33,34,35,36,37,38].

6 Conclusion

This paper proposed a multi-attribute decision-making method based on information entropy and the EDAS method under a refined single-valued neutrosophic sets environment to solve the decision-making problem that has both attributes and sub-attributes, in which the attribute weight is unknown. The new distance measure, similarity measure, and neutrosophic entropy were defined based on the refined single-valued neutrosophic sets. The relationship between these attributes was also discussed and the attribute weights obtained using the new entropy. The extended EDAS method was used to rank and select the best alternatives. Two illustrative examples for TDA (TDA with multi-layer indicators and dynamic assessment of typhoon disaster) were presented to demonstrate the feasibility, effectiveness, and practicality of the proposed method. The advantages of the algorithm were demonstrated by sensitivity analysis and comparative analysis with other methods. In the future, we will further enhance the proposed method considering the following aspects: more accurate network data acquisition, practical application and improvement of the proposed method, and extension of the proposed method to other data environments, such as Pythagorean fuzzy set and picture fuzzy set. We will also continue to study the theory of neutrosophic sets, their decision-making methods, and their applications in TDA.