In this paper, we introduce the integer programming in neutrosophic environment, by considering coffecients of problem as a triangulare neutrosophic numbers. The degrees of acceptance, indeterminacy and rejection of objectives are simultaneously considered. The Neutrosophic Integer Programming Problem (NIP) is transformed into a crisp programming model, using truth membership (T), indeterminacy membership (I), and falsity membership (F) functions as well as single valued triangular neutrosophic numbers. To measure the efficiency of the (...) model, we solved several numerical examples. (shrink)

The science of operations research is one of the modern sciences that have made a great revolution in all areas of life through the methods provided by it, suitable and appropriate to solve most of the problems that were facing researchers, scholars and those interested in the development of societies, and the most beneficiaries of this science were companies and institutions that are looking for scientific methods that help them manage their work so that they achieve the greatest profit and (...) the lowest cost, and one of the important methods that have been used in the management of companies we offer in this research two methods, Dynamic programming method. This method has been used in many practical matters and helped decision-makers in companies to achieve a maximum profit and less cost by formulating the reality of the state of the company and the data provided by decision-makers with a dynamic mathematical model that is solved using methods of solving dynamic models and we will provide in this research an example of this through the issue of choosing the optimal investment for the budget of a company so that it achieves a maximum profit, and the method of programming with integers: the method that provided these companies with solutions with integer values suitable for the nature of its work, through the use of the binary integer in the formulation of the appropriate mathematical model on the one hand, and on the other hand, the use of the binary integer variable helped to convert some nonlinear models that lead to some practical problems into linear models, and it should be noted here that in the previous two methods there is something indeterminable because we must make a decision in choosing or not choosing something, but the optimal solution that we will get remains A specific value because we are building the mathematical model for any realistic issue through the data provided by those responsible for the work and these data are calculated quantities and therefore they are uncertain values because their validity depends on the circumstances surrounding the work environment, they may be exposed to increase or decrease, and therefore the optimal solution on which the company will base its decision is suitable for specific values and any change in them can cause the company an uncalculated loss, so in this research we will use the concepts of neutrosophic science, the branch of science founded by the American scientist Florentin Smarandache in 1995 based on his belief that there is no absolute truth, a science that is interested in the study of ideas and concepts that are neither true nor false, but just in between, and we will take the data (calculated quantities) neutrosophic values that are specified or unspecified values are any set close to the calculated quantities, then the resulting mathematical model is a neutrosophic model and the optimal solution has neutrosophic values and thanks to the indefinite uncertainty that these values have, companies from the development of appropriate plans for all circumstances and thus achieve the greatest profit and the lowest cost, and we will clarify the above through two issues, the issue of optimal designation of a warehouse site, which we will formulate the mathematical model of using the neutrosophic integer programming method - and the issue of capital budget, which we will present in two different forms, we use in the first form the neutrosophic integer programming method and in the second the neutrosophic dynamic programming method. (shrink)

One of the most important theories in linear programming is the dualistic theory and its basic idea is that for every linear model has dual linear model, so that solving the original linear model gives a solution to the dual model. Therefore, when we solving the linear programming model, we actually obtain solutions for two linear models. In this research, we present a study of the models. The neutrosophic dual and the binary simplex algorithm, which works to (...) find the optimal solution for the original and dual models at the same time. The importance of this algorithm is evident in that it is relied upon in several operations research topics, such as integer programming algorithms, some nonlinear programming algorithms, and sensitivity analysis in linear programming. (shrink)

Operations research science is defined as the science that is concerned with applying scientific methods to complex problems in managing and directing large systems of people, including resources and tools in various fields, private and governmental work, peace and war, politics, administration, economics, planning and implementation in various domains. It uses scientific methods that take the language of mathematics as a basis for it and uses computer, without which it would not have been possible to achieve numerical solutions to the (...) raised problems, those that need correct solutions, when the solutions abound and the options are multiple, so we need a decision based on correct scientific foundations and takes into account all the circumstances and changes that you can encounter the decision-maker during the course of work, and nothing is left to chance or luck, but rather everything that enters into the account and plays its role in decision-making, and we get that when we use the concepts of neutrosophic science to reformulate what the science of operations research presented in terms of methods and methods to solve many practical problems, so we will present in this research a study aimed at shedding light on the most important methods used to solve nonlinear models, which is the Lagrangian multiplier method for nonlinear models constrained by equality and then reformulated using the concepts of neutrosophic science. (shrink)

An important method for finding the optimal solution for linear and nonlinear models is the graphical method, which is used if the linear or nonlinear mathematical model contains one, two, or three variables. The models that contain only two variables are among the most models for which the optimal solution has been obtained graphically, whether these models are linear or non-linear in references and research that are concerned with the science of operations research, when the data of the issue under (...) study is classical data. In this research, we will present a study through, which we present the graphical method for solving Neutrosophical nonlinear models in the following case: A nonlinear programming issue, the objective function is a nonlinear function, and the constraints are linear functions. Note that we can use the same method if (i) the objective function follower is a linear follower and the constraints are nonlinear; (ii) the objective function is a non-linear follower and the constraints are non-linear. In the three cases, the nonlinear models are neutrosophic, and as we know, the mathematical model is a nonlinear model if any of the components of the objective function or the constraints are nonlinear expressions, and the nonlinear expressions may be in both. At the left end of the constraints are neutrosophic values, at least one or all of them. Then, the possible solutions to the neutrosophic nonlinear programming problem are the set of rays that fulfills all the constraints. As for the region of possible solutions, it is the region that contains all the rays that fulfill the constraints. The optimal solution is the beam that fulfills all constraints and at which the function reaches a maximum or minimum value, depending on the nature of the issue under study (noting that it is not necessary to be alone). (shrink)

In this paper, Taylor series is used to solve neutrosophic multi-objective programming problem (NMOPP). In the proposed approach, the truth membership, Indeterminacy membership, falsity membership functions associated with each objective of multi-objective programming problems are transformed into a single objective linear programming problem by using a first order Taylor polynomial series. Finally, to illustrate the efficiency of the proposed method, a numerical experiment for supplier selection is given as an application of Taylor series method for solving (...) neutrosophic multi-objective programming problem at end of this paper. (shrink)

In this paper, we have developed an Excel package to be utilized for calculating neutrosophic data and analyze them. The use of object oriented programming techniques and concepts as they may apply to the design and development a new framework to implement neutrosophic data operations, the c# programming language, NET Framework and Microsoft Visual Studio are used to implement the neutrosophic classes. We have used Excel as it is a powerful tool that is widely accepted (...) and used for statistical analysis. Figure 1 shows Class Diagram of the implemented package. Figure 2 presents a working example of the package interface calculating the complement. Our implemented Neutrosophic package can calculate Intersection, Union, and Complement of the nuetrosophic set. Figure 3 presents our neutrosphic package capability to draw figures of presented neutrosphic set. Figure 4 presents charting of Union operation calculation, and figure 5 Intersection Operation. nuetrosophic set are characterized by its efficiency as it takes into consideration the three data items: True, Intermediate, and False. (shrink)

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)

The linear programming method is one of the important methods of operations research that has been used to address many practical issues and provided optimal solutions for many institutions and companies, which helped decision makers make ideal decisions through which companies and institutions achieved maximum profit, but these solutions remain ideal and appropriate in If the conditions surrounding the work environment are stable, because any change in the data provided will affect the optimal solution and to avoid losses and (...) achieve maximum profit, we have, in previous research, reformulated the linear models using the concepts of neutrosophic science, the science that takes into account the instability of conditions and fluctuations in the work environment and leaves nothing to chance. While taking data, neutrosophic values carry some indeterminacy, giving a margin of freedom to decision makers. In another research, we reformulated one of the most important methods used to solve linear models, which is the simplex method, using the concepts of this science, and as a continuation of what we did in the previous two researches, we will reformulate in this research. The graphical method for solving linear models using the concepts of neutrosophics. We will also shed light on a case that is rarely mentioned in most operations research references, which is that when the difference between the number of unknowns and the number of constraints is equal to one, two, or three, we can also find the optimal solution graphically for some linear models. This is done by taking advantage of the conditions of non-negativity that linear models have, and we will explain this through an example in which the difference is equal to two. Also, through examples, we will explain the difference between using classical values and neutrosophic values and the extent of this’s impact on the optimal solution. (shrink)

Science is the basis for managing the affairs of life and human activities, and living without knowledge is a form of wandering and a kind of loss. Using scientific methods helps us understand the foundations of choice, decision-making, and adopting the right solutions when solutions abound and options are numerous. Operational research is considered the best that scientific development has provided because its methods depend on the application of scientific methods in solving complex issues and the optimal use of available (...) resources in various fields, private and governmental work in peace and war, in politics and economics, in planning and implementation, and in various aspects of life. Its basic essence is to use the data provided for the issue under study to build a mathematical model that is the optimal solution. It is the basis on which decision makers rely in managing institutions and companies, and when operations research methods meet with the neutrosophic teacher, we get ideal solutions that take into account all the circumstances and fluctuations that may occur in the work environment over time. One of the most important operations research methods is the linear programming method. Which prompted us to reformulate the linear models, the graphical method, and the simplex method, which are used to obtain the optimal solution for linear models using the concepts of neutrosophic science. In this research, and as a continuation of what we presented previously, we will reformulate the modified simplex algorithm that was presented to address the difficulty that we were facing when applying the direct simplex algorithm. It is the large number of calculations required to be performed in each step of the solution, which requires a lot of time and effort. (shrink)

We all know that problems of transportation and allocation appear frequently in practical life. We need to transfer materials from production centers to consumption centers to secure the areas’ need for the transported material or allocate machines or people to do a specific job at the lowest cost, or in the shortest time. We know that the cost factors Time is one of the most important factors that decision-makers care about because it plays an “important” role in many of the (...) practical and scientific issues that we face in our daily lives, and we need careful study to enable us to avoid losses. For this, the linear programming method was used, which is one of the research methods. Processes, where the problem data is converted into a linear mathematical model for which the optimal solution achieves the desired goal. Since these models are linear models, we can solve them using the direct simplex method and its modifications, but the specificity that these models enjoy has enabled scholars and researchers to find special methods that help us in obtaining the optimal solution. Whatever the method used, the goal is to determine the number of units transferred from any material from production centers to consumption centers, or to allocate a machine or person to do a job so that the cost or time is as short as possible. These issues were addressed according to classical logic, but the ideal solution was a specific value appropriate to the conditions in which the data was collected and does not take into account the changes that may occur in the work environment. In order to obtain results that are more accurate and enjoy a margin of freedom, we present in this book a study of transport issues and neutrosophic allocation issues and some methods for solving them. By neutrosophic issues we mean These are the problems in which the data are neutrosophic values, i.e. the required quantities and the available quantities. (shrink)

The overall goal of the approach developed in this paper is to estimate the likelihood of a given kinetic kill scenario between hostile spacebased adversaries using the mathematical framework of Complex Conceptual Spaces Single Observation. Conceptual spaces are a cognitive model that provide a method for systematically and automatically mimicking human decision making. For accurate decisions to be made, the fusion of both hard and soft data into a single decision framework is required. This presents several challenges to this data (...) fusion framework. The first is the challenge involved in handling multiple complex terminologies, which is addressed by drawing on a set of Space Domain Ontologies. Another challenge is the complex combinatorics involved when considering all possible feature combinations. This can be mitigated by using integer linear programming optimization that is outlined by the Complex Conceptual Spaces Single Observation mathematical model framework. A third challenge is the complicated physics that is involved in a spacecraft collision that must be addressed to obtain a better understanding of threat assessment. Overcoming these various challenges allows for a quantitative ranking for the potential of a kinetic kill collision across multiple spacecraft pairs. In addition to overcoming these challenges this paper will break down threat assessment into four domains and identify a ranking of threat both for each individual domain and for the four domains combined. Simulation results are shown to verify the developed concepts. (shrink)

This paper describes an AFOSR-supported basic research program that focuses on developing a new framework for combining hard with soft data in order to improve space situational awareness. The goal is to provide, in an automatic and near real-time fashion, a ranking of possible threats to blue assets (assets trying to be protected) from red assets (assets with hostile intentions). The approach is based on Conceptual Spaces models, which combine features from traditional associative and symbolic cognitive models. While Conceptual Spaces (...) are revolutionary, they lack an underlying mathematical framework. Several such frameworks have attempted to represent Conceptual Spaces, but by far the most robust is the model developed by Holender. His model utilizes integer linear programming in order to obtain an overall similarity value between observations and concepts that support the formation of hypotheses. This paper will describe a method for building Conceptual Spaces models for threats that utilizes ontologies as a means to provide a clear semantic foundation for this inferencing process; in particular threat ontologies and space domain ontologies are developed and employed in this approach. A space situational awareness use-case is presented involving a kinetic kill scenario and results are shown to assess the performance of this fusion-based inferencing framework. (shrink)

The Bohr radius for an ionizing electron (H atom) follows a hyperbolic spiral. At specific spiral angles, the angle components cancel returning an integer value for the radius (360°=4r, 360+120°=9r, 360+180°=16r, 360+216°=25r ... 720°= ∞r), and as the orbital radius at these angles (by including wavelengths) matches the principal quantum number n energy levels, this spiral can be used to calculate the transition frequencies for each n. A gravitational orbital simulation program was modified for atomic orbitals by the addition (...) of an extra fine structure constant alpha term. In this simulation, the orbital (Bohr) radius is treated as analogous to the photon albeit of inverse or reverse phase whereby orbital radius + photon = zero (cancel). The orbital radius rotates, pulling the electron in a circular orbit, during transition the incoming photon attaches to the orbital radius, extending it in discrete steps (the electron itself has a passive role). As the orbital radius continues its rotation during the transition phase, the electron follows this spiral pattern (as it crosses each energy level). As these spiral angles (0 < φ < 720°) can be used to derive the n quantum levels, we can ask if quantization of the atom is a geometrical function of this alpha spiral, and if so, this would indicate a role of alpha within the atom. (shrink)

Previous work has shown that the Complex Conceptual Spaces − Single Observation Mathematical framework is a useful tool for event characterization. This mathematical framework is developed on the basis of Conceptual Spaces and uses integer linear programming to find the needed similarity values. The work of this paper is focused primarily on space event characterization. In particular, the focus is on the ranking of threats for malicious space events such as a kinetic kill. To make the Conceptual Spaces (...) framework work, the similarity values between the contents of observations on the one hand and the properties of the entities observed on the other needs to be found. This paper shows how to exploit Dempster-Shafer theory to implement a statistical approach for finding these similarities values. This approach will allow a user to identify the uncertainty involved in similarity value data, which can later be propagated through the developed mathematical model in order for the user to know the overall uncertainty in the observation-to-concept mappings needed for space event characterization. (shrink)

Clearing algorithms are at the core of modern payment systems, facilitating the settling of multilateral credit messages with (near) minimum transfers of currency. Traditional clearing procedures use batch processing based on MILP - mixed-integer linear programming algorithms. The MILP approach demands intensive computational resources; moreover, it is also vulnerable to operational risks generated by possible defaults during the inter-batch period. This paper presents TORC3 - the Token-Ring Clearing Algorithm for Currency Circulation. In contrast to the MILP approach, TORC3 (...) is a real time heuristic procedure, demanding modest computational resources, and able to completely shield the clearing operation against the participating agents’ risk of default. (shrink)

In this book the authors introduce and study the following notions: Neutrosophic Crisp Points, Neutrosophic Crisp Relations, Neutrosophic Crisp Sets, Neutrosophic Set Generated by (Characteristic Function), alpha-cut Level for Neutrosophic Sets, Neutrosophic Crisp Continuous Function, Neutrosophic Crisp Compact Spaces, Neutrosophic Crisp Nearly Open Sets, Neutrosophic Crisp Ideals, Neutrosophic Crisp Filter, Neutrosophic Crisp Local Functions, Neutrosophic Crisp Sets via Neutrosophic Crisp Ideals, Neutrosophic Crisp L-Openness and Neutrosophic (...) Crisp L-Continuity, Neutrosophic Topological Region, Neutrosophic Closed Set and Neutrosophic Continuous Function, etc. They compute the distances between neutrosophic sets and extend it to Neutrosophic Hesitancy Degree. The authors also generalize the Crisp Topological Space and Intuitionistic Topological Space to the notion of Neutrosophic Crisp Topological Space. At the end, they present applications to Neutrosophic Database, and show a security scheme based on Public Key Infrastructure (PKI) using Neutrosophic Logic Manipulation. The authors utilize neutrosophic sets in order to analyze social networks data conducted through learning activities, and for the Geographical Information Systems (GIS) they employ fundamental concepts and properties of a Neutrosophic Spatial Region. Keywords: Neutrosophic Crisp Points; Neutrosophic Crisp Relations; Neutrosophic Crisp Sets; Neutrosophic Crisp Continuous Function; Neutrosophic Crisp Compact Spaces; Neutrosophic Crisp Nearly Open Sets; Neutrosophic Crisp Ideals; Neutrosophic Crisp Filter; Neutrosophic Crisp Local Functions; Neutrosophic Crisp Sets via Neutrosophic Crisp Ideals; Neutrosophic Crisp L-Openness and Neutrosophic Crisp L-Continuity; Neutrosophic Topological Region; Neutrosophic Closed Set and Neutrosophic Continuous Function; Neutrosophic Hesitancy Degree; Neutrosophic Crisp Topological Space; Neutrosophic Database; Neutrosophic Logic Manipulation; Neutrosophic Spatial Region. (shrink)

In this paper, we firstly review the neutrosophic set, and then construct two new concepts called neutrosophic implication of type 1 and of type 2 for neutrosophic sets. Furthermore, some of their basic properties and some results associated with the two neutrosophic implications are proven.

The Vehicle Routing Problem (VRP) has been extensively studied by different researchers from all over the world in recent years. Multiple solutions have been proposed for different variations of the problem, such as Capacitive Vehicle Routing Problem (CVRP), Vehicle Routing Problem with Time Windows (VRP-TW), Vehicle Routing Problem with Pickup and Delivery (VRPPD), among others, all of them with deterministic times. In the last years, researchers have been interested in including in their different models the variations that travel times may (...) experience when exposed to all kind of phenomena, mainly vehicle traffic. This article addresses the VRP from this perspective, proposing the design and implementation of a genetic algorithm based on neutrosophic theory for calculating the fitness function of each route, considering the variability and uncertainty present in travel times. A deterministic genetic algorithm is also implemented with the average travel times to compare it with the neutrosophic algorithm using simulation. As conclusion, a deterministic algorithm does not necessarily generate the best solution in the real world, full of uncertainty. Also, the quantification of uncertainty using neutrosophic theory can be used in route planning, opening a broad and interesting field of research for future investigations. (shrink)

The objective of this paper is to develop neutrosophic quadruple algebraic hyperstructures. Specifically, we develop neutrosophic quadruple semihypergroups, neutrosophic quadruple canonical hypergroups and neutrosophic quadruple hyperrings and we present elementary properties which characterize them.

The Neutrosophic Precalculus and the Neutrosophic Calculus can be developed in many ways, depending on the types of indeterminacy one has and on the method used to deal with such indeterminacy. This article is innovative since the form of neutrosophic binomial factorial theorem was constructed in addition to its refrains. Two other important theorems were proven with their corollaries, and numerical examples as well. As a conjecture, we use ten (indeterminate) forms in neutrosophic calculus taking an (...) important role in limits. To serve article's aim, some important questions had been answered. (shrink)

Both neutrosophic sets theory and rough sets theory are emerging as powerful tool for managing uncertainty, indeterminate, incomplete and imprecise information .In this paper we develop an hybrid structure called “ rough neutrosophic sets” and studied their properties.

One of the disadvantages of the point estimate in survey sampling is that it fluctuates from sample to sample due to sampling error, as the estimator only provides a point value for the parameter under discussion. The neutrosophic approach, pioneered by Florentin Smarandache, is an excellent tool for estimating the parameters under consideration in sampling theory since it yields interval estimates in which the parameter lies with a very high probability. As a result, the neutrosophic technique, which is (...) a generalization of classical approach, is used to deal with ambiguous, indeterminate, and uncertain data. In this investigation, we suggest a new general family of ratio and exponential ratio type estimators for the elevated estimation of neutrosophic population mean of the primary variable utilizing known neutrosophic auxiliary parameters. For the first degree approximation, the bias and Mean Squared Error (MSE) of the suggested estimators are computed. The neutrosophic optimum values of the characterizing constants are determined, as well as the minimum value of the neutrosophic MSE of the suggested estimator is obtained for these optimum values of the characterizing scalars. Because the minimum MSE of the classical estimators of population mean lies inside the estimated interval of the neutrosophic estimators, the neutrosophic estimators are better than the equivalent classical estimators. The empirical investigation, which used both real and simulated data sets, backs up the theoretical findings. For practical utility in various areas of applications, the estimator with the lowest MSE or highest Percentage Relative Efficiency (PRE) is recommended. (shrink)

Neutrosophy has been introduced some years ago by Florentin Smarandache as a new branch of philosophy dealing with “the origin, nature and scope of neutralities, as well as their interactions with different ideational spectra”. A variety of new theories have been developed on the basic principles of neutrosophy: among them is neutrosophic logics, a family of many-valued systems that can be regarded as a generalization of fuzzy logics. In this paper we present a critical introduction to neutrosophic logics, (...) focusing on the problem of defining suitable neutrosophic propositional connectives and discussing the relationship between neutrosophic logics and other well-known frameworks for reasoning with uncertainty and vagueness, such as (intuitionistic and interval-valued) fuzzy systems and Belnap’s logic. (shrink)

In this paper we define neutrosophic bi-LAsemigroup and neutrosophic N-LA-semigroup. Infact this paper is an extension of our previous paper neutrosophic left almost semigroup shortly neutrosophic LAsemigroup. We also extend the neutrosophic ideal to neutrosophic biideal and neutrosophic N-ideal. We also find some new type of neutrosophic ideal which is related to the strong or pure part of neutrosophy. We have given sufficient amount of examples to illustrate the theory of neutrosophic (...) bi-LA-semigroup, neutrosophic N-LAsemigroup and display many properties of them this paper. (shrink)

Bipolar neutrosophic sets are the extension of neutrosophic sets and are based on the idea of positive and negative preferences of information. Projection measure is a useful apparatus for modelling real life decision making problems. In the paper, we define projection, bidirectional projection and hybrid projection measures between bipolar neutrosophic sets. Three new methods based on the proposed projection measures are developed for solving multi-attribute decision making problems. In the solution process, the ratings of performance values of (...) the alternatives with respect to the attributes are expressed in terms of bipolar neutrosophic values. We calculate projection, bidirectional projection, and hybrid projection measures between each alternative and ideal alternative with bipolar neutrosophic information. All the alternatives are ranked to identify the best alternative. Finally, a numerical example is provided to demonstrate the applicability and effectiveness of the developed methods. Comparison analysis with the existing methods in the literature in bipolar neutrosophic environment is also performed. (shrink)

Soft set theory is a general mathematical tool for dealing with uncertain, fuzzy, not clearly defined objects. In this paper we introduced soft neutrosophic loop,soft neutosophic biloop, soft neutrosophic N -loop with the discuission of some of their characteristics. We also introduced a new type of soft neutrophic loop, the so called soft strong neutrosophic loop which is of pure neutrosophic character. This notion also found in all the other corresponding notions of soft neutrosophic thoery. (...) We also given some of their properties of this newly born soft structure related to the strong part of neutrosophic theory. (shrink)

In this paper authors for the first time define a new notion called neutrosophic lattices. We define few properties related with them. Three types of neutrosophic lattices are defined and the special properties about these new class of lattices are discussed and developed. This paper is organised into three sections. First section introduces the concept of partially ordered neutrosophic set and neutrosophic lattices. Section two introduces different types of neutrosophic lattices and the final section studies (...) neutrosophic Boolean algebras. Conclusions and results are provided in section three. (shrink)

Big Data is a large-sized and complex dataset, which cannot be managed using traditional data processing tools. Mining process of big data is the ability to extract valuable information from these large datasets. Association rule mining is a type of data mining process, which is indented to determine interesting associations between items and to establish a set of association rules whose support is greater than a specific threshold. The classical association rules can only be extracted from binary data where an (...) item exists in a transaction, but it fails to deal effectively with quantitative attributes, through decreasing the quality of generated association rules due to sharp boundary problems. In order to overcome the drawbacks of classical association rule mining, we propose in this research a new neutrosophic association rule algorithm. The algorithm uses a new approach for generating association rules by dealing with membership, indeterminacy, and non-membership functions of items, conducting to an efficient decision-making system by considering all vague association rules. To prove the validity of the method, we compare the fuzzy mining and the neutrosophic mining. The results show that the proposed approach increases the number of generated association rules. (shrink)

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 neutrosophic automorphisms of a neutrosophic groups G (I) , denoted by Aut(G (I)) is a neu-trosophic group under the usual mapping composition. It is a permutation of G (I) which is also a neutrosophic homomorphism. Moreover, suppose that X1 = X(G (I)) is the neutrosophic group of inner neutrosophic auto-morphisms of a neutrosophic group G (I) and Xn the neutrosophic group of inner neutrosophic automorphisms of Xn-1. In this paper, we show (...) that if any neutrosophic group of the sequence G (I), X1, X2, … is the identity, then G (I) is nilpotent. (shrink)

Impostor syndrome or Impostor phenomenon is a belief that a person thinks their success is due to luck or external factors, not their abilities. This psychological trait is present in certain groups like women. In this paper, we propose a neutrosophic trait measure to represent the psychological concept of the trait-anti trait using refined neutrosophic sets. This study analysed a group of 200 undergraduate students for impostor syndrome, perfectionism, introversion and self-esteem: after the COVID pandemic break in 2021. (...) Data labelling was carried out using these neutrosophic trait measures. Machine learning models like Support Vector Machine(SVM), K-nearest neighbour (K-NN), and random forest were used to model the data; SVM provided the best accuracy of 92.15%. (shrink)

Since the world is full of indeterminacy, the neutrosophics found their place into contemporary research. We now introduce for the first time the notions of neutrosophic measure and neutrosophic integral. Neutrosophic Science means development and applications of neutrosophic logic/set/measure/integral/ probability etc. and their applications in any field. It is possible to define the neutrosophic measure and consequently the neutrosophic integral and neutrosophic probability in many ways, because there are various types of indeterminacies, depending (...) on the problem we need to solve. Indeterminacy is different from randomness. Indeterminacy can be caused by physical space materials and type of construction, by items involved in the space, or by other factors. Neutrosophic measure is a generalization of the classical measure for the case when the space contains some indeterminacy. Neutrosophic Integral is defined on neutrosophic measure. Simple examples of neutrosophic integrals are given. (shrink)

In this paper, the cosine similarity measure of neutrosophic refined (multi-) sets is proposed and its properties are studied. The concept of this cosine similarity measure of neutrosophic refined sets is the extension of improved cosine similarity measure of single valued neutrosophic. Finally, using this cosine similarity measure of neutrosophic refined set, the application of medical diagnosis is presented.

In this paper, we prove that Neutrosophic Statistics is more general than Interval Statistics, since it may deal with all types of indeterminacies (with respect to the data, inferential procedures, probability distributions, graphical representations, etc.), it allows the reduction of indeterminacy, and it uses the neutrosophic probability that is more general than imprecise and classical probabilities and has more detailed corresponding probability density functions. While Interval Statistics only deals with indeterminacy that can be represented by intervals. And we (...) respond to the arguments by Woodall et al. [1]. We show that not all indeterminacies (uncertainties) may be represented by intervals. Also, in some cases, we should better use hesitant sets (that have less indeterminacy) instead of intervals. We redirect the authors to the Plithogenic Probability and Plithogenic Statistics which are the most general forms of MultiVariate Probability and Multivariate Statistics respectively (including, of course, the Imprecise Probability and Interval Statistics as subclasses). (shrink)

The purpose of this paper is to introduce new types of neutrosophic crisp sets with three types 1, 2, 3. After given the fundamental definitions and operations, we obtain several properties, and discussed the relationship between neutrosophic crisp sets and others. Also, we introduce and study the neutrosophic crisp point and neutrosophic crisp relations. Possible applications to database are touched upon.

This Paper combines interval- valued neutrouphic sets and rough sets. It studies roughness in interval- valued neutrosophic sets and some of its properties. Finally we propose a Hamming distance between lower and upper approximations of interval valued neutrosophic sets.

We present in this paper the neutrosophic randomized variables, which are a generalization of the classical random variables obtained from the application of the neutrosophic logic (a new nonclassical logic which was founded by the American philosopher and mathematical Florentin Smarandache, which he introduced as a generalization of fuzzy logic especially the intuitionistic fuzzy logic ) on classical random variables. The neutrosophic random variable is changed because of the randomization, the indeterminacy and the values it takes, which (...) represent the possible results and the possible indeterminacy. Then we classify the neutrosophic randomized variables into two types of discrete and continuous neutrosophic random variables and we define the expected value and variance of the neutrosophic random variable then offer some illustrative examples. -/- . (shrink)

Neutrosophic LA-semigroup is a midway structure between a neutrosophic groupoid and a commutative neutrosophic semigroup. Rings are the old concept in algebraic structures. We combine the neutrosophic LA-semigroup and ring together to form the notion of neutrosophic LA-semigroup ring. Neutrosophic LAsemigroup ring is defined analogously to neutrosophic group ring and neutrosophic semigroup ring.

In this paper, we introduce the concept of ""neutrosophic crisp neighborhoods system for the neutrosophic crisp point ". Added to, we introduce and study the concept of neutrosophic crisp local function, and construct a new type of neutrosophic crisp topological space via neutrosophic crisp ideals. Possible application to GIS topology rules are touched upon.

This study provides an innovative approach to neutrosophic algebraic structures by introducing a new structure called Neutrosophic Soft Cubic T-ideal (NSCTID), which combines T-ideal (TID) and neutrosophic Soft Cubic Sets (NSCSs) within the framework of PS-Algebra. Within the already-existing neutrosophic cubic structures, the addition of soft sets with the characteristics of TID makes this structure more desirable. The theoretical development of the proposed structure includes the application of fundamental ideas as union, intersection, the Cartesian product, and (...) homomorphism. We also introduce the notions of NSCTID-translation and NSCTID-multiplication to further enhance the structure of NSCTID. By applying the idea of translation and multiplication, we offer improved algorithm for neutrosophic cubic sets to deal with different parameters that are satisying the TID’s distinctive characteristics. Through this thorough research, we offer an elementary understanding of NSCTID and its capabilities, providing the way to new algebraic structures. (shrink)

“Neutrosophics Knowledge” has been created for publications on advanced studies in neutrosophy, neutrosophic set, neutrosophic logic, neutrosophic probability, neutrosophic statistics that started in 1995 and their applications in any field, such as the neutrosophic structures developed in algebra, geometry, topology, etc. The submitted papers should be professional, in good English and Arabic, containing a brief review of a problem and obtained results. Neutrosophy is a new branch of philosophy that studies the origin, nature, and scope (...) of neutralities, as well as their interactions with different ideational spectra. (shrink)

In this paper, we introduce and study the concept of" neutrosophic closed set" and" neutrosophic continuous function". Possible application to GIS topology rules are touched upon.

In this paper , the authors explore neutrosophic statistics, that was initiated by Florentin Smarandache in 1998 and developed in 2014, by presenting various examples of several statistical distributions, from the work [1]. The paper is presented with more case studies, by means of which this neutrosophic version of statistical distribution becomes more pronounced.

Neutrosophic set is a new mathematical tool for handling problems involving imprecise, indetermi nacy and inconsistent data. Pseudo-BCI algebra is a kind of non-classical logic algebra in close connection with various non-commutative fuzzy logics. Recently, we applied neutrosophic set theory to pseudo-BCI al gebras. In this paper, we study neutrosophic filters in pseudo-BCI algebras. The concepts of neutrosophic regular filter, neutrosophic closed filter and fuzzy regular filter in pseudo-BCI algebras are introduced, and some basic properties (...) are discussed. Moreover, the relationships among neutrosophic regular filter, fuzzy filters and anti-grouped neutrosophic filters are prese nted, and the results are proved: a neutrosophic filter (fuzzy filter) is a neutrosophic regular filter (fuzzy regular filter), if and only if it is both a neutrosophic closed filter (fuzzy closed filter) and an anti-grouped neutrosophic filter (fuzzy anti-grouped filter). (shrink)

Soft neutrosophic group and soft neutrosophic subgroup are generalized to soft neutrosophic bigroup and soft neutrosophic N-group respectively in this paper. Different kinds of soft neutrosophic bigroup and soft neutrosophic N-group are given. The structural properties and theorems have been discussed with a lot of examples to disclose many aspects of this beautiful man made structure.

Neutrosophic Over-/Under-/Off-Set and -Logic were defined for the first time by Smarandache in 1995 and published in 2007. They are totally different from other sets/logics/probabilities. He extended the neutrosophic set respectively to Neutrosophic Overset {when some neutrosophic component is > 1}, Neutrosophic Underset {when some neutrosophic component is < 0}, and to Neutrosophic Offset {when some neutrosophic components are off the interval [0, 1], i.e. some neutrosophic component > 1 and other (...) neutrosophic component < 0}. This is no surprise with respect to the classical fuzzy set/logic, intuitionistic fuzzy set/logic, or classical/imprecise probability, where the values are not allowed outside the interval [0, 1], since our real-world has numerous examples and applications of over-/under-/off-neutrosophic components. (shrink)

This paper is devoted to present Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) method for multi-attribute group decision making under rough neutrosophic environment. The concept of rough neutrosophic set is a powerful mathematical tool to deal with uncertainty, indeterminacy and inconsistency. In this paper, a new approach for multi-attribute group decision making problems is proposed by extending the TOPSIS method under rough neutrosophic environment. Rough neutrosophic set is characterized by the upper and lower (...) approximation operators and the pair of neutrosophic sets that are characterized by truth-membership degree, indeterminacy membership degree, and falsity membership degree. In the decision situation, ratings of alternatives with respect to each attribute are characterized by rough neutrosophic sets that reflect the decision makers’ opinion. Rough neutrosophic weighted averaging operator has been used to aggregate the individual decision maker’s opinion into group opinion for rating the importance of attributes and alternatives. Finally, a numerical example has been provided to demonstrate the applicability and effectiveness of the proposed approach. (shrink)

Neutrosophic theory has many applications in graph theory, bipolar single valued neutrosophic graphs (BSVNGs) is the generalization of fuzzy graphs and intuitionistic fuzzy graphs, SVNGs. In this paper we introduce some types of BSVNGs, such as subdivision BSVNGs, middle BSVNGs, total BSVNGs and bipolar single valued neutrosophic line graphs (BSVNLGs), also investigate the isomorphism, co weak isomorphism and weak isomorphism properties of subdivision BSVNGs, middle BSVNGs, total BSVNGs and BSVNLGs.

We introduce now for the first time the neutrosophic modal logic. The Neutrosophic Modal Logic includes the neutrosophic operators that express the modalities. It is an extension of neutrosophic predicate logic and of neutrosophic propositional logic.