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)

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)

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)

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)

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)

Graph theory is a specific concept that has numerous applications throughout many industries. Despite the advancement of this technique, graph theory can still yield ambiguous and imprecise results. In order to cut down on these indeterminate factors, neutrosophic logic has emerged as an applicable solution that is gaining significant attention in solving many real-life decision-making problems that involve uncertainty, impreciseness, vagueness, incompleteness, inconsistency, and indeterminacy. However, empirical research on this specific graph set is lacking. Neutrosophic Graph Theory and (...) Algorithms is a collection of innovative research on the methods and applications of neutrosophic sets and logic within various fields including systems analysis, economics, and transportation. While highlighting topics including linear programming, decision-making methods, and homomorphism, this book is ideally designed for programmers, researchers, data scientists, mathematicians, designers, educators, researchers, academicians, and students seeking current research on the various methods and applications of graph theory. (shrink)

It is well known that the unpredictable speech production brought on by stress from the task at hand has a significant negative impact on the performance of speech processing algorithms. Speech therapy benefits from being able to detect stress in speech. Speech processing performance suffers noticeably when perceptually produced stress causes variations in speech production. Using the acoustic speech signal to objectively characterize speaker stress is one method for assessing production variances brought on by stress. Real-world complexity and ambiguity make (...) it difficult for decision-makers to express their conclusions with clarity in their speech. In particular, the Neutrosophic speech algorithm is used to encode the language variables because they cannot be computed directly. Neutrosophic sets are used to manage indeterminacy in a practical situation. Existing algorithms are used except for stress on Neutrosophic speech recognition. The creation of algorithms that calculate, categorize, or differentiate between different stress circumstances. Understanding stress and developing strategies to combat its effects on speech recognition and human-computer interaction system are the goals of this recognition. (shrink)

Misinformation and biased information significantly impact public perception and political decisions, especially on critical issues such as climate change and environmental conservation. This study aims to understand how indeterminacy and contradiction influence public perception and policy formulation by applying neutrosophic theory to model the complexity and multi-dimensionality of ignorance. Using neutrosophic Likert scales, we capture a nuanced spectrum of opinions on the scientific certainty of human impact on climate change. The results are analyzed through a k-means clustering (...) class='Hi'>algorithm to identify patterns and segment participants into groups based on their levels of truth, indeterminacy, and falsehood. This approach reveals deeper insights into public perceptions and aids in evaluating their implications for effective communication and policy-making. (shrink)

In this book, we present a study of linear models and algorithms to find the optimal solution for them using the concepts of neuroscientific science. We know that the linear programming method is one of the important methods of operations research, the science that was the product of the great scientific development that our contemporary world is witnessing. The name operations research is given to the group of scientific methods used. In analyzing problems and searching for optimal solutions, it is (...) a science whose applications have achieved widespread success in various fields of life. What is meant by neutrosophic models are models in which the data are neutrosophic values, that is, variables such as in the objective function, which expresses profit if the model is a maximization model, and expresses a cost if the model is a minimization model, which in turn is affected by environmental conditions. (shrink)

In this paper, we propose a new concept named the uniform single valued neutrosophic graph. An illustrative example and some properties are examined. Next, we develop an algorithmic approach for computing the complement of the single valued neutrosophic graph. A numerical example is demonstrated for computing the complement of single valued neutrosophic graphs and uniform single valued neutrosophic graph.

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)

Neutrosophic theory and its applications have been expanding in all directions at an astonishing rate especially after of the introduction the journal entitled “Neutrosophic Sets and Systems”. New theories, techniques, algorithms have been rapidly developed. One of the most striking trends in the neutrosophic theory is the hybridization of neutrosophic set with other potential sets such as rough set, bipolar set, soft set, hesitant fuzzy set, etc. The different hybrid structures such as rough neutrosophic set, (...) single valued neutrosophic rough set, bipolar neutrosophic set, single valued neutrosophic hesitant fuzzy set, etc. are proposed in the literature in a short period of time. Neutrosophic set has been an important tool in the application of various areas such as data mining, decision making, e-learning, engineering, medicine, social science, and some more. (shrink)

In this paper, we first defined soft intervalvalued neutrosophic rough sets(SIVN- rough sets for short) which combines interval valued neutrosophic soft set and rough sets and studied some of its basic properties. This concept is an extension of soft interval valued intuitionistic fuzzy rough sets( SIVIF- rough sets). Finally an illustartive example is given to verfy the developped algorithm and to demonstrate its practicality and effectiveness.

The second volume of “Advancing Uncertain Combinatorics through Graphization, Hyperization, and Uncertainization: Fuzzy, Neutrosophic, Soft, Rough, and Beyond” presents a deep exploration of the progress in uncertain combinatorics through innovative methodologies like graphization, hyperization, and uncertainization. This volume integrates foundational concepts from fuzzy, neutrosophic, soft, and rough set theory, among others, to further advance the field. Combinatorics and set theory, two central pillars of mathematics, focus on counting, arrangement, and the study of collections under defined rules. Combinatorics excels (...) in handling uncertainty, while set theory has evolved with concepts such as fuzzy and neutrosophic sets, which enable the modeling of complex real-world uncertainties by addressing truth, indeterminacy, and falsehood. These advancements, when combined with graph theory, give rise to novel forms of uncertain sets in "graphized" structures, including hypergraphs and superhypergraphs. Innovations such as Neutrosophic Oversets, Undersets, and Offsets, as well as the Nonstandard Real Set, build upon traditional graph concepts, pushing both theoretical and practical boundaries. The synthesis of combinatorics, set theory, and graph theory in this volume provides a robust framework for addressing the complexities and uncertainties inherent in both mathematical and real-world systems, paving the way for future research and application. In the first chapter, “A Review of the Hierarchy of Plithogenic, Neutrosophic, and Fuzzy Graphs: Survey and Applications”, the authors investigate the interrelationships among various graph classes, including Plithogenic graphs, and explore other related structures. Graph theory, a fundamental branch of mathematics, focuses on networks of nodes and edges, studying their paths, structures, and properties. A Fuzzy Graph extends this concept by assigning a membership degree between 0 and 1 to each edge and vertex, representing the level of uncertainty. The Turiyam Neutrosophic Graph is introduced as an extension of both Neutrosophic and Fuzzy Graphs, while Plithogenic graphs offer a potent method for managing uncertainty. The second chapter, “Review of Some Superhypergraph Classes: Directed, Bidirected, Soft, and Rough”, examines advanced graph structures such as directed superhypergraphs, bidirected hypergraphs, soft superhypergraphs, and rough superhypergraphs. Classical graph classes include undirected graphs, where edges lack orientation, and directed graphs, where edges have specific directions. Recent innovations, including bidirected graphs, have sparked ongoing research and significant advancements in the field. Soft Sets and their extension to Soft Graphs provide a flexible framework for managing uncertainty, while Rough Sets and Rough Graphs address uncertainty by using lower and upper approximations to handle imprecise data. Hypergraphs generalize traditional graphs by allowing edges, or hyperedges, to connect more than two vertices. Superhypergraphs further extend this by allowing both vertices and edges to represent subsets, facilitating the modeling of hierarchical and group-based relationships. The third chapter, “Survey of Intersection Graphs, Fuzzy Graphs, and Neutrosophic Graphs”, explores the intersection graph models within the realms of Fuzzy Graphs, Intuitionistic Fuzzy Graphs, Neutrosophic Graphs, Turiyam Neutrosophic Graphs, and Plithogenic Graphs. The chapter highlights their mathematical properties and interrelationships, reflecting the growing number of graph classes being developed in these areas. Intersection graphs, such as Unit Square Graphs, Circle Graphs, and Ray Intersection Graphs, are crucial for understanding complex graph structures in uncertain environments. The fourth chapter, “Fundamental Computational Problems and Algorithms for SuperHyperGraphs”, addresses optimization problems within the SuperHypergraph framework, such as the SuperHypergraph Partition Problem, Reachability, and Minimum Spanning SuperHypertree. The chapter also adapts classical problems like the Traveling Salesman Problem and the Chinese Postman Problem to the SuperHypergraph context, exploring how hypergraphs, which allow hyperedges to connect more than two vertices, can be used to solve complex hierarchical and relational problems. The fifth chapter, “A Short Note on the Basic Graph Construction Algorithm for Plithogenic Graphs”, delves into algorithms designed for Plithogenic Graphs and Intuitionistic Plithogenic Graphs, analyzing their complexity and validity. Plithogenic Graphs model multi-valued attributes by incorporating membership and contradiction functions, offering a nuanced representation of complex relationships. The sixth chapter, “Short Note of Bunch Graph in Fuzzy, Neutrosophic, and Plithogenic Graphs”, generalizes traditional graph theory by representing nodes as groups (bunches) rather than individual entities. This approach enables the modeling of both competition and collaboration within a network. The chapter explores various uncertain models of bunch graphs, including Fuzzy Graphs, Neutrosophic Graphs, Turiyam Neutrosophic Graphs, and Plithogenic Graphs. In the seventh chapter, “A Reconsideration of Advanced Concepts in Neutrosophic Graphs: Smart, Zero Divisor, Layered, Weak, Semi, and Chemical Graphs”, the authors extend several fuzzy graph classes to Neutrosophic graphs and analyze their properties. Neutrosophic Graphs, a generalization of fuzzy graphs, incorporate degrees of truth, indeterminacy, and falsity to model uncertainty more effectively. The eighth chapter, “Short Note of Even-Hole-Graph for Uncertain Graph”, focuses on Even-Hole-Free and Meyniel Graphs analyzed within the frameworks of Fuzzy, Neutrosophic, Turiyam Neutrosophic, and Plithogenic Graphs. The study investigates the structure of these graphs, with an emphasis on their implications for uncertainty modeling. The ninth chapter, “Survey of Planar and Outerplanar Graphs in Fuzzy and Neutrosophic Graphs”, explores planar and outerplanar graphs, as well as apex graphs, within the contexts of fuzzy, neutrosophic, Turiyam Neutrosophic, and plithogenic graphs. The chapter examines how these types of graphs are used to model uncertain parameters and relationships in mathematical and real-world systems. The tenth chapter, “General Plithogenic Soft Rough Graphs and Some Related Graph Classes”, introduces and explores new concepts such as Turiyam Neutrosophic Soft Graphs and General Plithogenic Soft Graphs. The chapter also examines models of uncertain graphs, including Fuzzy, Intuitionistic Fuzzy, Neutrosophic, and Plithogenic Graphs, all designed to handle uncertainty in diverse contexts. The eleventh chapter, “Survey of Trees, Forests, and Paths in Fuzzy and Neutrosophic Graphs”, provides a comprehensive study of Trees, Forests, and Paths within the framework of Fuzzy and Neutrosophic Graphs. This chapter focuses on classifying and analyzing graph structures like trees and paths in uncertain environments, contributing to the ongoing development of graph theory in the context of uncertainty. (shrink)

Clustering plays an important role in data mining, pattern recognition, and machine learning. Then, single-valued neutrosophic sets are a useful means to describe and handle indeterminate and inconsistent information, which fuzzy sets and intuitionistic fuzzy sets cannot describe and deal with. To cluster the data represented by single-value neutrosophic information, the article proposes a single-valued neutrosophic minimum spanning tree clustering algorithm. Firstly, we defined a generalized distance measure between SVNSs. Then, we present an SVNMST clustering (...) class='Hi'>algorithm for clustering single-value neutrosophic data based on the generalized distance measure of SVNSs. Finally, two illustrative examples are given to demonstrate the application and effectiveness of the developed approach. (shrink)

Neutrosophic theory and its applications have been expanding in all directions at an astonishing rate especially after of the introduction the journal entitled “Neutrosophic Sets and Systems”. New theories, techniques, algorithms have been rapidly developed. One of the most striking trends in the neutrosophic theory is the hybridization of neutrosophic set with other potential sets such as rough set, bipolar set, soft set, hesitant fuzzy set, etc. The different hybrid structures such as rough neutrosophic set, (...) single valued neutrosophic rough set, bipolar neutrosophic set, single valued neutrosophic hesitant fuzzy set, etc. are proposed in the literature in a short period of time. Neutrosophic set has been an important tool in the application of various areas such as data mining, decision making, e-learning, engineering, law, medicine, social science, and some more. -/- This book explores the emerging field of Neutrosophic Algebraic Structures, focusing on both their theoretical foundations and practical applications. We apply innovative algorithmic methods to investigate the complex interactions of neutrosophic elements, such as neutrosophic numbers, sets, and functions, within algebraic systems. Our goal is to show how neutrosophic structures challenge and expand traditional algebraic approaches, offering solutions to problems across diverse fields like computer science, engineering, artificial intelligence, and decision-making. (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 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)

Clustering plays an important role in data mining, pattern recognition, and machine learning. Single-valued neutrosophic sets are useful means to describe and handle indeterminate and inconsistent information that fuzzy sets and intuitionistic fuzzy sets cannot describe and deal with. To cluster the data represented by single-valued neutrosophic information, this article proposes single-valued neutrosophic clustering methods based on similarity measures between SVNSs. First, we define a generalized distance measure between SVNSs and propose two distance-based similarity measures of SVNSs. (...) Then, we present a clustering algorithm based on the similarity measures of SVNSs to cluster single-valued neutrosophic data. Finally, an illustrative example is given to demonstrate the application and effectiveness of the developed clustering methods. (shrink)

The field of neutrosophic set theory and its applications has been rapidly expanding, particularly since the introduction of the journal "Neutrosophic Sets and Systems." New theories, techniques, and algorithms are being developed at a very high rate. One of the most notable trends in neutrosophic theory is its hybridization with other set theories such as rough set theory, bipolar set theory, soft set theory, hesitant fuzzy set theory, and more. Various hybrid structures like rough neutrosophic sets, (...) neutrosophic soft set, single valued neutrosophic hesitant fuzzy sets, among others, have been proposed in a short period. Neutrosophic sets have proven to be crucial tools across a wide array of fields including data mining, decision making, e-learning, engineering, medical diagnosis, social sciences, and beyond. -/- The third volume in the series “New Trends in Neutrosophic Theories and Applications” focuses on theories, methods, and algorithms for decision making, as well as applications involving neutrosophic information. Some topics introduce new sets such as the Pythagorean neutrosophic vague soft set, the triangular fuzzy penta-partitioned neutrosophic set, interval-valued neutrosophic b-open sets, and interval-valued neutrosophic b-closed sets. Other topics present applications in medical diagnosis, non-preemptive neutrosophic priority queues with uneven services (labeled as NM/NM/1), AHP in an interval neutrosophic set environment, MAGDM in a triangular fuzzy neutrosophic number environment, MAGDM in a pentapartitioned neutrosophic environment, the entropy-ARAS strategy in a single-valued neutrosophic number environment, and the MABAC strategy in a rough neutrosophic set environment. (shrink)

The topics approached in this collection of papers are: neutrosophic sets; neutrosophic logic; generalized neutrosophic set; neutrosophic rough set; multigranulation neutrosophic rough set (MNRS); neutrosophic cubic sets; triangular fuzzy neutrosophic sets (TFNSs); probabilistic single-valued (interval) neutrosophic hesitant fuzzy set; neutro-homomorphism; neutrosophic computation; quantum computation; neutrosophic association rule; data mining; big data; oracle Turing machines; recursive enumerability; oracle computation; interval number; dependent degree; possibility degree; power aggregation operators; multi-criteria group decision-making (MCGDM); (...) expert set; soft sets; LA-semihypergroups; single valued trapezoidal neutrosophic number; inclusion relation; Q-linguistic neutrosophic variable set; vector similarity measure; fundamental neutro-homomorphism theorem; neutro-isomorphism theorem; quasi neutrosophic triplet loop; quasi neutrosophic triplet group; BE-algebra; cloud model; fuzzy measure; clustering algorithm; and many more. (shrink)

The topics approached in the 52 papers included in this book are: neutrosophic sets; neutrosophic logic; generalized neutrosophic set; neutrosophic rough set; multigranulation neutrosophic rough set (MNRS); neutrosophic cubic sets; triangular fuzzy neutrosophic sets (TFNSs); probabilistic single-valued (interval) neutrosophic hesitant fuzzy set; neutro-homomorphism; neutrosophic computation; quantum computation; neutrosophic association rule; data mining; big data; oracle Turing machines; recursive enumerability; oracle computation; interval number; dependent degree; possibility degree; power aggregation operators; multi-criteria (...) group decision-making (MCGDM); expert set; soft sets; LA-semihypergroups; single valued trapezoidal neutrosophic number; inclusion relation; Q-linguistic neutrosophic variable set; vector similarity measure; fundamental neutro-homomorphism theorem; neutro-isomorphism theorem; quasi neutrosophic triplet loop; quasi neutrosophic triplet group; BE-algebra; cloud model; Maclaurin symmetric mean; pseudo-BCI algebra; hesitant fuzzy set; photovoltaic plan; decision-making trial and evaluation laboratory (DEMATEL); Choquet integral; fuzzy measure; clustering algorithm; and many more. (shrink)

The third volume of “Advancing Uncertain Combinatorics through Graphization, Hyperization, and Uncertainization: Fuzzy, Neutrosophic, Soft, Rough, and Beyond” presents an in-depth exploration of the cutting-edge developments in uncertain combinatorics and set theory. This comprehensive collection highlights innovative methodologies such as graphization, hyperization, and uncertainization, which enhance combinatorics by incorporating foundational concepts from fuzzy, neutrosophic, soft, and rough set theories. These advancements open new mathematical horizons, offering novel approaches to managing uncertainty within complex systems. Combinatorics, a discipline focused on (...) counting, arrangement, and structure, often faces challenges when uncertainty is present. Set theory, which underpins combinatorial problems, has evolved to tackle these challenges. The introduction of fuzzy and neutrosophic sets has expanded the toolkit for modeling uncertainty by incorporating elements of truth, indeterminacy, and falsehood into decision-making processes. These innovations seamlessly intersect with graph theory, providing new ways to represent uncertain structures through "graphized" forms such as hypergraphs and superhypergraphs. This volume also introduces advanced concepts like Neutrosophic Oversets, Undersets, and Offsets, which push the boundaries of classical graph theory and offer deeper insights into the mathematical and practical challenges posed by real-world systems. By blending combinatorics, set theory, and graph theory, the authors have created a robust framework for addressing uncertainty in both mathematical systems and their real-world applications. This foundation sets the stage for future breakthroughs in combinatorics, set theory, and related fields. Each chapter in this volume contributes both theoretical foundations and practical applications, demonstrating the power of integrating graph theory, set theory, and uncertainty models. The new ideas, algorithms, and mathematical tools presented here will drive the future of combinatorial research and its applications in uncertain environments. In the first chapter, “Introduction to Upside-Down Logic: Its Deep Relation to Neutrosophic Logic and Applications”, the authors present Upside-Down Logic, a novel logical framework that systematically transforms truths into falsehoods and vice versa, based on contextual shifts. Introduced by F. Smarandache, this paper provides a mathematical definition of Upside-Down Logic, including applications related to the Japanese language. The chapter also introduces Contextual Upside-Down Logic, an extension that adjusts logical connectives alongside flipped truth values, as well as Indeterm-Upside-Down Logic and Certain Upside-Down Logic to address indeterminacy. A simple algorithm is also proposed to demonstrate the computational aspects of this logic. In the second chapter, “Local-Neutrosophic Logic and Local-Neutrosophic Sets: Incorporating Locality with Applications”, the authors introduce Local-Neutrosophic Logic and Local-Neutrosophic Sets, which integrate the concept of locality into Neutrosophic Logic. By defining locality as the influence of immediate surroundings on an object or system, this chapter explores how it affects indeterminacy in real-world problems. The paper also examines potential applications and provides mathematical definitions for these new concepts. The third chapter, “A Review of Fuzzy and Neutrosophic Offsets: Connections to Some Set Concepts and Normalization Function”, extends the concept of offsets in uncertain set-theoretic frameworks, such as Fuzzy Sets, Neutrosophic Sets, and Plithogenic Sets. This chapter introduces several advanced types of offsets, including Nonstationary Fuzzy Offset, Multi-valued Plithogenic Offset, and Subset-valued Neutrosophic Offset, offering deeper insights into handling uncertainty in mathematical models. In the fourth chapter, “Review of Plithogenic Directed, Mixed, Bidirected, and Pangene OffGraph”, the authors build upon Plithogenic Graphs to propose extensions such as Plithogenic Directed OffGraph, Plithogenic BiDirected OffGraph, and Plithogenic Mixed OffGraph. These new concepts, including the Plithogenic Pangene OffGraph, are explored in detail, with a focus on their mathematical properties and potential applications in uncertain graph theory. The fifth chapter, “Short Note on Neutrosophic Closure Matroids”, explores the extension of matroid concepts into Neutrosophic and Turiyam Neutrosophic set theories, introducing Neutrosophic closure matroids. This concept integrates uncertainty, indeterminacy, and liberal states into matroid theory, enhancing its applicability in optimization and combinatorial problems. In the sixth chapter, “Some Graph Parameters for Superhypertree-width and Neutrosophic Tree-width”, the authors discuss graph parameters such as Superhypertree-width and Neutrosophic tree-width. These parameters play a crucial role in the study of graph characteristics, particularly in algorithms and real-world applications. The chapter explores the generalization of hypergraphs to SuperHyperGraphs and examines how these concepts extend tree-width parameters within the context of Neutrosophic logic. (shrink)

Polyhedral functions provide a model for an important class of problems that includes both linear programming and applications in data analysis. General methods for minimizing such functions using the polyhedral geometry explicitly are developed. Such methods approach a minimum by moving from extreme point to extreme point along descending edges and are described generically as simplicial. The best-known member of this class is the simplex method of linear programming, but simplicial methods have found important applications in discrete approximation and (...) statistics. The general approach considered in this text, first published in 2001, has permitted the development of finite algorithms for the rank regression problem. The key ideas are those of developing a general format for specifying the polyhedral function and the application of this to derive multiplier conditions to characterize optimality. Also considered is the application of the general approach to the development of active set algorithms for polyhedral function constrained problems and associated Lagrangian forms. (shrink)

Neutrosophic theory and its applications have been expanding in all directions at an astonishing rate especially after of the introduction the journal entitled “Neutrosophic Sets and Systems”. New theories, techniques, algorithms have been rapidly developed. One of the most striking trends in the neutrosophic theory is the hybridization of neutrosophic set with other potential sets such as rough set, bipolar set, soft set, hesitant fuzzy set, etc. The different hybrid structures such as rough neutrosophic set, (...) single valued neutrosophic rough set, bipolar neutrosophic set, single valued neutrosophic hesitant fuzzy set, etc. are proposed in the literature in a short period of time. Neutrosophic set has been an important tool in the application of various areas such as data mining, decision making, e-learning, engineering, medicine, social science, and some more. (shrink)

In this paper, a special type of polysemantic words, that is, words with multiple meanings for the same part of speech, are analyzed under the name of neutrosophic words. These words represent the most dif cult cases for the disambiguation algorithms as they represent the most ambiguous natural language utterances. For approximate their meanings, we developed a semantic representation framework made by means of concepts from neutrosophic theory and entropy measure in which we incorporate sense related data. We (...) show the advantages of the proposed framework in a sentiment classification task. (shrink)

In this paper, we perform theoretical analysis and experiments on the Simplex Crossover (SPX), which we have proposed. Real-coded GAs are expected to be a powerful function optimization technique for real-world applications where it is often hard to formulate the objective function. However, we believe there are two problems which will make such applications difficult; 1) performance of real-coded GAs depends on the coordinate system used to express the objective function, and 2) it costs much labor to adjust parameters (...) so that the GAs always find an optimum point efficiently. The result of our theoretical analysis and experiments shows that a performance of SPX is independent of linear coordinate transformation and that SPX always optimizes various test function efficiently when theoretical value for expansion rate, which is a parameter of SPX, is applied. We also show that BLX-α is equivalent to degenerate form of SPX. Experiments show that we have something misunderstood effect of epistasis on performance degradation of real-coded GAs. (shrink)

We study active set methods for optimization problems in Block Angular Form (BAF). We begin by reviewing some standard basis factorizations, including Saunders' orthogonal factorization and updates for the simplex method that do not impose any restriction on the pivot sequence and maintain the basis factorization structured in BAF throughout the algorithm. We then suggest orthogonal factorization and updating procedures that allow coarse grain parallelization, pivot updates local to the affected blocks, and independent block reinversion. A simple parallel (...) environment appropriate to the description and complexity analysis of test procedures is defined in Section 5. The factorization and updating procedures are presented in Sections 6 and 7. Our update procedure outperforms conventional Updating procedures even in a purely sequential environment. (shrink)

Young people’s skills and attitudes must be observed, studied and evaluated in order to create appropriate models that would serve an educational purpose. In this paper, we propose a decision-making model with the aim to detect certain attitudinal and behavioral patterns of actively engaged young people. The data used in this research resulted from a questionnaire drawn up by a group of researchers from six European countries with the aim to investigate the youth’s awareness about the Sustainable Development Goals and (...) their engagement as active agents of development and change at regional level. For the purpose of this study, we selected the regional results obtained from administering this questionnaire in Dolj County (Romania) and La Rioja (Spain). We developed a neutrosophic model that determines the Mindchanger profile of the respondents based on a minimal set of questions, which is dependent on the inclusion or exclusion of the nationality-specific traits. The resulting decisions were then compared with the respondents’ self-evaluations, yielding high precisions (more than 0.83) for all the investigated evaluation scenarios. Our results were significantly better than the ones provided by several machine learning models applied on the same set of data. A direct impact of our model is that it can be applied to questionnaires which include linguistic responses that express, among others, unclear or vague thoughts. Additionally, it offers the possibility to identify the minimal set of questions that impact the respondent’s answer choice to a target question. (shrink)

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)

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.

In this paper we introduce the notion of ideals on neutrosophic set which is considered as a generalization of fuzzy and fuzzy intuitionistic ideals studies in [9,11] , the important topological neutrosophic ideals has been given in [4]. The concept of neutrosophic local function is also introduced for a neutrosophic topological space. These concepts are discussed with a view to fiind new neutrosophic topology from the original one in [8]. The basic structure, especially a basis (...) for such generated neutrosophic topologies and several relations between different topological neutrosophic ideals and neutrosophic topologies are also studied here. Possible application to GIS topology rules are touched upon. -/- . (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.

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)

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.

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.

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)

In this article, we apply the notion of interval neutrosophic sets to ideal theory in BCK/BCI-algebras.

Today, soft computing is a field that is used a lot in solving real-world problems, such as problems in economics, finance, banking... With the aim to serve for solving the real problem, many new theories and/or tools which were proposed, improved to help soft computing used more efficiently. We can mention some theories as fuzzy sets theory (L. Zadeh, 1965), intuitionistic fuzzy set (K Atanasov, 1986), neutrosophic set (F. Smarandache 1999). In this paper, we introduce a new notion of (...) sup port-neutrosophic set (SNS), which is the combination a neutrosophic set with a fuzzy set. So, SNS set is a direct extension of fuzzy set and neutrosophic sets (F. Smarandache). Then, we define some operators on the support-neutrosophic sets, and investigate some properties of these operators. (shrink)

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)

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.

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.

In this paper, we presented antoher concept of neutrosophic open sets called neutrosophic semi-α-open sets and studied their fundamental poperties in neutrosophic topological spaces. We also present neutrospohic semi-α-interior and neutrosophic semi-α-closure and study some of their fundamental properties.

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)

Studies to neutrosophic graphs happens to be not only innovative and interesting, but gives a new dimension to graph theory. The classic coloring of edge problem happens to give various results. Neutrosophic tree will certainly find lots of applications in data mining when certain levels of indeterminacy is involved in the problem. Several open problems are suggested.

In this article, we first provide a modified definition of SuperHyperGraphs (SHG) and we call it Restricted SuperHyperGraphs (R-SHG). We then generalize the R-SHG to the neutrosophic graphs and then define the corresponding trees. In the following, we examine the Helly property for subtrees of SuperHyperGraphs.

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.

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.

In this paper we have defined neutrosophic ideals, neutrosophic interior ideals, netrosophic quasi-ideals and neutrosophic bi-ideals (neutrosophic generalized bi-ideals) and proved some results related to them. Furthermore, we have done some characterization of a neutrosophic LA-semigroup by the properties of its neutrosophic ideals. It has been proved that in a neutrosophic intra-regular LA-semigroup neutrosophic left, right, two-sided, interior, bi-ideal, generalized bi-ideal and quasi-ideals coincide and we have also proved that the set of (...) neutrosophic ideals of a neutrosophic intra-regular LA-semigroup forms a semilattice structure. (shrink)