India dropped its target of 500 GW of renewable energy capacity fossil fuel sources by 2030. Its responsibilities the United Nations Framework Convention Climate Change [UNFCCC],and reducing radiations by one billion tonnes by the end of the decade at the COP26 conference, held in Glasgow in November 2022. Researchers are continually searching for inexhaustible and reasonable energy sources. Solar energy is one of the greenest sources of energy and is also one of the cleanest. The most important factor in using (...) solar energy is the location of the solar power plant. The main objective of this study is to find the best location for a new solar power plant in a specific region called Bundelkhand region of Uttar Pradesh in India. Here we offer an extension of ELECTRE III method as two-phase Pythagorean neutrosophic elimination and choice translating reality PN-ELECTRE-III) method to adapt with fuzzy, ambiguous, unsure, and indeterminate criteria. The Pythagorean neutrosophic numbers [PNNs] used by the group decision support system of PN-ELECTRE III to measure performance of the alternatives. The options are entirely outclassed in the subsequent stage in view of the past stage's evaluations of them. By defining PNN we describe the technique of indifference threshold functions, preference treshold and veto threshold functions, which provide a more stable basis to drop outranking relations. By calculating the concordance credibility, discordance credibility and net credibility degrees of each alternative, the ranking module of the PN-ELECTRE III approach is made simpler. In order to confirm the applicability of the strategy suggested in this paper, the location selection problem for solar plants is finaly solved. (shrink)

Clustering algorithm is one of the important research topics in the field of machine learning. Neutrosophic clustering is the generalization of fuzzy clustering and has been applied to many fields. This paper presents a new neutrosophic clustering algorithm with the help of regularization. Firstly, the regularization term is introduced into the FC-PFS algorithm to generate sparsity, which can reduce the complexity of the algorithm on large data sets. Secondly, we propose a method to simplify the process of determining regularization parameters. (...) Finally, experiments show that the clustering results of this algorithm on artificial data sets and real data sets are mostly better than other clustering algorithms. Our clustering algorithm is effective in most cases. (shrink)

In this paper, we first propose the concept of divergence measure on neutrosophic sets. We also provide some formulas for the divergence measure for neutrosophic sets. After that, we investigate the properties of proposed neutrosophic divergence measure. Finally, we also apply these formulas in medical problem and the classification problem.

The notion of neutrosophic cubic set is originated from the hybridization of the concept of neutrosophic set and interval valued neutrosophic set. We define similarity measure for neutrosophic cubic sets and prove some of its basic properties. We present a new multi criteria group decision making method with linguistic variables in neutrosophic cubic set environment. Finally, we present a numerical example to demonstrate the usefulness and applicability of the proposed method.

The purpose of this study is to propose new similarity measures namely rough variational coefficient similarity measure under the rough neutrosophic environment. The weighted rough variational coefficient similarity measure has been also defined. The weighted rough variational coefficient similarity measures between the rough ideal alternative and each alternative are xxxxx calculated to find the best alternative. The ranking order of all the alternatives can be determined by using the numerical values of similarity measures. Finally, an illustrative example has been provided (...) to show the effectiveness and validity of the proposed approach. Comparisons of decision results of existing rough similarity measures have been provided. (shrink)