A communication network management system takes the measurements of its state variables at specific instants of time, considering them constant in the interval between two consecutive measurements. Nevertheless, this assumption is not true, since these variables evolve in real time. Therefore, uncertainty is inherent in the processing of the measurements during the intervals so that they cannot be efficiently managed using crisp variables. In this paper, we face this problem by modeling the communications network as a type-V fuzzy graph, where both the nodes and the links are described with precision, but the cost of each link is modeled as a triangular fuzzy number. Different fuzzy cost allocation functions and fuzzy optimization strategies are described and applied to the search for the shortest path between two nodes. An experimental study has been conducted using two representative networks: the backbone network of Nippon Telegraph and Telephone Corporation (NTT) and the National Science Foundation’s Network (NFSNET). In these networks, our fuzzy cost functions and strategies have been compared with the well-known crisp equivalents. The optimal search strategies are based on the proposed Fuzzy Dijkstra Algorithm (FDA), which is described deeply. The simulation results demonstrate that in all cases the fuzzy alternatives surpass or equal the crisp equivalents with statistically significant values. Specifically, the so-called Strategy 8 presents the best throughput, as it significantly exceeds the performance of all those evaluated, achieving a Global Mean Delivery Rate (GMDR) close to 1.
We considered the modeling of the evaluation of projects for industrializing the artisanal production of mescal. A Decision Support system is modeled for determining the priorities of the tasks. The ability for evaluating projects is considered. Data provided from a large research developed in Guerrero provided data for generating scenarios and evaluating behavior of the system.
1 January 2026 in International Journal of Applied Mathematics and Computer Science
Hurricane evacuation planning under uncertainty requires integrating decisions across multiple spatial and temporal scales, yet the literature addresses demand stochasticity, temporal robustness, and computational tractability largely in isolation. This paper develops a unified optimization framework organized around six progressive layers: meteorological scenario generation, deterministic and stochastic network flow planning, vehicle scheduling with origin-based decomposition, classical robust temporal protection, neutrosophic adaptive robust optimization with scenario-anchored uncertainty sets, and computational complexity characterization. An integrated critical review of 337 Scopus-indexed publications (2022–2026) identifies persistent methodological gaps that motivate each architectural layer. The framework couples two-stage stochastic programming with budget-constrained robust optimization, affine decision rules, and neutrosophic indeterminacy calibration within a single operational pipeline. Validation on a georeferenced Caribbean network demonstrates a 94% reduction in binary variables through origin-based decomposition and end-to-end execution in under four minutes, with a sensitivity analysis showing that neutrosophic budget calibration reduces the price of robustness from 24.8% to 2.8%.