Journal Description
Algorithms
Algorithms
is a peer-reviewed, open access journal which provides an advanced forum for studies related to algorithms and their applications, and is published monthly online by MDPI.
- Open Access — free for readers, with article processing charges (APC) paid by authors or their institutions.
- High Visibility: indexed within Scopus, ESCI (Web of Science), Ei Compendex, and other databases.
- Journal Rank: JCR - Q2 (Computer Science, Theory and Methods) / CiteScore - Q1 (Computational Mathematics)
- Rapid Publication: manuscripts are peer-reviewed and a first decision is provided to authors approximately 17.6 days after submission; acceptance to publication is undertaken in 3.9 days (median values for papers published in this journal in the first half of 2026).
- Testimonials: See what our editors and authors say about Algorithms.
- Recognition of Reviewers: reviewers who provide timely, thorough peer-review reports receive vouchers entitling them to a discount on the APC of their next publication in any MDPI journal, in appreciation of the work done.
- Journal Cluster of Artificial Intelligence: AI, AI in Medicine, Algorithms, BDCC, MAKE, MTI, Stats, Virtual Worlds, Computers and Journal of Superintelligence.
Impact Factor:
2.6 (2025);
5-Year Impact Factor:
2.3 (2025)
Latest Articles
A VMD-JMD Hybrid Decomposition and CFC-FLCA Network for COVID-19 Multi-Step Epidemic Forecasting
Algorithms 2026, 19(7), 577; https://doi.org/10.3390/a19070577 (registering DOI) - 14 Jul 2026
Abstract
To address the high non-stationarity of COVID-19 pandemic time-series data and the severe error accumulation issue in long-horizon forecasting, a spatiotemporal two-branch multi-step forecasting model named CFC-FLCA is proposed. This model integrates closed-form continuous-time neural networks (CFC), a hybrid decomposition strategy combining variational
[...] Read more.
To address the high non-stationarity of COVID-19 pandemic time-series data and the severe error accumulation issue in long-horizon forecasting, a spatiotemporal two-branch multi-step forecasting model named CFC-FLCA is proposed. This model integrates closed-form continuous-time neural networks (CFC), a hybrid decomposition strategy combining variational mode decomposition (VMD) and jump plus AM-FM mode decomposition (JMD), and a cross-attention (CA) mechanism. First, the VMD-JMD hybrid mode decomposition method is applied to preprocess raw new case sequences. By leveraging the complementary advantages of the two decomposition algorithms, non-stationary sequences are adaptively decomposed into high-frequency noise components and low-to-mid-frequency trend-periodic components, eliminating random disturbance interference at the data source. On this basis, a time–frequency dual-branch feature extraction network is constructed. CFC provides ultra-long-range temporal dependency modeling capability; the time-domain branch adopts Legendre projection units (LPU) to extract robust temporal evolution features, while the frequency-domain branch employs frequency-enhanced units (FEU) to uncover latent periodic patterns that are difficult to capture using traditional time-domain methods. A cross-attention mechanism is introduced to dynamically learn the importance weights of time–frequency-domain features, enabling the adaptive deep integration of complementary information and effectively mitigating error accumulation in long-horizon forecasting. Multi-step forecasting experiments are conducted on real-world COVID-19 datasets from Belgium, the Czech Republic, and Ireland, with comprehensive comparisons against mainstream time series forecasting models. The experimental results demonstrate that the CFC-FLCA model outperforms all comparison models across all evaluation metrics for all prediction horizons.
Full article
(This article belongs to the Topic Theoretical Foundations and Applications of Deep Learning Techniques)
►
Show Figures
Open AccessArticle
Fuzzy Operators and Hyers–Ulam Stability in the Context of ∗-Fuzzy Measure Spaces
by
Aseel Ahmed Shihab Alshabeeb and Reza Saadati
Algorithms 2026, 19(7), 576; https://doi.org/10.3390/a19070576 (registering DOI) - 14 Jul 2026
Abstract
In this paper, we introduce -fuzzy quasi-k-norms with respect to a continuous t-norm . Also, we investigate fuzzy operators defined on the product of a ∗-fuzzy measure space and an algebraic group, taking values in a -fuzzy quasi-
[...] Read more.
In this paper, we introduce -fuzzy quasi-k-norms with respect to a continuous t-norm . Also, we investigate fuzzy operators defined on the product of a ∗-fuzzy measure space and an algebraic group, taking values in a -fuzzy quasi-k-normed space. Furthermore, by employing a fuzzy controller associated with the ct-norm , we give sufficient conditions for the approximation of a given operator by a homomorphic fuzzy operator.
Full article
Open AccessArticle
Recursively Constructed Uniform Hypergraphs
by
Frank Gurski, Jochen Rethmann and Egon Wanke
Algorithms 2026, 19(7), 575; https://doi.org/10.3390/a19070575 (registering DOI) - 14 Jul 2026
Abstract
In this work, we introduce and study a generalization for r-uniform hypergraphs of complement-reducible graphs, the so-called co-graphs. The operations for r-join-hypergraphs are the binary disjoint union of two given r-join-hypergraphs and the r-nary join, which inserts all possible
[...] Read more.
In this work, we introduce and study a generalization for r-uniform hypergraphs of complement-reducible graphs, the so-called co-graphs. The operations for r-join-hypergraphs are the binary disjoint union of two given r-join-hypergraphs and the r-nary join, which inserts all possible hyperedges of cardinality r, each including exactly one vertex from each of r given r-join-hypergraphs. We characterize the primal graphs of r-join-hypergraphs as special co-graphs and give some properties of r-join-hypergraphs. This allows us to give a method that decides whether an r-uniform input hypergraph H is an r-join-hypergraph and, in the case of an affirmative answer, finds a decomposition tree for H in polynomial time. This task proved to be challenging. We show specific formulas for computing various hypergraph parameters for r-uniform hypergraphs defined by the binary disjoint union of two r-uniform hypergraphs and the r-nary join of rr-uniform hypergraphs. The parameters considered are the size of a largest stable set, the size of a largest co-stable set, the size of a largest independent set, the size of a largest co-independent set, the size of a smallest vertex cover, the size of a smallest 2-transversal, the size of a largest matching, the size of a smallest dominating set, the chromatic number, the strong chromatic number, and the upper chromatic number. This yields -time algorithms to compute these values on r-join-hypergraphs on n vertices given by a decomposition tree. Of particular interest is the development of an efficient algorithm to compute the size of a largest matching. In addition, we infer relations among the considered parameters restricted to r-join-hypergraphs. Our methods generalize and reprove a number of results that are known for co-graphs.
Full article
(This article belongs to the Section Combinatorial Optimization, Graph, and Network Algorithms)
Open AccessArticle
A New One-Machine Decomposition Technique for Solving the Permutation Flow-Shop Scheduling Problem
by
Mehrdad Amirghasemi, Stefan Voß, Wolfgang Garn, Amir Arjomandi and Robert Ogie
Algorithms 2026, 19(7), 574; https://doi.org/10.3390/a19070574 - 13 Jul 2026
Abstract
Existing metaheuristics for the permutation flow-shop scheduling problem primarily explore the search space directly. This study presents a new decomposition technique that, unlike those methods, repeatedly solves one-machine subproblems and extends their solutions to all machines in order to minimize the makespan objective.
[...] Read more.
Existing metaheuristics for the permutation flow-shop scheduling problem primarily explore the search space directly. This study presents a new decomposition technique that, unlike those methods, repeatedly solves one-machine subproblems and extends their solutions to all machines in order to minimize the makespan objective. To this end, the proposed algorithm solves the one-machine problem using a novel forward-backward procedure and extends its solutions to all machines through recurrent displacement of jobs. The improvement of the current solution proceeds until no optimal permutation for a single machine can improve the overall permutation for all machines, gradually improving current solutions and directing the search towards obtaining high-quality solutions. To further improve the results, any solution proposed by the one-machine solution strategy is refined by a local search process. An innovative triangular mechanism is also proposed for constructing initial solutions, with the aim of providing a high-quality starting point for the algorithm. The results of computational experiments not only demonstrate the efficiency of the one-machine forward-backward technique, but also indicate that the algorithm is both robust and highly effective in solving the standard benchmark instances.
Full article
Open AccessArticle
Algorithms for Automated Structural and Positional Analysis of Planar Linkage Mechanisms with Higher-Class Assur Groups
by
Daulet Akhmedov, Askar Seidakhmet, Yevgeniy Savelyev and Moldir Tanashova
Algorithms 2026, 19(7), 573; https://doi.org/10.3390/a19070573 - 13 Jul 2026
Abstract
►▼
Show Figures
The structural and positional analysis of planar linkage mechanisms containing higher-class Assur groups requires the generation and solution of systems of algebraic kinematic equations. This paper presents algorithms for the automated analysis of such mechanisms based on an information matrix model. The proposed
[...] Read more.
The structural and positional analysis of planar linkage mechanisms containing higher-class Assur groups requires the generation and solution of systems of algebraic kinematic equations. This paper presents algorithms for the automated analysis of such mechanisms based on an information matrix model. The proposed representation describes a mechanism as a system of material points connected by geometric constraints and provides a unified framework for algorithmic processing of mechanism structure and parameters. A square-matrix information model is developed to store structural and geometric information of a mechanism. Based on this model, three algorithms are proposed: (i) an algorithm for structural analysis and determination of mechanism mobility, (ii) an algorithm for automatic generation of kinematic equations, and (iii) an algorithm for automatic construction of a positional analysis procedure for solving the generated system of algebraic equations. For mechanisms containing higher-class Assur groups, the developed approach automatically generates an ordered sequence of two-link kinematic chains. When direct decomposition is not possible, conditional driving links are introduced by selecting conditionally disconnected links and defining corresponding driving coordinates. The proposed algorithms have been implemented in the SAPRM system. The applicability of the approach is demonstrated through positional analysis of three planar linkage mechanisms containing higher-class Assur groups.
Full article

Figure 1
Open AccessArticle
Performance Evaluation of Daubechies Wavelet-Based Feature Extraction for Multi-State Remaining Useful Life Prediction in Roller Bearings Using Machine Learning Algorithms
by
Rajkumar Palaniappan
Algorithms 2026, 19(7), 572; https://doi.org/10.3390/a19070572 - 13 Jul 2026
Abstract
Determining the Remaining Useful Life (RUL) in roller bearings is of utmost importance in rotary machinery. Knowing the present state and acting before a failure occurs is the most important aspect in industrial setups. This research presents an effective methodology to determine the
[...] Read more.
Determining the Remaining Useful Life (RUL) in roller bearings is of utmost importance in rotary machinery. Knowing the present state and acting before a failure occurs is the most important aspect in industrial setups. This research presents an effective methodology to determine the RUL state of roller bearings by successfully using different combinations of Daubechies order and decomposition levels of Wavelet Transforms and applying machine learning methods. A dataset comprising temperature and vibration signals collected from a roller bearing test rig was developed for this study. These signals were then filtered using Butterworth bandpass filter for vibration signal filtering and moving average filter for temperature signal filtering followed by splitting the signal into overlapping windows. Then the signals are subjected to Wavelet Packet Transform followed by statistical feature extraction. In the classification phase, machine learning models such as the Support Vector Machine (SVM), K-Nearest Neighbor (KNN), Decision Tree (DT) and Naive Bayes (NB) were used to classify the RUL state in roller bearing. While analyzing different wavelet types (db1 to db10) through seven decomposition levels, this research determined that a db4 wavelet at the third level was identified as optimal for detecting RUL state in roller bearing. The results show that Support Vector Machine (SVM) classifier achieved maximum classification accuracy of 97.68 ± 0.64%, which is higher than the other classification models used in this study. These results show that the careful calibration of wavelet parameters, combined with an efficient machine learning model can provide a reliable solution for real-time machine health monitoring and predictive maintenance of rotating equipment.
Full article
(This article belongs to the Special Issue Intelligent Algorithms and Signal Processing Techniques for Fault Diagnosis in Mechanical and Electrical Systems)
►▼
Show Figures

Figure 1
Open AccessArticle
HB-APC: Temporal Redistribution via Charging Depth Control for Wireless Rechargeable Sensor Networks
by
Rei-Heng Cheng and Chang Wu Yu
Algorithms 2026, 19(7), 571; https://doi.org/10.3390/a19070571 - 11 Jul 2026
Abstract
Wireless Rechargeable Sensor Networks (WRSNs) rely on Wireless Charging Vehicles (WCVs) to replenish sensor nodes under limited mission budgets. Existing semi-on-demand strategies mainly emphasize node selection and service ordering, while charging depth is often fixed or treated as a secondary factor rather than
[...] Read more.
Wireless Rechargeable Sensor Networks (WRSNs) rely on Wireless Charging Vehicles (WCVs) to replenish sensor nodes under limited mission budgets. Existing semi-on-demand strategies mainly emphasize node selection and service ordering, while charging depth is often fixed or treated as a secondary factor rather than being used to regulate future request timing. This work proposes HB-APC, a Hybrid-Budget Adaptive Partial Charging framework for WRSNs. HB-APC uses safeguarded charging and pressure-aware adaptive charging-depth allocation as a temporal request-redistribution mechanism. Safeguarded charging assigns request nodes a target energy level that supports survival beyond a future service window, while pressure-aware adaptive partial charging adjusts the proactive charging depth according to system pressure to balance per-node depth and service coverage. Rather than simply reducing request volume, HB-APC delays and disperses future request arrivals. NS-3 simulation results show that HB-APC maintains comparable performance under light and moderate loads while significantly improving survivability under high-pressure scenarios. In the 1000 × 1000 m, 1900-node static scenario, HB-APC increases First Node Dead Time (FND) from 19,705.07 s to 392,720.97 s and reduces dead nodes from 97.97 to 5.40.
Full article
(This article belongs to the Special Issue Energy-Efficient Algorithms for Large-Scale Wireless Sensor Networks)
Open AccessArticle
An Adaptive Sliding-Window Ant Colony Optimization Approach for Multi-UAV Delivery Routing with Safety and Lateness Objectives
by
Xin-Yi Chen, Lin Shi and Jian-Yu Li
Algorithms 2026, 19(7), 570; https://doi.org/10.3390/a19070570 - 11 Jul 2026
Abstract
Urban unmanned aerial vehicle (UAV) logistics systems require routing algorithms that can balance delivery efficiency and operational safety under complex physical and environmental constraints. However, existing multi-objective routing methods often show limited adaptability when the search landscape changes during optimization. In particular, conventional
[...] Read more.
Urban unmanned aerial vehicle (UAV) logistics systems require routing algorithms that can balance delivery efficiency and operational safety under complex physical and environmental constraints. However, existing multi-objective routing methods often show limited adaptability when the search landscape changes during optimization. In particular, conventional ant colony optimization (ACO) algorithms usually rely on fixed pheromone update rules, which may lead to premature convergence, uneven Pareto front distributions, and pheromone-induced search stagnation. To address these limitations, this paper proposes a Sliding-Window Adaptive Multi-Strategy Ant Colony Optimization (SW-MSACO) framework for complex urban UAV delivery routing. First, a Complex Multi-objective Urban Routing Problem (CMURP) is formulated by jointly considering cumulative delivery lateness and safety risk under payload and nonlinear battery energy constraints. Second, a multi-strategy pheromone evolution pool is designed to provide complementary search behaviors for convergence acceleration, safety-efficiency balancing, and Pareto front diversity preservation. Third, a Sliding-Window Adaptive Strategy Selection (SW-ASS) mechanism is introduced to adjust strategy selection probabilities according to recent search performance rather than long-term cumulative rewards. Comprehensive simulation experiments under different map scales and task-load conditions demonstrate that SW-MSACO achieves improved Pareto solution quality and search stability compared with existing heuristic optimization approaches, particularly under large-scale and high-load scenarios, confirming the effectiveness of the proposed framework for complex UAV logistics optimization.
Full article
Open AccessArticle
A Multi-Attribute Decision-Making Method Based on Weighted Hesitant Fuzzy Linguistic Frank Aggregation Operators with an Application to Regional Twinning Support Evaluation
by
Jinbo Zhang and Minghua Shi
Algorithms 2026, 19(7), 569; https://doi.org/10.3390/a19070569 - 11 Jul 2026
Abstract
Hesitant fuzzy linguistic sets (HFLSs) combine natural language expressions with membership information in a hesitant manner, thereby breaking the barriers between fuzzy evaluation and natural language-based decision-making. Hence, they have become a crucial tool for constructing linguistic decision-making frameworks. However, HFLSs treat all
[...] Read more.
Hesitant fuzzy linguistic sets (HFLSs) combine natural language expressions with membership information in a hesitant manner, thereby breaking the barriers between fuzzy evaluation and natural language-based decision-making. Hence, they have become a crucial tool for constructing linguistic decision-making frameworks. However, HFLSs treat all linguistic expressions in the evaluation system as equally important, which reduces the accuracy of linguistic decision models. In practical situations, decision makers usually assign different weights to different linguistic descriptions. Therefore, in this paper, we propose a generalization of HFLSs called the weighted hesitant fuzzy linguistic term set (WHFLTS) to represent the uncertain subjective preference information of experts, and design a multiple-attribute decision-making procedure. Firstly, the definition of WHFLTS is given. Then, under the Frank operational law, the algebraic and geometric aggregation operators for weighted hesitant fuzzy linguistic information are discussed: namely, the WHFLFWA operator and the WHFLFWG operator. On this basis, a linguistic decision-making strategy is proposed. The example presented in this paper shows that WHFLTS can model uncertain problems in a more adequate way, and the Frank aggregation operators defined in this paper can reflect the decision makers’ attitudes, making them more broadly applicable in decision-making problems.
Full article
(This article belongs to the Special Issue Deep Neural Networks and Optimization Algorithms (2nd Edition))
Open AccessArticle
Localized Debris Detection in Post-Disaster Aerial Imagery Using YOLO-SDD
by
Hassan Al-Derham, Mahitha Veeramachaneni, Lu Gao, Yunpeng Zhang, Jingran Sun, Ahmed Senouci and Kevin Fu
Algorithms 2026, 19(7), 568; https://doi.org/10.3390/a19070568 - 10 Jul 2026
Abstract
Post-disaster debris detection is important for rapid damage assessment, emergency response, and recovery planning. However, debris objects in aerial imagery are often fragmented, irregularly shaped, partially occluded, and visually confused with shadows, vegetation, roofs, vehicles, and damaged structures. This study proposes YOLO-SDD, a
[...] Read more.
Post-disaster debris detection is important for rapid damage assessment, emergency response, and recovery planning. However, debris objects in aerial imagery are often fragmented, irregularly shaped, partially occluded, and visually confused with shadows, vegetation, roofs, vehicles, and damaged structures. This study proposes YOLO-SDD, a YOLO-based Shape-Guided Debris Detector built on YOLOv8 for localized debris identification in high-resolution post-disaster aerial imagery. YOLO-SDD combines a high-resolution P2 detection pathway with a shape-guided feature refinement module that uses box-supervised pseudo-mask and pseudo-boundary cues to refine P2-level features before final debris detection. A multi-event aerial imagery dataset was constructed from NOAA Emergency Response Imagery using images collected after hurricanes and a tornado in the United States. The model was evaluated using an image-level split, an event-level holdout test, component-level ablation studies, COCO-style scale-specific evaluation, and multi-seed stability analysis. On the image-level test set, YOLO-SDD achieved a precision of 0.959, recall of 0.933, mAP@50 of 0.970, and mAP@50:95 of 0.755, remaining competitive with larger YOLO-family models at lower computational complexity. In the event-level holdout test, YOLO-SDD achieved an AP@50 of 0.80 and an F1 score of 0.79, outperforming the YOLOv8s baseline and the selected large YOLO-family comparison model. The scale-specific evaluation showed improved AP@50 and recall for small and medium debris groups, while failure cases remained associated with shadows, vegetation, low contrast, and highly fragmented debris. The results indicate that shape-guided P2 refinement can improve localized debris screening under the tested conditions, although broader datasets, workflow integration, and human-in-the-loop validation are still needed before operational deployment.
Full article
(This article belongs to the Special Issue Algorithms and Application for Spatiotemporal Data Processing)
►▼
Show Figures

Figure 1
Open AccessArticle
Reducing the Complexity of Computing the Values of a Nash Equilibrium
by
Debtoru Chatterjee, Girish Tiwari and Niladri Chatterjee
Algorithms 2026, 19(7), 567; https://doi.org/10.3390/a19070567 - 10 Jul 2026
Abstract
The Colonel Blotto game, formulated by Émile Borel, involves players allocating limited resources to multiple “battlefields” simultaneously, with the winner being the one who allocates more resources to each battlefield. Computation of the Nash equilibrium, including of two-person, zero-sum, mixed strategy Colonel Blotto
[...] Read more.
The Colonel Blotto game, formulated by Émile Borel, involves players allocating limited resources to multiple “battlefields” simultaneously, with the winner being the one who allocates more resources to each battlefield. Computation of the Nash equilibrium, including of two-person, zero-sum, mixed strategy Colonel Blotto games have encountered issues of scalability and complexity owing to their PPAD completeness. This paper proposes an algorithm that computes the same value as the Nash equilibrium but cannot be characterized by the Fixed-Point Theorems of Tarski, Kakutani and Brouwer. The reduced complexity of the proposed algorithm is based on dispensing with the need for computing both players’ Nash strategies in Colonel Blotto games. The same algorithm can, therefore, be extended to all two-person, zero-sum games to compute the value of the Nash equilibrium. The theoretical superiority of the proposed algorithm over both LP solvers and another method that computes the same value of the game as its Nash equilibrium by a random assignment of probabilities to the active strategy set of the defending player, is also proposed.
Full article
(This article belongs to the Section Analysis of Algorithms and Complexity Theory)
Open AccessArticle
Optimal Design of Non-Linear Fuzzy Inference Controllers via Black-Backed Jackal Optimization: A New Robust Bio-Inspired Framework for Industrial and Autonomous Systems
by
Omar Bahou, Karim El Moutaouakil and Savin Treanţă
Algorithms 2026, 19(7), 566; https://doi.org/10.3390/a19070566 - 10 Jul 2026
Abstract
This study introduces the ’Black-Backed Jackal Optimization’ (BBJO), a nature-inspired meta-heuristic algorithm designed for complex, non-linear, and high-dimensional search spaces. The fundamental mathematical model of BBJO relies on the opportunistic hunting behavior and survivability strategies of the black-backed jackal (Lupulella mesomelas).
[...] Read more.
This study introduces the ’Black-Backed Jackal Optimization’ (BBJO), a nature-inspired meta-heuristic algorithm designed for complex, non-linear, and high-dimensional search spaces. The fundamental mathematical model of BBJO relies on the opportunistic hunting behavior and survivability strategies of the black-backed jackal (Lupulella mesomelas). We use non-linear energy decrease and adaptive Lévy flight to maintain the equilibrium of the search. This allows the algorithm to scan large areas first, then zoom in with a high degree of precision once it has identified a suitable location. This configuration prevents the algorithm from getting stuck on a suboptimal local solution, which is a frequent danger during searches in complex spaces. BBJO has been validated against 23 standard benchmark functions, demonstrating significantly greater accuracy than Particle Swarm Optimization (PSO) on complex and large-scale search spaces. On fixed-size domains ( – ), the BBJO algorithm achieved a 100% success rate with zero standard deviation, surpassing the Grey Wolf Optimizer (GWO) and Differential Evolution (DE), which frequently suffered from structural stagnation. Visual convergence study shows that BBJO efficiently identifies optimal search regions early in the iteration budget, saving time compared to traditional linear decay models. BBJO optimizes fuzzy inference systems (FISs) for two practical applications: autonomous car speed control and industrial furnace regulation. Experimental results indicate that BBJO significantly decreased cumulative penalties and improved steady-state error reduction compared to baseline configurations and established meta-heuristic methods. The results show that BBJO is a reliable and useful technique for engineering optimization.
Full article
(This article belongs to the Special Issue Recent Advances in Numerical Algorithms and Their Applications)
Open AccessArticle
Optimization of the Controller Settings for the Mean Arterial Blood Pressure Regulation Using Pelican Optimization Approach
by
Abhishek Jain, Mohammad Atif Siddiqui, Tirumalasetty Chiranjeevi and Łukasz Knypiński
Algorithms 2026, 19(7), 565; https://doi.org/10.3390/a19070565 - 9 Jul 2026
Abstract
This paper presents a unified comparative study of various controllers, including proportional–integral–derivative (PID), Fractional-Order PID (FOPID), Internal Model Control (IMC) controllers, and Tilt–Integral–Derivative (TID) controllers, for the regulation of mean arterial blood pressure (MABP). The controllers are optimally tuned by using a single
[...] Read more.
This paper presents a unified comparative study of various controllers, including proportional–integral–derivative (PID), Fractional-Order PID (FOPID), Internal Model Control (IMC) controllers, and Tilt–Integral–Derivative (TID) controllers, for the regulation of mean arterial blood pressure (MABP). The controllers are optimally tuned by using a single metaheuristic approach, namely the Pelican Optimization Algorithm (POA), ensuring a fair and consistent comparison. The POA optimizes the objective function using standard error indices (ITAE, IAE, and ISE) along with transient characteristics. The aforementioned controllers are then evaluated under varying patient conditions for different patient categories, including sensitive, nominal, and insensitive, and their performance is systematically compared with one another and with the reported methods from the existing literature. The simulation results demonstrate that IMC offers fast settling with minimal overshoot, FOPID improves robustness through fractional dynamics, and the TID controller provides the smoothest transient response and disturbance rejection across all patient categories. The results confirm the effectiveness of advanced control strategies over conventional PID and highlight the potential of POA-tuned TID control for reliable and patient-specific MABP regulation in critical care applications.
Full article
(This article belongs to the Special Issue Algorithmic Approaches to Control Theory and System Modeling)
►▼
Show Figures

Figure 1
Open AccessArticle
Maize Leaf Disease Detection Based on an Improved YOLOv11n Model
by
Haifeng Fu, Yaxin Xie, Xinlei Xiao, Yonghua Han and Le Dai
Algorithms 2026, 19(7), 564; https://doi.org/10.3390/a19070564 - 9 Jul 2026
Abstract
►▼
Show Figures
To address the challenges in maize leaf disease detection, including large variation in lesion scales, weak texture of small targets, strong background interference, limited recall ability for blurred lesions, and computational redundancy of conventional detection heads, this paper proposes a lightweight detection algorithm
[...] Read more.
To address the challenges in maize leaf disease detection, including large variation in lesion scales, weak texture of small targets, strong background interference, limited recall ability for blurred lesions, and computational redundancy of conventional detection heads, this paper proposes a lightweight detection algorithm based on an improved YOLOv11n. First, a multi-scale global context kernel attention module is designed, which employs GCKA-bottleneck with large-kernel attention and residual connections to enhance the deep semantic representation of multi-scale lesions. Second, a GSConv-enhanced coordinate multi-receptive attention module is constructed, which combines coordinate position awareness and multi-scale depthwise convolution. Finally, a regression-enhanced depthwise-separable decoupled detection head is proposed to decouple classification and regression tasks, and introduces depthwise separable convolution and a distributed bounding box regression. On a public dataset containing four classes, the improved model achieves an mAP@0.5 of 85.36%, a recall of 83.32%, and a precision of 86.91%, which are 3.46, 27 2.94, and 2.38 percentage points higher than those of the original YOLOv11n, respectively. Meanwhile, GFLOPs and parameter count are reduced by 27.0% and 12.4%, respectively. The proposed algorithm strikes a favorable balance between accuracy, real-time performance, and lightweight design, providing a feasible technical support for field deployment in intelligent agricultural disease monitoring systems.
Full article

Figure 1
Open AccessArticle
Localized Spatial Decomposition for Convolutional Classification of Heterogeneous Dried Droplet Patterns
by
Carlos A. Martínez-Miwa, Rocío M. Sánchez-Albores, Yojana J. P. Carreón, Jorge González-Gutiérrez and Mario Castelán
Algorithms 2026, 19(7), 563; https://doi.org/10.3390/a19070563 - 9 Jul 2026
Abstract
Dried droplet imaging has become an established approach for analyzing complex fluid systems as evaporation patterns preserve physicochemical and structural information. However, spatial variability of these patterns limits the effectiveness of conventional texture descriptors. This work presents a region-aware deep learning algorithm for
[...] Read more.
Dried droplet imaging has become an established approach for analyzing complex fluid systems as evaporation patterns preserve physicochemical and structural information. However, spatial variability of these patterns limits the effectiveness of conventional texture descriptors. This work presents a region-aware deep learning algorithm for the classification of dried droplets through spatial decomposition and convolutional learning. Dried droplet images were geometrically standardized prior to patch extraction. The Hough transform supported consistent crown–core localization and patch extraction across the dataset. Each image was divided into twenty localized regions. Twelve represented peripheral patches sampled at 30° intervals. The remaining eight patches were extracted from four central regions using two complementary angular orientations (30° and 90°) per region. This process allowed dataset augmentation and evaluation of regional contributions. Patches were processed using the VGG16 convolutional neural network, following repeated patch-level and droplet-level partitioning strategies designed to prevent data leakage. The proposed algorithm was evaluated on Methotrexate (MTX) droplets prepared with 40%, 60%, and 80% water dilution levels relative to a reference solution. Results show that the proposed strategy increases classification accuracy, outperforming traditional descriptors. These findings demonstrate that spatial decomposition combined with convolutional learning constitutes an effective approach for heterogeneous evaporative pattern classification.
Full article
(This article belongs to the Special Issue Machine Learning for Pattern Recognition (4th Edition))
►▼
Show Figures

Figure 1
Open AccessArticle
An AI-Based Framework for Automated Radiographic Bone Loss Measurement Using Segmentation and Geometric Landmark Modeling
by
Mohammad Abdel-Majeed, Iyad Jafar, Omar AL-Karadsheh, Shorouq Al-Awawdeh, Siraj Zabadi and Mahdi Flefl
Algorithms 2026, 19(7), 562; https://doi.org/10.3390/a19070562 - 8 Jul 2026
Abstract
Accurate assessment of radiographic bone loss (RBL) is essential for periodontal diagnosis and staging; however, manual measurement from dental radiographs is labor-intensive, time-consuming and subject to inter- and intra-examiner variability. Existing AI-based methods primarily formulate bone loss assessment as classification, landmark prediction, or
[...] Read more.
Accurate assessment of radiographic bone loss (RBL) is essential for periodontal diagnosis and staging; however, manual measurement from dental radiographs is labor-intensive, time-consuming and subject to inter- and intra-examiner variability. Existing AI-based methods primarily formulate bone loss assessment as classification, landmark prediction, or direct segmentation of thin anatomical structures, limiting measurement interpretability and robustness. This study proposes clinically interpretable two-phase framework for automated and clinically interpretable RBL estimation from periapical radiographs. The framework explicitly separates anatomical structure recognition from geometric measurement, improving transparency and reducing error propagation. In the first phase, deep learning models segment key anatomical structures, including the crown, root, third root and alveolar bone. In the second phase, a deterministic geometric algorithm extracts clinically relevant landmarks, including the cemento–enamel junction (CEJ), bone crest, and root apex, and computes root length, CEJ–bone crest distance, and radiographic bone loss following established periodontal measurement principles. The framework was evaluated on a curated dataset of annotated radiographs. DS-TransUNet achieved the best segmentation performance. Quantitative evaluation yielded mean absolute errors of 0.81 mm for CEJ–bone crest distance, 0.71 mm for root length, and 5.89% for RBL estimation. Bland–Altman analysis demonstrated minimal systematic bias (−1.03%) and good agreement with expert measurements across different disease severities, supporting the framework’s potential as an objective and clinically applicable tool for periodontal bone loss assessment.
Full article
(This article belongs to the Section Algorithms and Mathematical Models for Computer-Assisted Diagnostic Systems)
►▼
Show Figures

Figure 1
Open AccessArticle
An Enhanced Gold Rush Optimizer for USV Path Planning in Complex Environments
by
Qingye Wang, Jiacai Pan, Yifeng Zhao, Zhihui Hu, Zheping Shao and Sainan Wang
Algorithms 2026, 19(7), 561; https://doi.org/10.3390/a19070561 - 8 Jul 2026
Abstract
To address the problems of slow convergence, long planned paths, and excessive turning points in unmanned surface vehicle (USV) path planning under complex environments, this paper proposes a path planning method based on an Enhanced Gold Rush Optimizer (EGRO). A nonlinear adaptive parameter
[...] Read more.
To address the problems of slow convergence, long planned paths, and excessive turning points in unmanned surface vehicle (USV) path planning under complex environments, this paper proposes a path planning method based on an Enhanced Gold Rush Optimizer (EGRO). A nonlinear adaptive parameter adjustment strategy and a stage-wise dynamic probability mechanism are designed to improve the balance between global exploration and local exploitation at different stages of iteration. In addition, a Gaussian diffusion mechanism combined with a local search operator is introduced to enhance the algorithm’s ability to escape from local optima and reduce the number of path turning points. In the remote-sensing-image-based sea-ice simulation scenario, compared with the conventional GRO, PSO, and GWO algorithms, the maximum observed improvements of EGRO in best fitness, convergence iterations, and the number of path turning points are approximately 31.65%, 51.24%, and 35.00%, respectively. The simulation results indicate that EGRO can provide a feasible swarm-intelligence-based optimization framework for USV path planning. The proposed algorithm can generate feasible paths with relatively shorter lengths and fewer turning points. These characteristics may provide a favorable geometric reference for subsequent trajectory generation and navigation control, thereby highlighting the potential value of EGRO in engineering applications of USV path planning.
Full article
(This article belongs to the Topic Intelligent Optimization Algorithm: Theory and Applications, 2nd Edition)
Open AccessArticle
Comparative Analysis of Machine Learning Algorithms for Malicious Network-Traffic Classification
by
Byron Wladimir Oviedo-Bayas, Stefany Michelle Perachimba Panezo, Jorge Humberto Guanin-Fajardo and Stalin Daniel Carreño Sandoya
Algorithms 2026, 19(7), 560; https://doi.org/10.3390/a19070560 - 8 Jul 2026
Abstract
►▼
Show Figures
The classification of malicious network-traffic is critical to cybersecurity. However, to the best of our knowledge, no previous studies have performed a comparative analysis of supervised algorithms for classifying malicious traffic, specifically within the network environment of UTEQ, an academic setting with distinctive
[...] Read more.
The classification of malicious network-traffic is critical to cybersecurity. However, to the best of our knowledge, no previous studies have performed a comparative analysis of supervised algorithms for classifying malicious traffic, specifically within the network environment of UTEQ, an academic setting with distinctive traffic patterns and security policies. This study compared the performance of four supervised machine learning algorithms (K-Nearest Neighbors, Decision Tree, SVM-RBF, and SVM-Polynomial) using the CRISP-DM methodology. The dataset consisted of 1182 records with 30 variables from Hillstone Networks firewall logs at UTEQ, representing three categories: Normal (74.3%), Botnet_Activity (16.4%), and Other_Malware (9.3%). Preprocessing techniques included SMOTE balancing and Relief-based feature selection (reducing the variables to eight). The area under the curve (AUC) was used as a primary discriminant metric under two complementary one-vs-rest aggregation schemes. Using a support-weighted AUC, K-Nearest Neighbors (k = 7) obtained the highest value (AUC = 0.6147), followed by SVM-Polynomial (0.5846), Decision Tree (0.5724), and SVM-RBF (0.5784), with SVM-RBF obtaining the highest accuracy on the unified eight-feature test set (73.8%). Using a macro-averaged AUC, SVM-Polynomial obtained the highest value (0.6166), closely followed by KNN (0.6133). All AUC values fell within a narrow range (0.57–0.62). A class-wise analysis showed that no single model provides strong discrimination for all traffic classes, and that algorithm selection for operational deployment should be guided by the specific class of interest rather than by a single aggregate metric.
Full article

Figure 1
Open AccessArticle
An Improved Three-Dimensional RRT Path Planning Method Incorporating Path-Aware Whale Optimization
by
Zhaoyang Wang, Da Xu and Yuze Ma
Algorithms 2026, 19(7), 559; https://doi.org/10.3390/a19070559 - 8 Jul 2026
Abstract
►▼
Show Figures
Complex three-dimensional path planning requires a planner to generate collision-free, short, and smooth paths within limited computation time, but traditional RRT-based methods often suffer from unguided sampling, repeated expansion failures in dense obstacle regions, redundant initial paths, and collision-prone post-processing. To address this
[...] Read more.
Complex three-dimensional path planning requires a planner to generate collision-free, short, and smooth paths within limited computation time, but traditional RRT-based methods often suffer from unguided sampling, repeated expansion failures in dense obstacle regions, redundant initial paths, and collision-prone post-processing. To address this problem, this study defines the planning task as efficient path generation in a bounded three-dimensional obstacle space and proposes an environment feedback hybrid sampling bidirectional RRT method integrated with a path-aware improved whale optimization algorithm. In the initial search stage, the algorithm uses the collision rate of each random tree to switch among open-space exploration, heuristic convergence, and blocked region escape sampling. Local obstacle density estimation is further introduced to fuse the sampling direction, goal direction, opposite tree attraction, and obstacle repulsion, while adaptive dual step sizes, backtracking safe step size adjustment, and local rewiring reduce invalid expansions and improve the quality of the first feasible path. In the post-processing stage, the whale optimization algorithm is used to optimize key path nodes rather than all nodes, with path corridor constraints, dynamic fitness weighting, collision repair, elastic band refinement, and B-spline smoothing to shorten the path and improve smoothness while maintaining feasibility. Tested independently 100 times in each of four MATLAB three-dimensional obstacle environments and compared with the best-performing comparison algorithm in each environment, the proposed method reduced planning time by 64.4%, 83.4%, 80.1%, and 39.5%, respectively, and shortened path length by 4.9%, 7.1%, 13.4%, and 10.1%. The success rate reached 100% in the first three environments and 97% in the most complex dense obstacle environment. These results show that the proposed framework improves search efficiency, path quality, and robustness for three-dimensional collision-free path planning under complex obstacle constraints.
Full article

Figure 1
Open AccessArticle
Integrating Boolean Satisfiability Algorithms into Bayesian Networks for Accelerated Deterministic Inference
by
Efraín Evaristo Díaz Macías, José Steven Cordero Bazurto and Byron Wladimir Oviedo Bayas
Algorithms 2026, 19(7), 558; https://doi.org/10.3390/a19070558 - 8 Jul 2026
Abstract
Exact probabilistic inference in Bayesian Networks (BNs) becomes increasingly expensive as network size and structural complexity grow, limiting its applicability in time-sensitive decision-support systems. This study presents a hybrid inference framework that accelerates the deterministic component of Bayesian reasoning by integrating Boolean Satisfiability
[...] Read more.
Exact probabilistic inference in Bayesian Networks (BNs) becomes increasingly expensive as network size and structural complexity grow, limiting its applicability in time-sensitive decision-support systems. This study presents a hybrid inference framework that accelerates the deterministic component of Bayesian reasoning by integrating Boolean Satisfiability (SAT) techniques with Bayesian Networks. The proposed approach transforms deterministic conditional probability table (CPT) entries into conjunctive normal form (CNF), enabling SAT-based logical inference over deterministic constraints while preserving the original Bayesian model for probabilistic reasoning. The framework was evaluated on 25 benchmark Bayesian networks using five independent executions per dataset under identical experimental conditions. Performance was assessed through execution time, instrumented operation counts, and inference coverage, with results reported as mean values, standard deviations, and 95% confidence intervals. Experimental results demonstrate substantial reductions in deterministic inference time while maintaining high coverage of deterministic variable assignments across the evaluated benchmarks. Throughout this paper, the reported performance gains refer exclusively to empirical reductions in execution time and instrumented operation counts. They should not be interpreted as evidence of a reduction in the asymptotic computational complexity of exact Bayesian inference, which remains #P-complete in the general case. Rather, the proposed framework provides an efficient mechanism for accelerating deterministic logical inference within Bayesian Networks under the evaluated benchmark conditions.
Full article
(This article belongs to the Collection Feature Papers in Combinatorial Optimization, Graph, and Network Algorithms)
►▼
Show Figures

Figure 1
Journal Menu
► ▼ Journal Menu-
- Algorithms Home
- Aims & Scope
- Editorial Board
- Reviewer Board
- Topical Advisory Panel
- Instructions for Authors
- Special Issues
- Topics
- Sections & Collections
- Article Processing Charge
- Indexing & Archiving
- Editor’s Choice Articles
- Most Cited & Viewed
- Journal Statistics
- Journal History
- Journal Awards
- Conferences
- Editorial Office
Journal Browser
► ▼ Journal BrowserHighly Accessed Articles
Latest Books
E-Mail Alert
News
Topics
Topic in
Algorithms, Data, Earth, Geosciences, Mathematics, Land, Water, IJGI
Applications of Algorithms in Risk Assessment and Evaluation
Topic Editors: Yiding Bao, Qiang WeiDeadline: 31 July 2026
Topic in
Algorithms, Applied Sciences, Electronics, MAKE, AI, Software
Applications of NLP, AI, and ML in Software Engineering
Topic Editors: Affan Yasin, Javed Ali Khan, Lijie WenDeadline: 30 August 2026
Topic in
Agriculture, Energies, Vehicles, Sensors, Sustainability, Urban Science, Applied Sciences, Algorithms
Sustainable Energy Systems
Topic Editors: Luis Hernández-Callejo, Carlos Meza Benavides, Jesús Armando Aguilar JiménezDeadline: 31 October 2026
Topic in
AI, Algorithms, Diagnostics, Emergency Care and Medicine
Trends of Artificial Intelligence in Emergency and Critical Care Medicine
Topic Editors: Zhongheng Zhang, Yucai Hong, Wei ShaoDeadline: 30 November 2026
Conferences
Special Issues
Special Issue in
Algorithms
Artificial Intelligence Algorithms for Healthcare: 2nd Edition
Guest Editors: Sergiy Yakovlev, Dmytro ChumachenkoDeadline: 31 July 2026
Special Issue in
Algorithms
Transforming Healthcare with Language Models and Multimodal AI: From Theory to Practice
Guest Editor: Hao LiuDeadline: 31 July 2026
Special Issue in
Algorithms
Emerging Trends in Distributed AI for Smart Environments (2nd Edition)
Guest Editor: Yousef FarhaouiDeadline: 31 July 2026
Special Issue in
Algorithms
Computational Modeling and Intelligent Simulation of Next-Generation Energy Systems
Guest Editors: Arya Abdollahi, Frank WernerDeadline: 31 July 2026
Topical Collections
Topical Collection in
Algorithms
Feature Papers in Randomized, Online and Approximation Algorithms
Collection Editor: Frank Werner
Topical Collection in
Algorithms
Feature Papers in Combinatorial Optimization, Graph, and Network Algorithms
Collection Editor: Roberto Montemanni
Topical Collection in
Algorithms
Feature Papers in Algorithms for Multidisciplinary Applications
Collection Editor: Francesc Pozo
Topical Collection in
Algorithms
Feature Papers on Artificial Intelligence Algorithms and Their Applications
Collection Editors: Ulrich Kerzel, Mostafa Abbaszadeh, Andres Iglesias, Akemi Galvez Tomida





