A novel interval-valued neutrosophic AHP with cosine similarity measure

Boltürk, Eda; Kahraman, Cengiz

doi:10.1007/s00500-018-3140-y

Cited by 131 publications

(66 citation statements)

References 63 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The analytic hierarchy process (AHP) is a multi-criteria decision-making method that was proposed by Saaty in the early 1980s [28]. AHP can decompose a complex problem into different layers or factors [29] and assign proper weights to various factors, hence it is suitable to the vulnerability system in this study [30].…”

Section: Analytic Hierarchy Processmentioning

confidence: 99%

A GIS-Based Support Vector Machine Model for Flash Flood Vulnerability Assessment and Mapping in China

Xiong

Cheng

et al. 2019

IJGI

View full text Add to dashboard Cite

Flash floods are one of the natural disasters that threaten the lives of many people all over the world every year. Flash floods are significantly affected by the intensification of extreme climate events and interactions with exposed and vulnerable socio-economic systems impede regional development processes. Hence, it is important to estimate the loss due to flash floods before the disaster occurs. However, there are no comprehensive vulnerability assessment results for flash floods in China. Fortunately, the National Mountain Flood Disaster Investigation Project provided a foundation to develop this proposed assessment. In this study, an index system was established from the exposure and disaster reduction capability categories, and is based on analytic hierarchy process (AHP) methods. We evaluated flash flood vulnerability by adopting the support vector machine (SVM) model. Our results showed 439 counties with high and extremely high vulnerability (accounting for 10.5% of the land area and corresponding to approximately 100 million hectares (ha)), 571 counties with moderate vulnerability (accounting for 19.18% of the land area and corresponding to approximately 180 million ha), and 1128 counties with low and extremely low vulnerability (accounting for 39.43% of the land area and corresponding to approximately 370 million ha). The highly-vulnerable counties were mainly concentrated in the south and southeast regions of China, moderately-vulnerable counties were primarily concentrated in the central, northern, and southwestern regions of China, and low-vulnerability counties chiefly occurred in the northwest regions of China. Additionally, the results of the spatial autocorrelation suggested that the “High-High” values of spatial agglomeration areas mainly occurred in the Zhejiang, Fujian, Jiangxi, Hunan, Guangxi, Chongqing, and Beijing areas. On the basis of these results, our study can be used as a proposal for population and building distribution readjustments, and the management of flash floods in China.

show abstract

Section: Analytic Hierarchy Processmentioning

confidence: 99%

A GIS-Based Support Vector Machine Model for Flash Flood Vulnerability Assessment and Mapping in China

Xiong

Cheng

et al. 2019

IJGI

View full text Add to dashboard Cite

show abstract

“…Broumi et al [43] proposed SPP under interval valued neutrosophic setting. Bolturk and Kahraman [44] presented a novel IVN AHP with cosine similarity measure. Wang et al [45] proposed interval neutrosophic set and logic in detail.…”

Section: Literature Of Reviewmentioning

confidence: 99%

“…We use the score function (SF) which represents a map from [N (R)] into the real line. In the literature there are some deneutrosophication formulas, here paper, we focus on some of types [24,25,33,34,44] defined as follows:…”

Section: Definition 24 [45] Letmentioning

confidence: 99%

The shortest path problem in interval valued trapezoidal and triangular neutrosophic environment

Nagarajan

Bakali

Talea

et al. 2019

Complex Intell. Syst.

View full text Add to dashboard Cite

Real-life decision-making problem has been demonstrated to cover the indeterminacy through single valued neutrosophic set. It is the extension of interval valued neutrosophic set. Most of the problems of real life involve some sort of uncertainty in it among which, one of the famous problem is finding a shortest path of the network. In this paper, a new score function is proposed for interval valued neutrosophic numbers and SPP is solved using interval valued neutrosophic numbers. Additionally, novel algorithms are proposed to find the neutrosophic shortest path by considering interval valued neutrosophic number, trapezoidal and triangular interval valued neutrosophic numbers for the length of the path in a network with illustrative example. Further, comparative analysis has been done for the proposed algorithm with the existing method with the shortcoming and advantage of the proposed method and it shows the effectiveness of the proposed algorithm.Keywords Interval valued triangular neutrosophic number · Interval valued trapezoidal neutrosophic number · Ranking methods · Deneutrosophication · Neutrosophic shortest path problem · Network Introduction and literature of reviewIn this part, introduction to the objective of the paper is given by presenting basic concepts and procedure of the shortest path problem (SPP) and the literature of review have been collected to know the recent work related to the presented concept which shows the novelty of the presented work * Said Broumi Publisher's Note Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

show abstract

“…Mehmet [18] put forward for analyzing the concept of the interval cut set (ICS) and strong ICS (α, β, γ) of IVNSs with proof and examples. Also, there are other several extensions of NSs described in the literature including intervalvalued bipolar neutrosophic sets [19], hesitant interval neutrosophic linguistic set [20], and interval neutrosophic hesitant fuzzy sets [21]; for more details of neutrosophic set and their extensions, we refer the reader to [22][23][24][25][26][27][28].…”

Section: Introduction and Review Of The Literaturementioning

confidence: 99%

Shortest path problem using Bellman algorithm under neutrosophic environment

Dey¹,

Talea

Bakali

et al. 2019

Complex Intell. Syst.

View full text Add to dashboard Cite

An elongation of the single-valued neutrosophic set is an interval-valued neutrosophic set. It has been demonstrated to deal indeterminacy in a decision-making problem. Real-world problems have some kind of uncertainty in nature and among them; one of the influential problems is solving the shortest path problem (SPP) in interconnections. In this contribution, we consider SPP through Bellman's algorithm for a network using interval-valued neutrosophic numbers (IVNNs). We proposed a novel algorithm to obtain the neutrosophic shortest path between each pair of nodes. Length of all the edges is accredited an IVNN. Moreover, for the validation of the proposed algorithm, a numerical example has been offered. Also, a comparative analysis has been done with the existing methods which exhibit the advantages of the new algorithm.Publisher's Note Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

show abstract

A novel interval-valued neutrosophic AHP with cosine similarity measure

Cited by 131 publications

References 63 publications

A GIS-Based Support Vector Machine Model for Flash Flood Vulnerability Assessment and Mapping in China

A GIS-Based Support Vector Machine Model for Flash Flood Vulnerability Assessment and Mapping in China

The shortest path problem in interval valued trapezoidal and triangular neutrosophic environment

Shortest path problem using Bellman algorithm under neutrosophic environment

Contact Info

Product

Resources

About