The assertiveness theory next addresses the difficulties of the travelling salesman after discussing the problem with transportation and assignment. The Shortest Cycling Route Problem (SCRP) finds the shortest route that stops in each city exactly once using a preset set of cities and their bilateral distances. The arc lengths in TSO are typically seen as representing travel time or travel expenses rather than actual distance. The precise arc length cannot be predicted because cargo, climate, road conditions, and other factors also can affect the journey time or cost. For handling the unpredictability in SCRP, fuzzy set theory provides a new tool. The shortest cyclic route problem with interval-valued neutrosophic fuzzy numbers as cost coefficients is solved using the simplified matrix techniques in this study. Reduced Matrix Method is used to solve a numerical problem and its efficacy is demonstrated.
This paper attempts to commence branch and bound technique to unravel the triangular fuzzy neutrosophic assignment problem (TFNAP). So far there are many researches based on fuzzy and intuitionistic fuzzy assignment problems; this is the first paper to deal with TFNAP which have been introduced as a simplification of crisp sets and intuitionistic fuzzy sets to indicate vague, imperfect, unsure, and incoherent notification about the existent world problem. Here a real-life agricultural problem where the farmer’s objective is to locate the optimal assignment of paddocks to crops in such comportment that the total fertilizer cost becomes least is worked out to illustrate the efficiency of the branch and bound (BnB) algorithm in neutroshopic approach.