In the transport system, it is necessary to optimize routes to ensure that the distance, the amount of fuel used, and travel times are minimized. A classical problem in network optimization is the shortest path problem (SPP), which is used widely in many optimization problems. However, the uncertainty that exists regarding real network problems makes it difficult to determine the exact arc lengths. In this study, we analyzed the problem of route optimization when delivering urban road network products while using fuzzy logic to include factors which are difficult to consider in classical models (e.g., traffic). Our approach consisted of two phases. In the first phase, we calculated a fuzzy coefficient to consider the uncertainty, and in the second phase, we used fuzzy linear programming to compute the optimal route. This approach was applied to a real network problem (a portion of the distribution area of a delivery company in the city of Tuxtla Gutierrez, Chiapas, Mexico) by comparing the travel times between the proposed model and a classical model. The proposed model was shown to predict travel time better than the classical model in this study, reducing the mean absolute percentage error (MAPE) by 25.60%.

This paper presents a hybrid algorithmic framework for fault detection and isolation (FDI) in nonlinear quadrotor unmanned aerial vehicle (UAV) systems operating under closed-loop conditions. The proposed method integrates a Linear Quadratic Control (LQC) strategy, synthesized through Linear Matrix Inequalities (LMIs), with a Conditional Long Short-Term Memory Autoencoder (CLSTM-AE) and an adaptive residual-based decision mechanism. The LQC scheme provides robust trajectory tracking through regional pole-placement constraints, while the CLSTM-AE learns the nominal closed-loop input–output temporal behavior of the UAV using only fault-free data. In contrast to conventional symmetric autoencoder-based detectors, the proposed CLSTM-AE uses the control inputs together with the available attitude estimates, represented by the Euler angles yaw, pitch, and roll, as conditioning information, while reconstructing only the monitored attitude outputs. This asymmetric structure allows the residuals to capture inconsistencies between the commanded control effort and the observed attitude response, which is particularly relevant in closed-loop nonlinear systems where feedback compensation may attenuate fault signatures. Deviations from nominal behavior are detected through reconstruction residuals computed using a smoothed Mean Squared Error (MSE) criterion and evaluated against an adaptive $3\sigma$ threshold. The framework is validated in three-dimensional flight simulations considering abrupt, transient, and incipient actuator fault scenarios. The obtained results show that the proposed approach outperforms representative conventional machine-learning methods, achieving an average accuracy of 98.2%, an average recall of 97.8%, and an average false positive rate of 1.4%. These results suggest that the proposed hybrid algorithm provides an effective and interpretable solution for closed-loop fault diagnosis in nonlinear UAV systems under measurement noise and system variability.

Due to the increasing need for continuous use of face masks caused by COVID-19, it is essential to evaluate the filtration quality that each face mask provides. In this research, an estimation method based on thermal image processing was developed; the main objective was to evaluate the effectiveness of different face masks while being used during breathing. For the acquisition of heat distribution images, a thermographic imaging system was built; moreover, a deep learning model detected the leakage percentage of each face mask with a mAP of 0.9345, recall of 0.842 and F1-score of 0.82. The results obtained from this research revealed that the filtration effectiveness depended on heat loss through the manufacturing material; the proposed estimation method is simple, fast, and can be replicated and operated by people who are not experts in the computer field.

Vehicle Routing Problems are central to logistics and operational research, arising in diverse contexts such as transportation planning, manufacturing systems, and military operations. While Deep Reinforcement Learning has been successfully applied to both deterministic and stochastic variants of Vehicle Routing Problems, existing approaches often neglect critical time-sensitive conditions. This work addresses the Stochastic Capacitated Vehicle Routing Problem with Service Times and Deadlines, a challenging formulation that is suited to model time routing conditions. The proposal, POMO-DC, integrates a novel dynamic context mechanism. At each decision step, this mechanism incorporates the vehicle’s cumulative travel time and delays—features absent in prior models—enabling the policy to adapt to changing conditions and avoid time violations. The model is evaluated on stochastic instances with 20, 30, and 50 customers and benchmarked against Google OR-Tools using multiple metaheuristics. Results show that POMO-DC reduces average delays by up to 88% (from 169.63 to 20.35 min for instances of 30 customers) and 75% (from 4352.43 to 1098.97 min for instances of 50 customers), while maintaining competitive travel times. These outcomes highlight the potential of Deep Reinforcement Learning-based frameworks to learn patterns from stochastic data and effectively manage time uncertainty in Vehicle Routing Problems.

This work proposes solving the Traveling Salesman Problem by applying combined heuristic global and local search methods. The proposed method is divided into three phases: first, it evaluates an initial route and chooses the minimum value of rows in a distance matrix. The next phase seeks to improve the route’s cost globally and with a 2-opt local search method, remove the crossings, and further minimize the cost of departure. Finally, the last phase evaluates and conserves each cost using tabu search, proposing a parameter $\beta$ that describes the algorithm convergence factor. This paper assessed 29 TSPLIB instances and compared them with other algorithms: the ant colony optimization algorithm (ACO), artificial neural network (ANN), particle swarm optimization (PSO), and genetic algorithm (GA). With the proposed algorithm, results close to the optimal ones are obtained, and the proposed algorithm is assessed on 29 TSPLIB instances. Based on 30 independent runs per instance, the method achieves a mean absolute percentage error (MAPE) of 1.4484% relative to the known optima, demonstrating its accuracy. Furthermore, statistical comparisons using the coefficient of variation (CV) for runtime and the Wilcoxon signed-rank test confirm that the proposed hybrid algorithm is significantly faster than traditional ant colony optimization (T-ACO) and a new ant colony optimization algorithm (N-ACO) while maintaining competitive solution quality.