129 research outputs found

    Interval Valued Neutrosophic Shortest Path Problem by A* Algorithm

    Get PDF
    Many researchers have been proposing various algorithms to unravel different types of fuzzy shortest path problems. There are many algorithms like Dijkstra’s, Bellman-Ford,Floyd-Warshall and kruskal’s etc are existing for solving the shortest path problems. In this work a shortest path problem with interval valued neutrosophic numbers is investigated using the proposed algorithm. A* algorithm is extensively applied in pathfinding and graph traversal.Unlike the other algorithms mentioned above, A* algorithm entails heuristic function to uncover the cost of path that traverses through the particular state. In the structured work A* algorithm is applied to unravel the length of the shortest path by utilizing ranking function from the source node to the destination node. A* algorithm is executed by applying best first search with the help of this search, it greedily decides which vertex to investigate subsequently. A* is equally complete and optimal if an acceptable heuristic is concerned. The arc lengths in interval valued neutrosophic numbers are defuzzified using the score function.. A numerical example is used to illustrate the proposed approach

    Neutrosophic Shortest Path Problem (NSPP) in a Directed Multigraph

    Get PDF

    The Encyclopedia of Neutrosophic Researchers - vol. 3

    Get PDF
    This is the third volume of the Encyclopedia of Neutrosophic Researchers, edited from materials offered by the authors who responded to the editor’s invitation. The authors are listed alphabetically. The introduction contains a short history of neutrosophics, together with links to the main papers and books. Neutrosophic set, neutrosophic logic, neutrosophic probability, neutrosophic statistics, neutrosophic measure, neutrosophic precalculus, neutrosophic calculus and so on are gaining significant attention in solving many real life problems that involve uncertainty, impreciseness, vagueness, incompleteness, inconsistent, and indeterminacy. In the past years the fields of neutrosophics have been extended and applied in various fields, such as: artificial intelligence, data mining, soft computing, decision making in incomplete / indeterminate / inconsistent information systems, image processing, computational modelling, robotics, medical diagnosis, biomedical engineering, investment problems, economic forecasting, social science, humanistic and practical achievements

    Intelligent algorithm for trapezoidal interval valued neutrosophic network analysis

    Get PDF
    The shortest path problem has been one of the most fundamental practical problems in network analysis. One of the good algorithms is Bellman-Ford, which has been applied in network, for the last some years. Due to complexity in the decision-making process, the decision makers face complications to express their view and judgment with an exact number for single valued membership degrees under neutrosophic environment. Though the interval number is a special situation of the neutrosophic, it did not solve the shortest path problems in an absolute manner. Hence, in this work, the authors have introduced the score function and accuracy function of trapezoidal interval valued neutrosophic numbers with their illustrative properties. These properties provide important theoretical base of the trapezoidal interval valued neutrosophic number. Also, they proposed an intelligent algorithm called trapezoidal interval valued neutrosophic version of Bellman’s algorithm to solve neutrosophic shortest path problem in network analysis. Further, comparative analysis has been made with the existing algorithm

    SHORTEST PATH PROBLEM UNDER TRIANGULAR FUZZY NEUTROSOPHIC INFORMATION

    Get PDF
    In this paper, we develop a new approach to deal with neutrosphic shortest path problem in a network in which each edge weight (or length) is represented as triangular fuzzy neutrosophic number. The proposed algorithm also gives the shortest path length from source node to destination node using ranking function. Finally, an illustrative example is also included to demonstrate our proposed approach

    Novel System and Method For Telephone Network Planing Based on Neutrosophic Graph

    Get PDF
    Telephony is gaining momentum in the daily lives of individuals and in the activities of all companies. With the great trend towards telephony networks, whether analogue or digital known as Voice over IP (VoIP), the number of calls an individual can receive becomes considerably high. However, effective management of incoming calls to subscribers becomes a necessity. Recently, much attention has been paid towards applications of single-valued neutrosophic graphs in various research fields. One of the suitable reason is it provides a generalized representation of fuzzy graphs (FGs) for dealing with human nature more effectively when compared to existing models i.e. intuitionistic fuzzy graphs (IFGs), inter-valued fuzzy graphs (IVFGs) and bipolar-valued fuzzy graphs (BPVFGs) etc. In this paper we focused on precise analysis of useful information extracted by calls received, not received due to some reasons using the properties of SVNGs. Hence the proposed method introduced one of the first kind of mathematical model for precise analysis of instantaneous traffic beyond the Erlang unit. To achieve this goal an algorithm is proposed for a neutrosophic mobile network model (NMNM) based on a hypothetical data set. In addition, the drawback and further improvement of proposed method with a mathematical proposition is established for it precise applications

    Shortest path problem using Bellman algorithm under neutrosophic environment

    Get PDF
    An elongation of the single-valued neutrosophic set is an interval-valued neutrosophic set. It has been demonstrated to deal indeterminacy in a decision-making problem. Real-world problems have some kind of uncertainty in nature and among them; one of the influential problems is solving the shortest path problem (SPP) in interconnections

    Spanning Tree Problem with Neutrosophic Edge Weights

    Get PDF
    Neutrosophic set and neutrosophic logic theory are renowned theories to deal with complex, not clearly explained and uncertain real life problems, in which classical fuzzy sets/models may fail to model properly. This paper introduces an algorithm for finding minimum spanning tree (MST) of an undirected neutrosophic weighted connected graph (abbr. UNWCG) where the arc/edge lengths are represented by a single valued neutrosophic numbers. To build the MST of UNWCG, a new algorithm based on matrix approach has been introduced. The proposed algorithm is compared to other existing methods and finally a numerical example is provided

    An approximation of balanced score in neutrosophic graphs with weak edge weights

    Get PDF
    Neutrosophic concept is known undirected graph theory to involve with complex logistic networks, not clearly given and unpredictable real life situations, where fuzzy logic malfunctions to model. The transportation objective is to ship all logistic nodes in the network. The logistic network mostly experiences in stable condition, but for some edges found to be volatile. The weight of these erratic edges may vary at random (bridge-lifting/bascule, ad hoc accident on road, traffic condition) In this article, we propose an approximation algorithm for solving minimum spanning tree (MST) of an undirected neutrosophic graphs (UNG), in which the edge weights represent neutrosophic values. The approximation upon the balanced score calculation is introduced for all known configurations in alternative MST. As the result, we further compute decisive threshold value for the weak weights amid minimum cost pre-computation. If the threshold triggers then the proper MST can direct the decision and avoid post-computation. The proposed algorithm is also related to other existing approaches and a numerical analysis is presented
    • …
    corecore