<?xml version="1.0" encoding="UTF-8"?>
<article xmlns:xlink="http://www.w3.org/1999/xlink">
<front><article-meta>
<title-group><article-title>A Systemic Review on the Adoption of Particle Swarm Optimization Algorithms in Biomedical Engineering Diagnostics and Simulations</article-title></title-group>
<contrib-group>
<contrib contrib-type="author"><name><surname>Ekanem</surname><given-names>Imoh Ime</given-names></name><xref ref-type="aff" rid="aff1"/></contrib>
<contrib contrib-type="author"><name><surname>Ekanem</surname><given-names>Aniekan Essienubong</given-names></name><xref ref-type="aff" rid="aff1"/></contrib>
<contrib contrib-type="author"><name><surname>Abia</surname><given-names>Eyo Sunday</given-names></name><xref ref-type="aff" rid="aff2"/></contrib>
<aff id="aff1">Department of Mechanical Engineering, Akwa Ibom State Polytechnic, Ikot Osurua, Ikot Ekpene, Nigeria.</aff>
<aff id="aff2">Department of Electrical Engineering, University of Cross River State, Nigeria.</aff>
</contrib-group>
<abstract><p>In biomedical engineering, Particle Swarm Optimization (PSO) algorithms have been increasingly adopted for diagnostics and simulations due to their ability to optimize parameters and improve the accuracy of results effectively. Despite the growing interest in the adoption of PSO algorithms in biomedical engineering, there is a lack of comprehensive understanding of their effectiveness and limitations in diagnostics and simulations. Existing studies have focused on specific applications or case studies. Still, there is a need for a systematic review to synthesize the current state of knowledge and provide insights into the potential benefits and challenges of using PSO algorithms in this context. This study adopted a systematic review comprising a rigorous methodology to identify relevant studies on adopting PSO algorithms in biomedical engineering diagnostics and simulations. A comprehensive search strategy was also developed to identify relevant literature from significant databases. The findings revealed that PSO algorithms have been successfully applied in various biomedical applications, including image processing, signal analysis, and medical image reconstruction. This study reported improvements in accuracy, efficiency, and robustness compared to traditional optimization methods, highlighting the potential of PSO algorithms in enhancing the performance of biomedical engineering systems. The findings suggest that PSO algorithms have the potential to significantly improve the accuracy and efficiency of biomedical engineering systems, but further research is needed to address the challenges and limitations associated with their implementation.</p></abstract>
<kwd-group kwd-group-type="author"><kwd>Particle swarm optimization</kwd><kwd>Biomedical engineering</kwd><kwd>Algorithms</kwd><kwd>Diagnostics</kwd><kwd>Simulations</kwd></kwd-group>
</article-meta></front>
<body>
<sec id="sec-1"><label>1</label><title>Introduction</title>
<p>Particle Swarm Optimization (PSO) algorithms have gained significant attention in biomedical engineering for their ability to solve complex optimization problems efficiently <xref ref-type="bibr" rid="ref-1">[1]</xref>. These algorithms are inspired by the social behaviour of bird flocking and fish schooling, where individuals work together to find the optimal solution to a problem. PSO algorithms are a population-based stochastic optimization technique inspired by the social behavior of bird flocking or fish schooling. The algorithm starts with a population of candidate solutions, called particles, which move through the search space to find the optimal solution <xref ref-type="bibr" rid="ref-2">[2]</xref>, <xref ref-type="bibr" rid="ref-3">[3]</xref>. Each particle adjusts its position based on its own experience and the experience of its neighbors to converge toward the global optimum. In the context of biomedical engineering, PSO algorithms have been used in diagnostics and simulations to improve the accuracy and efficiency of various processes <xref ref-type="bibr" rid="ref-4">[4]</xref>, <xref ref-type="bibr" rid="ref-5">[5]</xref>. From a technical perspective, PSO algorithms are characterized by their simplicity, ease of implementation, and ability to handle high-dimensional search spaces. These algorithms are particularly well-suited for problems with non-linear and non-convex objective functions, which are common in biomedical engineering applications.</p>
<p>Additionally, PSO algorithms are highly parallelizable, making them suitable for implementation on parallel computing platforms to further enhance their efficiency. Regarding technology, PSO algorithms have been integrated into various software tools and platforms used in biomedical engineering research <xref ref-type="bibr" rid="ref-6">[6]</xref>, <xref ref-type="bibr" rid="ref-7">[7]</xref>. These tools provide researchers and practitioners with user-friendly interfaces for configuring and running PSO algorithms and for visualizing and analyzing the optimization results. The availability of these tools has facilitated the widespread adoption of PSO algorithms in biomedical engineering applications. The adoption of PSO algorithms in biomedical engineering diagnostics and simulations has been driven by the need for more accurate and reliable methods for analyzing complex biological data. Traditional optimization algorithms often struggle to find the global optimum in high-dimensional spaces, making them less effective for solving complex biomedical problems.</p>
<p>On the other hand, PSO algorithms have been shown to be highly effective in finding the global optimum by iteratively updating the positions of particles in the search space based on their own best position and the best position found by the group <xref ref-type="bibr" rid="ref-8">[8]</xref>, <xref ref-type="bibr" rid="ref-9">[9]</xref>. PSO algorithms have been widely used in biomedical engineering for diagnostics and simulations because they efficiently search for optimal solutions in complex and high-dimensional spaces. The historical evolution of PSO algorithms in this field can be traced back to their inception in the early 1990s by Kennedy and Eberhart, who were inspired by the social behavior of birds flocking and fish schooling. Since then, PSO algorithms have undergone significant developments and adaptations to suit the specific needs of biomedical engineering applications <xref ref-type="bibr" rid="ref-10">[10]</xref>, <xref ref-type="bibr" rid="ref-11">[11]</xref>.</p>
</sec>
<sec id="sec-2"><label>2</label><title>Key Milestones on the Particle Swarm Optimization Algorithms</title>
<p>PSO algorithms have gained significant attention in solving complex optimization problems in biomedical engineering diagnostics and simulations, marking the following key milestones.</p>
<p>I. The development of novel optimization techniques that leverage the unique capabilities of PSO algorithms: Researchers have explored different variations of PSO algorithms, such as hybrid PSO algorithms that combine PSO with other optimization techniques, to enhance their performance in biomedical applications <xref ref-type="bibr" rid="ref-12">[12]</xref>, <xref ref-type="bibr" rid="ref-14">[13]</xref>. For example, hybrid PSO algorithms have been used to optimize the parameters of machine-learning models for disease diagnosis, leading to improved accuracy and efficiency in biomedical diagnostics <xref ref-type="bibr" rid="ref-15">[14]</xref>.</p>
<p>II. The integration of PSO algorithms with advanced imaging techniques for medical image analysis: PSO algorithms have been successfully applied to optimize the segmentation and classification of medical images, enabling more accurate and reliable diagnosis of various medical conditions. By leveraging the power of PSO algorithms, researchers have developed automated systems for medical image analysis that can assist healthcare professionals in making informed decisions about patient care <xref ref-type="bibr" rid="ref-16">[15]</xref>, <xref ref-type="bibr" rid="ref-17">[16]</xref>.</p>
<p>III. The adoption of PSO algorithms in biomedical simulations has really improved the modeling of complex biological systems: PSO algorithms have been used to optimize the parameters of computational models in areas such as drug design and personalized medicine, leading to more accurate predictions and insights into the behavior of biological systems <xref ref-type="bibr" rid="ref-18">[17]</xref>. By incorporating PSO algorithms into biomedical simulations, researchers have been able to accelerate the discovery of new treatments and therapies for various diseases, ultimately improving patient outcomes <xref ref-type="bibr" rid="ref-19">[18]</xref>.</p>
<p>IV. The incorporation of constraints and multi-objective optimization techniques: By considering constraints related to the physical limitations of biomedical systems or the trade-offs between competing objectives in diagnostic and simulation tasks, researchers could tailor PSO algorithms better to address the specific challenges of biomedical engineering problems <xref ref-type="bibr" rid="ref-20">[19]</xref>. This has led to the development of more robust and versatile PSO algorithms that can handle various complex optimization problems in biomedical applications <xref ref-type="bibr" rid="ref-21">[20]</xref>.</p>
<p>V. The introduction of adaptive PSO variants that could dynamically adjust their parameters during the optimization process allowed for better convergence and improved performance in solving complex optimization problems, such as those encountered in medical image processing and signal analysis. Additionally, researchers have explored the use of hybrid PSO algorithms that combine the strengths of PSO with other optimization techniques, such as genetic algorithms or simulated annealing, to further enhance their capabilities in biomedical engineering applications <xref ref-type="bibr" rid="ref-22">[21]</xref>, <xref ref-type="bibr" rid="ref-23">[22]</xref>.</p>
<p>The adoption of PSO algorithms in biomedical engineering diagnostics and simulations has significantly advanced the field by enabling researchers to tackle complex optimization problems more effectively. Key milestones in this adoption include the development of novel optimization techniques, integrating PSO algorithms with advanced imaging techniques, and using PSO algorithms in biomedical simulations <xref ref-type="bibr" rid="ref-24">[23]</xref>. Moving forward, continued research and innovation in applying PSO algorithms in biomedical engineering will further enhance the capabilities of biomedical systems and improve patient care.</p>
</sec>
<sec id="sec-3"><label>3</label><title>Implementing Particle Swarm Optimization Algorithms in Biomedical Engineering Diagnostics and Simulations</title>
<p>In biomedical engineering, PSO algorithms have been widely used for diagnostics and simulations due to their ability to find optimal solutions promptly. The detailed procedure for implementing PSO algorithms in biomedical engineering diagnostics and simulations is as follows.</p>
<p>I. Problem formulation: The first step in implementing a PSO algorithm in biomedical engineering is clearly defining the optimization problem. This involves identifying the objective function to be optimized and any constraints that need to be considered. For example, in diagnosing a disease using medical imaging data, the objective function may be to minimize the error between the predicted and actual diagnosis <xref ref-type="bibr" rid="ref-25">[24]</xref>. II. Initialization: Once the problem has been formulated, the next step is to initialize the population of particles. This involves randomly generating a set of candidate solutions within the search space. Each particle represents a potential solution to the optimization problem and is characterized by its position and velocity in the search space <xref ref-type="bibr" rid="ref-26">[25]</xref>.</p>
<p>III. Fitness evaluation: After initializing the population, the fitness of each particle is evaluated using the objective function. This involves calculating the fitness value of each particle based on how well it satisfies the optimization criteria. In the context of biomedical engineering, this may include evaluating the accuracy of a diagnostic model based on the particle&apos;s position in the search space <xref ref-type="bibr" rid="ref-27">[26]</xref>.</p>
<p>IV. Update particle velocity and position: Once each particle&apos;s fitness has been evaluated, the next step is to update its velocity and position. This is done by applying the PSO algorithm, which involves adjusting the particle&apos;s velocity based on its own best position and the best position found by the entire population. This allows the particles to move towards the optimal solution in the search space <xref ref-type="bibr" rid="ref-28">[27]</xref>.</p>
<p>V. Termination criteria: The optimization process continues iteratively until a termination criterion is met.</p>
<p>This criterion may be a maximum number of iterations, a specific level of convergence, or a predefined threshold for the fitness value. Once the termination criterion is met, the algorithm stops and the best solution found by the PSO algorithm is returned as the final result <xref ref-type="bibr" rid="ref-29">[28]</xref>.</p>
<p>Implementing PSO algorithms in biomedical engineering diagnostics and simulations involves a systematic approach that includes problem formulation, initialization, fitness evaluation, updating particle velocity and position, and defining termination criteria. By following this detailed step-by-step procedure, researchers and practitioners can effectively apply PSO algorithms to solve complex optimization problems in biomedical engineering.</p>
</sec>
<sec id="sec-4"><label>4</label><title>Key Features of Particle Swarm Optimization Algorithms for Biomedical Engineering Diagnostics and Simulations</title>
<p>In the context of biomedical engineering diagnostics and simulations, PSO algorithms that have been successfully applied to tasks such as feature selection, parameter optimization, and model fitting comprise the following features.</p>
<p>I. The Swarm consists of a group of particles that move through the search space to find the optimal solution to the optimization problem. Each particle represents a potential solution to the optimization problem and moves toward the best solution found by the swarm <xref ref-type="bibr" rid="ref-30">[29]</xref>. Each particle has a position and a velocity, which are updated in each iteration based on its own best-known position (p-best) and the best-known position of its neighbors (g-best). The swarm collectively searches the solution space by adjusting the positions of the particles toward the optimal solution. The swarm dynamics are governed by a fitness function, which evaluates the quality of each particle&apos;s solution <xref ref-type="bibr" rid="ref-31">[30]</xref>.</p>
<p>II. Fitness function: In biomedical engineering, the fitness function can be tailored to specific diagnostic or simulation tasks, such as maximizing the accuracy of a diagnostic model or minimizing the error in a simulation <xref ref-type="bibr" rid="ref-32">[31]</xref>. This evaluates the quality of a solution based on a set of objective criteria. The fitness function guides the particles in the swarm toward better solutions by providing feedback on their performance. The goal of the PSO algorithm is to minimize or maximize the fitness function, depending on the nature of the optimization problem <xref ref-type="bibr" rid="ref-33">[32]</xref>.</p>
<p>III. Inertia weight and acceleration coefficients: These are crucial parameters in PSO algorithms that control the exploration and exploitation capabilities of the swarm. The inertia weight determines the balance between exploration (Searching the solution space) and exploitation (Exploiting the current best solution) <xref ref-type="bibr" rid="ref-34">[33]</xref>. In other words, it controls the balance between exploration and exploitation in the search space. A high inertia weight allows particles to explore new regions of the search space, while a low one helps particles exploit promising areas. However, the acceleration coefficients influence the movement of the particles towards the optimal solution. Tuning these parameters is essential for achieving optimal performance of the PSO algorithm <xref ref-type="bibr" rid="ref-35">[34]</xref>. The acceleration coefficients determine how particles are influenced by their own best solution and the best solution found by the swarm.</p>
<p>IV. Swarm topology: This refers to how particles are organized in the swarm and how they interact. Common swarm topologies include fully connected, ring, and star topologies, each with advantages and disadvantages <xref ref-type="bibr" rid="ref-36">[35]</xref>. The choice of swarm topology can impact the convergence speed and exploration capabilities of the PSO algorithm. In biomedical engineering applications, researchers may experiment with different swarm topologies to find the most effective configuration for their specific optimization problem <xref ref-type="bibr" rid="ref-37">[36]</xref>.</p>
<p>In PSO algorithms, particles update their positions and velocities based on several parameters, including the inertia weight, acceleration coefficients, and swarm topology. By adjusting these parameters, users can fine-tune the performance of the PSO algorithm for specific biomedical engineering tasks. POS algorithms offer a powerful tool for solving complex optimization problems in biomedical engineering diagnostics and simulations.</p>
</sec>
<sec id="sec-5"><label>5</label><title>Variants of Particle Swarm Optimization Algorithm for Optimization Problems</title>
<p>Apart from the traditional PSO algorithm, several variants have been proposed in the literature to improve its performance and address specific optimization problems. These variants differ in how they update the particle positions and velocities and in the strategies they use to balance exploration and exploitation. Some of the most commonly used order PSO algorithms include:</p>
<p>I. Constriction Coefficient Particle Swarm Optimization (CCPSO): CCPSO introduces a constriction factor that limits the maximum velocity of particles, preventing them from moving too far away from the best solution found so far (See <xref ref-type="fig" rid="fig1">Fig. 1</xref>). This helps to maintain a balance between exploration and exploitation and improves convergence speed <xref ref-type="bibr" rid="ref-38">[37]</xref>.</p>
<fig id="fig1"><label>Figure 1</label><caption><p>Constriction coefficient for particle swarm optimization [38].</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:4:66,513.9,537,679.4"/><p content-type="note">This figure is shown in the PDF version of the article.</p></fig>
<p>II. Adaptive Particle Swarm Optimization (APSO): APSO dynamically adjusts the inertia weight and acceleration coefficients during the optimization process based on the particles&apos; performance (See <xref ref-type="fig" rid="fig2">Fig. 2</xref>). This allows the algorithm to adapt to the problem&apos;s characteristics and improve its convergence speed <xref ref-type="bibr" rid="ref-40">[39]</xref>. III. Quantum-behaved Particle Swarm Optimization (QPSO): QPSO models particles&apos; behaviour using quantum mechanics principles, such as wave-particle duality and uncertainty, as shown in <xref ref-type="fig" rid="fig3">Fig. 3</xref>.</p>
<fig id="fig2"><label>Figure 2</label><caption><p>Adaptive particle swarm optimization [40].</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:4:66,118.5,537,445.4"/><p content-type="note">This figure is shown in the PDF version of the article.</p></fig>
<p>This allows particles to explore the search space more efficiently and find better solutions in high-dimensional and multimodal optimization problems <xref ref-type="bibr" rid="ref-42">[41]</xref>.</p>
<fig id="fig3"><label>Figure 3</label><caption><p>Quantum-behaved particle swarm optimization [42].</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:5:66,557.3,537,707.9"/><p content-type="note">This figure is shown in the PDF version of the article.</p></fig>
<p>IV. Multi-Objective Particle Swarm Optimization (MOPSO): MOPSO extends the traditional PSO algorithm to handle multiple conflicting objectives simultaneously (See <xref ref-type="fig" rid="fig4">Fig. 4</xref>). It uses a Pareto-based approach to maintain a set of non-dominated solutions, known as the Pareto front, representing the trade-offs between</p>
<fig id="fig4"><label>Figure 4</label><caption><p>Multi-objective particle swarm optimization [44].</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:5:66,339.1,537,486.4"/><p content-type="note">This figure is shown in the PDF version of the article.</p></fig>
<p>V. Hybrid PSO: Hybrid PSO algorithms combine PSO with other optimization techniques, such as genetic algorithms, simulated annealing, or local search methods, as shown in <xref ref-type="fig" rid="fig5">Fig. 5</xref>. This allows the algorithm to benefit from the strengths of different optimization approaches and improve its performance on complex Order PSO algorithms offer various strategies to enhance the performance of the traditional PSO algorithm and address specific optimization challenges. Researchers and practitioners can choose the most suitable variant based on the characteristics of the optimization problem and the desired trade-offs between exploration and exploitation.</p>
<fig id="fig5"><label>Figure 5</label><caption><p>Hybrid particle swarm optimization [46].</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:5:66,98,537,264.2"/><p content-type="note">This figure is shown in the PDF version of the article.</p></fig>
</sec>
<sec id="sec-6"><label>6</label><title>Feature Selection in Particle Swarm Optimization Algorithms for Biomedical Engineering Diagnostics</title>
<p>Feature selection is crucial in optimizing particle swarm algorithms for biomedical engineering diagnostics and simulations. It involves identifying the most relevant features from a dataset that will contribute to the accuracy and efficiency of the algorithm. The procedure for feature selection in PSO algorithms for biomedical engineering applications is as follows.</p>
<p>I. Define the objective function of the optimization algorithm: This function should be designed to maximize the algorithm&apos;s performance by selecting the most informative features from the dataset. The objective function should take into account the specific requirements of the biomedical engineering application, such as the desired level of accuracy and the computational resources available <xref ref-type="bibr" rid="ref-48">[47]</xref>.</p>
<p>II. Initialize the population of particles in the optimization algorithm: Each particle represents a potential solution to the feature selection problem, and the population as a whole explores the search space for the optimal set of features. The particles are initialized with random values for the features, and their positions are updated iteratively based on their performance in the objective function <xref ref-type="bibr" rid="ref-49">[48]</xref>.</p>
<p>III. During each iteration of the optimization algorithm, the particles are evaluated based on their fitness in the objective function. The fitness of a particle is determined by its ability to select the most relevant features from the dataset. Particles that perform well in the objective function are more likely to be chosen for further exploration, while particles that perform poorly are discarded <xref ref-type="bibr" rid="ref-50">[49]</xref>.</p>
<p>IV. As the optimization algorithm progresses, the particles move through the search space for the optimal set of features. This movement is guided by the principles of swarm intelligence, allowing particles to communicate and share information about the best solutions found so far <xref ref-type="bibr" rid="ref-51">[50]</xref>. This collaboration helps the particles converge on a solution that maximizes the algorithm&apos;s performance.</p>
<p>V. Once the optimization algorithm has converged on a solution, the selected features are used to train a machine-learning model for biomedical engineering diagnostics and simulations. This model can then be used to make predictions or analyze data in the biomedical field with the confidence that the selected features are the most relevant for the task at hand <xref ref-type="bibr" rid="ref-52">[51]</xref>.</p>
<p>Feature selection is a critical component of PSO algorithms for biomedical engineering applications. By following the procedure outlined in this study, users can effectively identify the most informative features from a dataset and optimize the performance of their algorithms. This approach can lead to more accurate and efficient diagnostics and simulations in biomedical engineering.</p>
</sec>
<sec id="sec-7"><label>7</label><title>Parametric Optimization in Particle Swarm Optimization Algorithms for Biomedical Engineering Diagnostics</title>
<p>The success of PSO algorithms in biomedical engineering for parameter optimization for diagnostics and simulations relies heavily on carefully selecting and tuning its parameters. The procedures are as follows.</p>
<p>I. The first step in parameter optimization for PSO algorithms is selecting appropriate parameters to optimize.</p>
<p>These parameters typically include the inertia weight, cognitive, and social parameters. The inertia weight controls the trade-off between exploration and exploitation in the search space. At the same time, the cognitive and social parameters determine the influence of personal and social information on particle movement <xref ref-type="bibr" rid="ref-53">[52]</xref>.</p>
<p>II. Once the parameters to be optimized are identified, the next step is to define the search space for each parameter. This involves setting upper and lower bounds for each parameter to ensure the optimization process remains within feasible limits. It is important to carefully consider each parameter&apos;s range of values to avoid premature convergence or poor exploration of the search space <xref ref-type="bibr" rid="ref-54">[53]</xref>.</p>
<p>III. After defining the search space, the next step is to choose an appropriate fitness function to evaluate the performance of the PSO algorithm. The fitness function should be tailored to the specific biomedical engineering application being studied, considering the problem&apos;s objectives and constraints <xref ref-type="bibr" rid="ref-55">[54]</xref>. Common fitness functions in biomedical engineering include classification accuracy, sensitivity, specificity, and area under the receiver operating characteristic curve.</p>
<p>IV. With the parameters, search space, and fitness function defined, the next step is implementing the PSO algorithm and conducting a series of experiments to evaluate its performance. This involves running the algorithm multiple times with different parameter settings and recording the results for each run <xref ref-type="bibr" rid="ref-56">[55]</xref>. It is important to use statistical measures such as mean and standard deviation to analyze the algorithm&apos;s performance and compare different parameter settings.</p>
<p>V. Based on the results of the experiments, the final step is to fine-tune the parameters of the PSO algorithm to achieve optimal performance. This can be done by manually adjusting the parameters based on the insights gained from the experimental results or using metaheuristic optimization techniques such as genetic algorithms or simulated annealing <xref ref-type="bibr" rid="ref-57">[56]</xref>.</p>
</sec>
<sec id="sec-8"><label>8</label><title>Model Fitting in Particle Swarm Optimization Algorithms during Biomedical Engineering Diagnostics</title>
<p>Model fitting is crucial in utilizing PSO algorithms for diagnostics and simulations in biomedical engineering. To achieve this, the following steps must be carefully adopted:</p>
<p>I. Define the objective function: The objective function represents the model&apos;s fitness and evaluates the algorithm&apos;s performance. In biomedical engineering, the objective function may be based on experimental data, simulation results, or a combination of both <xref ref-type="bibr" rid="ref-58">[57]</xref>.</p>
<p>II. Initialize the population: The population represents a set of potential solutions to the optimization problem.</p>
<p>Each particle in the population is assigned a position and velocity, which are updated iteratively during optimization <xref ref-type="bibr" rid="ref-60">[58]</xref>.</p>
<p>III. Evaluate the fitness of each particle: The fitness of each particle is evaluated using the objective function.</p>
<p>The fitness value represents how well the particle&apos;s position fits the model to the experimental data or simulation results <xref ref-type="bibr" rid="ref-61">[59]</xref>. The fitness value determines the particle&apos;s contribution to the optimization process. IV. Update the particle&apos;s position and velocity: The position and velocity of each particle are updated using the PSO algorithm. The new position and velocity are calculated based on the particle&apos;s previous position and velocity and the best position found by the particle or its neighbors <xref ref-type="bibr" rid="ref-62">[60]</xref>.</p>
<p>V. Check for convergence: During the optimization process, monitoring the algorithm&apos;s convergence is important. Convergence occurs when the algorithm reaches a stable solution that satisfies the optimization criteria. Convergence can be checked by monitoring the particles&apos; fitness values and the optimization process&apos;s overall progress <xref ref-type="bibr" rid="ref-14">[13]</xref>.</p>
<p>VI. Terminate the optimization process: The optimization process is terminated when the algorithm converges to a stable solution or reaches a predefined number of iterations. The final solution represents the optimized model that best fits the experimental data or simulation results. The optimized model can be used for diagnostics, simulations, or further analysis in biomedical engineering <xref ref-type="bibr" rid="ref-63">[61]</xref>.</p>
<p>Model fitting in PSO algorithms for biomedical engineering diagnostics and simulations involves the aforementioned steps, which include defining the objective function, initializing the population, evaluating the fitness of each particle, updating the particle&apos;s position and velocity, checking for convergence, and terminating the optimization process, as shown in the flowchart in <xref ref-type="fig" rid="fig6">Fig. 6</xref>. By adopting these steps, users can effectively utilize PSO algorithms for optimizing complex models and simulations in biomedical engineering.</p>
<fig id="fig6"><label>Figure 6</label><caption><p>Flowchart of model fitting in particle swarm optimization algorithms.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:8:66,580.7,537,739.7"/><p content-type="note">This figure is shown in the PDF version of the article.</p></fig>
</sec>
<sec id="sec-9"><label>9</label><title>Factors Affecting the Implementation Process of Particle Swarm Optimization</title>
<p>In the context of diagnostics and simulations in biomedical engineering, the implementation process of PSO can be influenced by several factors that include the following:</p>
<p>I. Choice of objective function: The objective function is crucial in guiding the optimization process towards finding the optimal solution. In the context of diagnostics and simulations in biomedical engineering, the objective function may be complex and multi-dimensional, making it challenging to define and optimize <xref ref-type="bibr" rid="ref-64">[62]</xref>. The choice of an appropriate objective function is essential for the success of the PSO algorithm in biomedical engineering applications.</p>
<p>II. Selection of parameters: The performance of the PSO algorithm is highly dependent on the values of its parameters, such as the inertia weight, acceleration coefficients, and swarm size. The selection of appropriate parameter values is crucial for achieving good convergence and exploration capabilities of the PSO algorithm <xref ref-type="bibr" rid="ref-65">[63]</xref>. In the context of diagnostics and simulations in biomedical engineering, the selection of parameters may require careful tuning and optimization to ensure the effectiveness of the PSO algorithm.</p>
<p>III. The computational complexity of the optimization problem can also impact the implementation process of PSO in biomedical engineering. Diagnostics and simulations in biomedical engineering often involve large-scale and computationally intensive problems that require efficient optimization algorithms <xref ref-type="bibr" rid="ref-66">[64]</xref>. The computational complexity of the optimization problem can affect the convergence speed and accuracy of the PSO algorithm. In such cases, advanced techniques, such as parallelization and hybridization, may be required to enhance the performance of the PSO algorithm in biomedical engineering applications <xref ref-type="bibr" rid="ref-67">[65]</xref>. IV. The presence of noise and uncertainties in biomedical engineering data can also affect the implementation process of PSO. Noise and uncertainties in data can lead to suboptimal solutions and hinder the convergence of the PSO algorithm <xref ref-type="bibr" rid="ref-68">[66]</xref>. Robust optimization techniques, such as adaptive PSO and dynamic parameter adjustment, may be necessary to effectively handle noise and uncertainties in biomedical engineering data.</p>
<p>V. Various factors can influence t.</p>
<p>he implementation process of PSO in diagnostics and simulations in biomedical engineering, including the choice of the objective function, the selection of parameters, the computational complexity of the optimization problem, and the presence of noise and uncertainties in data. Addressing these factors effectively is essential for the successful application of PSO in biomedical engineering.</p>
</sec>
<sec id="sec-10"><label>10</label><title>Key Areas of Particle Swarm Optimization Application in Biomedical Engineering</title>
<p>The key areas of PSO application in different aspects of biomedical engineering are highlighted as follows:</p>
<p>I. Optimization of diagnostic processes: Diagnostic imaging techniques such as MRI, CT scans, and ultrasound play a crucial role in the early detection and diagnosis of various medical conditions. However, these imaging techniques often involve complex algorithms and parameters that must be optimized for accurate and efficient diagnosis <xref ref-type="bibr" rid="ref-69">[67]</xref>. PSO can be used to optimize these parameters by iteratively adjusting them to maximize the accuracy of the diagnostic process. By fine-tuning the parameters using PSO, researchers can improve the sensitivity and specificity of diagnostic imaging techniques, leading to more accurate and reliable diagnoses <xref ref-type="bibr" rid="ref-70">[68]</xref>.</p>
<p>II. Simulation of biological systems: Computational models are often used to simulate the behavior of biological systems, such as the cardiovascular or nervous systems, better to understand their function and dynamics <xref ref-type="bibr" rid="ref-71">[69]</xref>. These models typically involve many parameters that must be optimized to represent the biological system accurately. PSO can be used to optimize these parameters by searching for the optimal set of values that minimize the error between the simulated and observed data. By using PSO to optimize the parameters of computational models, researchers can improve the accuracy and predictive power of these models, leading to a better understanding of complex biological systems <xref ref-type="bibr" rid="ref-72">[70]</xref>.</p>
<p>III. Optimization of medical devices and treatment plans: For example, PSO can be used to optimize the design of medical implants, such as pacemakers or prosthetic limbs, by finding the optimal configuration of components that maximize their performance and longevity <xref ref-type="bibr" rid="ref-73">[71]</xref>. Similarly, PSO can be used to optimize treatment plans for diseases such as cancer by adjusting the dosage and schedule of treatments to maximize their effectiveness while minimizing side effects. Researchers can improve patient outcomes and quality of life by using PSO to optimize medical devices and treatment plans <xref ref-type="bibr" rid="ref-74">[72]</xref>.</p>
<p>PSO is a versatile optimization technique that has been successfully applied in various areas of biomedical engineering diagnostics and simulations. By optimizing parameters in diagnostic processes, computational models, medical devices, and treatment plans, PSO can improve the accuracy, efficiency, and effectiveness of biomedical engineering applications.</p>
</sec>
<sec id="sec-11"><label>11</label><title>Conclusion</title>
<p>The findings from this study on the adoption of PSO algorithms in biomedical engineering diagnostics and simulations have provided valuable insights into the potential benefits and challenges associated with this approach. PSO can efficiently optimize complex and non-linear problems commonly encountered in medical image analysis and signal processing. PSO algorithms can effectively search for optimal solutions in high-dimensional search spaces by iteratively updating particle positions based on their individual and collective knowledge, leading to improved accuracy and efficiency in diagnostic and simulation tasks. However, despite the promising results, some challenges and limitations have been identified in adopting PSO algorithms in biomedical engineering. These include the need for careful parameter tuning, the potential for premature convergence to suboptimal solutions, and the lack of interpretability in the optimization process.</p>
<p>Additionally, the performance of PSO algorithms may be influenced by the choice of fitness function, swarm size, and inertia weight, which can impact their effectiveness in real-world applications. The findings from this study suggest that while PSO algorithms hold great potential for enhancing the capabilities of biomedical engineering diagnostics and simulations, further research is needed to address the existing challenges and limitations. Future studies should focus on developing novel variants of PSO algorithms specifically tailored to the unique requirements of biomedical applications, as well as on conducting rigorous comparative evaluations with other optimization techniques to establish their superiority in performance and robustness</p>
</sec>
<sec id="sec-12"><title>Funding</title>
<p>This research received no external funding.</p>
</sec>
<sec id="sec-13"><title>Data Availability</title>
<p>The raw data supporting the conclusions of this article will be made available by the authors on request.</p>
</sec>
<sec id="sec-14"><title>Conflicts of Interest</title>
<p>The authors declare no conflicts of interest.</p>
</sec>
</body>
<back><ref-list><title>References</title>
<ref id="ref-1"><label>1</label><mixed-citation>Mohd Yamin, M. N., Ab. Aziz, K., Siang, T. G., &amp; Ab. Aziz, N. A. (2023). Particle swarm optimisation for emotion recognition systems: A decade review of the literature. Applied sciences, 13(12), 7054. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3390/app13127054">https://doi.org/10.3390/app13127054</ext-link></mixed-citation></ref>
<ref id="ref-2"><label>2</label><mixed-citation>Gad, A. G. (2022). Particle swarm optimization algorithm and its applications: A systematic review. Archives of computational methods in engineering, 29(5), 2531–2561. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/s11831-021-09694-">https://doi.org/10.1007/s11831-021-09694-</ext-link></mixed-citation></ref>
<ref id="ref-3"><label>3</label><mixed-citation>Wang, D., Tan, D., &amp; Liu, L. (2018). Particle swarm optimization algorithm: An overview. Soft computing, 22(2), 387–408. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/s00500-016-2474-6">https://doi.org/10.1007/s00500-016-2474-6</ext-link></mixed-citation></ref>
<ref id="ref-4"><label>4</label><mixed-citation>Lameesa, A., Hoque, M., Alam, M. S. B., Ahmed, S. F., &amp; Gandomi, A. H. (2024). Role of metaheuristic algorithms in healthcare: a comprehensive investigation across clinical diagnosis, medical imaging, operations management, and public health. Journal of computational design and engineering, 11(3), 223–247. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1093/jcde/qwae046">https://doi.org/10.1093/jcde/qwae046</ext-link></mixed-citation></ref>
<ref id="ref-5"><label>5</label><mixed-citation>Ikpe, A. E., Ohwoekevwo, J. U., &amp; Ekanem, I. I. (2024). Overview of the role of medical robotics in day-to-day healthcare services: A paradigm shift in clinical operations. Ibom medical journal, 17(2), 192–203. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.61386/imj.v7i2.422">https://doi.org/10.61386/imj.v7i2.422</ext-link></mixed-citation></ref>
<ref id="ref-6"><label>6</label><mixed-citation>de Melo Menezes, B. A., Kuchen, H., &amp; Buarque de Lima Neto, F. (2022). Parallelization of swarm intelligence algorithms: Literature review. International journal of parallel programming, 50(5), 486–514. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/s10766-022-00736-3">https://doi.org/10.1007/s10766-022-00736-3</ext-link></mixed-citation></ref>
<ref id="ref-7"><label>7</label><mixed-citation>Sun, Y., Chu, S. C., Hu, P., Watada, J., Si, M., &amp; Pan, J. S. (2022). Overview of parallel computing for meta-heuristic algorithms. Journal of network intelligence, 7(3), 656–684. <ext-link ext-link-type="uri" xlink:href="https://bit.kuas.edu.tw/~jni/2022/vol7/s3/08.JNI0353_r2.pdf">https://bit.kuas.edu.tw/~jni/2022/vol7/s3/08.JNI0353_r2.pdf</ext-link></mixed-citation></ref>
<ref id="ref-8"><label>8</label><mixed-citation>Houssein, E. H., Hosney, M. E., Emam, M. M., Younis, E. M. G., Ali, A. A., &amp; Mohamed, W. M. (2023). Soft computing techniques for biomedical data analysis: Open issues and challenges. Artificial intelligence review, 56(2), 2599–2649. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/s10462-023-10585-2">https://doi.org/10.1007/s10462-023-10585-2</ext-link></mixed-citation></ref>
<ref id="ref-9"><label>9</label><mixed-citation>Rundo, L., Militello, C., Vitabile, S., Russo, G., Sala, E., &amp; Gilardi, M. C. (2019). A survey on nature-inspired medical image analysis: A step further in biomedical data integration. Fundamenta informaticae, 171(1–4), 345–365. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3233/FI-2020-1887">https://doi.org/10.3233/FI-2020-1887</ext-link></mixed-citation></ref>
<ref id="ref-10"><label>10</label><mixed-citation>Beni, G. (2020). Swarm intelligence. In complex social and behavioral systems : Game theory and agent-based models (pp. 791–818). Springer US. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/978-1-0716-0368-0_530">https://doi.org/10.1007/978-1-0716-0368-0_530</ext-link></mixed-citation></ref>
<ref id="ref-11"><label>11</label><mixed-citation>Shahzad, M. M., Saeed, Z., Akhtar, A., Munawar, H., Yousaf, M. H., Baloach, N. K., &amp; Hussain, F. (2023). A review of swarm robotics in a nutshell. Drones, 7(4), 269. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3390/drones7040269">https://doi.org/10.3390/drones7040269</ext-link></mixed-citation></ref>
<ref id="ref-12"><label>12</label><mixed-citation>Sengupta, S., Basak, S., &amp; Peters, R. A. (2018). Particle swarm optimization: A survey of historical and recent developments with hybridization perspectives. Machine learning and knowledge extraction, 1(1), 157–</mixed-citation></ref>
<ref id="ref-13"><label>191</label><mixed-citation><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3390/make1010010">https://doi.org/10.3390/make1010010</ext-link></mixed-citation></ref>
<ref id="ref-14"><label>13</label><mixed-citation>Tian, D., &amp; Shi, Z. (2018). MPSO: Modified particle swarm optimization and its applications. Swarm and evolutionary computation, 41, 49–68. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.swevo.2018.01.011">https://doi.org/10.1016/j.swevo.2018.01.011</ext-link></mixed-citation></ref>
<ref id="ref-15"><label>14</label><mixed-citation>Yadav, R. K., &amp; Anubhav. (2020). PSO-GA based hybrid with adam optimization for ANN training with application in medical diagnosis. Cognitive systems research, 64, 191–199. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.cogsys.2020.08.011">https://doi.org/10.1016/j.cogsys.2020.08.011</ext-link></mixed-citation></ref>
<ref id="ref-16"><label>15</label><mixed-citation>Zhang, T., Zhou, P., Zhang, S., Cheng, S., Ma, L., Jiang, H., &amp; Yao, Y.-D. (2024). Bio-inspired optimisation algorithms in medical image segmentation: A review. International journal of bio-inspired computation, 24(2), 65–79. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1504/IJBIC.2024.141449">https://doi.org/10.1504/IJBIC.2024.141449</ext-link></mixed-citation></ref>
<ref id="ref-17"><label>16</label><mixed-citation>Saifullah, S., &amp; Dreżewski, R. (2024). Advanced medical image segmentation enhancement: A particle-swarm-optimization-based histogram equalization approach. Applied sciences, 14(2), 923. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3390/app14020923">https://doi.org/10.3390/app14020923</ext-link></mixed-citation></ref>
<ref id="ref-18"><label>17</label><mixed-citation>Khare, A., &amp; Rangnekar, S. (2013). A review of particle swarm optimization and its applications in solar photovoltaic system. Applied soft computing, 13(5), 2997–3006. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.asoc.2012.11.033">https://doi.org/10.1016/j.asoc.2012.11.033</ext-link></mixed-citation></ref>
<ref id="ref-19"><label>18</label><mixed-citation>Zhang, Y., Wang, S., &amp; Ji, G. (2015). A comprehensive survey on particle swarm optimization algorithm and its applications. Mathematical problems in engineering, 2015(1), 931256. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1155/2015/931256">https://doi.org/10.1155/2015/931256</ext-link></mixed-citation></ref>
<ref id="ref-20"><label>19</label><mixed-citation>Fei, Z., Li, B., Yang, S., Xing, C., Chen, H., &amp; Hanzo, L. (2017). A survey of multi-objective optimization in wireless sensor networks: Metrics, algorithms, and open problems. IEEE communications surveys &amp; tutorials, 19(1), 550–586. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/COMST.2016.2610578">https://doi.org/10.1109/COMST.2016.2610578</ext-link></mixed-citation></ref>
<ref id="ref-21"><label>20</label><mixed-citation>Suriyan, K., &amp; Nagarajan, R. (2024). Particle swarm optimization in biomedical technologies: Innovations, challenges, and opportunities. In emerging technologies for health literacy and medical practice (pp. 220–238). IGI Global Scientific Publishing. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.4018/979-8-3693-1214-8.ch011">https://doi.org/10.4018/979-8-3693-1214-8.ch011</ext-link></mixed-citation></ref>
<ref id="ref-22"><label>21</label><mixed-citation>Jain, M., Saihjpal, V., Singh, N., &amp; Singh, S. B. (2022). An overview of variants and advancements of PSO algorithm. Applied sciences, 12(17), 8392. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3390/app12178392">https://doi.org/10.3390/app12178392</ext-link></mixed-citation></ref>
<ref id="ref-23"><label>22</label><mixed-citation>Harrison, K. R., Engelbrecht, A. P., &amp; Ombuki-Berman, B. M. (2018). Self-adaptive particle swarm optimization: A review and analysis of convergence. Swarm intelligence, 12(3), 187–226. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/s11721-017-0150-9">https://doi.org/10.1007/s11721-017-0150-9</ext-link></mixed-citation></ref>
<ref id="ref-24"><label>23</label><mixed-citation>Xu, M., Cao, L., Lu, D., Hu, Z., &amp; Yue, Y. (2023). Application of swarm intelligence optimization algorithms in image processing: A comprehensive review of analysis, synthesis, and optimization. Biomimetics, 8(2), 235. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3390/biomimetics8020235">https://doi.org/10.3390/biomimetics8020235</ext-link></mixed-citation></ref>
<ref id="ref-25"><label>24</label><mixed-citation>Razzak, M. I., Naz, S., &amp; Zaib, A. (2018). Deep learning for medical image processing: Overview, challenges and the future. In classification in bioapps: Automation of decision making (pp. 323–350). Cham: Springer, Cham. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/978-3-319-65981-7_12">https://doi.org/10.1007/978-3-319-65981-7_12</ext-link></mixed-citation></ref>
<ref id="ref-26"><label>25</label><mixed-citation>Bangyal, W. H., Nisar, K., Ag. Ibrahim, A. A. B., Haque, M. R., Rodrigues, J. J. P. C., &amp; Rawat, D. B. (2021). Comparative analysis of low discrepancy sequence-based initialization approaches using population-based algorithms for solving the global optimization problems. Applied sciences, 11(16), 7591. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3390/app11167591">https://doi.org/10.3390/app11167591</ext-link></mixed-citation></ref>
<ref id="ref-27"><label>26</label><mixed-citation>Ibrahim, F., Thio, T. H. G., Faisal, T., &amp; Neuman, M. (2015). The application of biomedical engineering techniques to the diagnosis and management of tropical diseases: A review. Sensors, 15(3), 6947–6995. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3390/s150306947">https://doi.org/10.3390/s150306947</ext-link></mixed-citation></ref>
<ref id="ref-28"><label>27</label><mixed-citation>Garcia-Gonzalo, E., &amp; Fernandez-Martinez, J. L. (2012). A brief historical review of particle swarm optimization (PSO). Journal of bioinformatics and intelligent control, 1(1), 3–16. <ext-link ext-link-type="uri" xlink:href="http://dx.doi.org/10.1166/jbic.2012.1002">http://dx.doi.org/10.1166/jbic.2012.1002</ext-link></mixed-citation></ref>
<ref id="ref-29"><label>28</label><mixed-citation>Martí, L., García, J., Berlanga, A., &amp; Molina, J. M. (2016). A stopping criterion for multi-objective optimization evolutionary algorithms. Information sciences, 367–368, 700–718. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.ins.2016.07.025">https://doi.org/10.1016/j.ins.2016.07.025</ext-link></mixed-citation></ref>
<ref id="ref-30"><label>29</label><mixed-citation>Juneja, M., &amp; Nagar, S. K. (2016). Particle swarm optimization algorithm and its parameters: A review. 2016 international conference on control, computing, communication and materials (ICCCCM) (pp. 1–5). IEEE. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/ICCCCM.2016.7918233">https://doi.org/10.1109/ICCCCM.2016.7918233</ext-link></mixed-citation></ref>
<ref id="ref-31"><label>30</label><mixed-citation>Rini, D. P., Shamsuddin, S. M., &amp; Yuhaniz, S. S. (2011). Particle swarm optimization: Technique, system and challenges. International journal of computer applications, 14(1), 19–26. <ext-link ext-link-type="uri" xlink:href="http://dx.doi.org/10.5120/ijais-">http://dx.doi.org/10.5120/ijais-</ext-link></mixed-citation></ref>
<ref id="ref-32"><label>31</label><mixed-citation>Kainz, W., Neufeld, E., Bolch, W. E., Graff, C. G., Kim, C. H., Kuster, N., … ., &amp; Tsui, B. M. W. (2019). Advances in computational human phantoms and their applications in biomedical engineering—a topical review. IEEE transactions on radiation and plasma medical sciences, 3(1), 1–23. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/TRPMS.2018.2883437">https://doi.org/10.1109/TRPMS.2018.2883437</ext-link></mixed-citation></ref>
<ref id="ref-33"><label>32</label><mixed-citation>Parsopoulos, K. E., &amp; Vrahatis, M. N. (2002). Recent approaches to global optimization problems through particle swarm optimization. Natural computing, 1(2), 235–306. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1023/A:1016568309421">https://doi.org/10.1023/A:1016568309421</ext-link></mixed-citation></ref>
<ref id="ref-34"><label>33</label><mixed-citation>Rezaei, F., &amp; Safavi, H. R. (2020). GuASPSO: A new approach to hold a better exploration–exploitation balance in PSO algorithm. Soft computing, 24(7), 4855–4875. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/s00500-019-04240-8">https://doi.org/10.1007/s00500-019-04240-8</ext-link></mixed-citation></ref>
<ref id="ref-35"><label>34</label><mixed-citation>Marini, F., &amp; Walczak, B. (2015). Particle swarm optimization (PSO). A tutorial. Chemometrics and intelligent laboratory systems, 149, 153–165. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.chemolab.2015.08.020">https://doi.org/10.1016/j.chemolab.2015.08.020</ext-link></mixed-citation></ref>
<ref id="ref-36"><label>35</label><mixed-citation>Alswaitti, M., Albughdadi, M., &amp; Isa, N. A. M. (2018). Density-based particle swarm optimization algorithm for data clustering. Expert systems with applications, 91, 170–186. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.eswa.2017.08.050">https://doi.org/10.1016/j.eswa.2017.08.050</ext-link></mixed-citation></ref>
<ref id="ref-37"><label>36</label><mixed-citation>Benuwa, B. B., Ghansah, B., Wornyo, D. K., &amp; Adabunu, S. A. (2016). A comprehensive review of particle swarm optimization. International journal of engineering research in Africa, 23, 141–161. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.4028/www.scientific.net/JERA.23.141">https://doi.org/10.4028/www.scientific.net/JERA.23.141</ext-link></mixed-citation></ref>
<ref id="ref-38"><label>37</label><mixed-citation>Mavrovouniotis, M., Li, C., &amp; Yang, S. (2017). A survey of swarm intelligence for dynamic optimization: Algorithms and applications. Swarm and evolutionary computation, 33, 1–17. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.swevo.2016.12.005">https://doi.org/10.1016/j.swevo.2016.12.005</ext-link></mixed-citation></ref>
<ref id="ref-39"><label>38</label><mixed-citation>Sharma, A., Sharma, A., Jately, V., Averbukh, M., Rajput, S., &amp; Azzopardi, B. (2022). A novel TSA-PSO based hybrid algorithm for GMPP tracking under partial shading conditions. Energies, 15(9), 3164. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3390/en15093164">https://doi.org/10.3390/en15093164</ext-link></mixed-citation></ref>
<ref id="ref-40"><label>39</label><mixed-citation>Kessentini, S., &amp; Barchiesi, D. (2015). Particle swarm optimization with adaptive inertia weight. International journal of machine learning and computing, 5(5), 368-373. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.7763/IJMLC.2015.V5.535">https://doi.org/10.7763/IJMLC.2015.V5.535</ext-link></mixed-citation></ref>
<ref id="ref-41"><label>40</label><mixed-citation>Yue, W., Jin, G., &amp; Yang, X. (2022). Adaptive particle swarm optimization for automatic design of common aperture optical system. Photonics, 9(11), 807. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3390/photonics9110807">https://doi.org/10.3390/photonics9110807</ext-link></mixed-citation></ref>
<ref id="ref-42"><label>41</label><mixed-citation>Fallahi, S., &amp; Taghadosi, M. (2022). Quantum-behaved particle swarm optimization based on solitons. Scientific reports, 12(1), 13977. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1038/s41598-022-18351-0">https://doi.org/10.1038/s41598-022-18351-0</ext-link></mixed-citation></ref>
<ref id="ref-43"><label>42</label><mixed-citation>Bhatia, A. S., Saggi, M. K., &amp; Zheng, S. (2020). QPSO-CD: Quantum-behaved particle swarm optimization algorithm with cauchy distribution. Quantum information processing, 19(10), 345. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/s11128-020-02842-y">https://doi.org/10.1007/s11128-020-02842-y</ext-link></mixed-citation></ref>
<ref id="ref-44"><label>43</label><mixed-citation>Patil, D. D., &amp; Dangewar, B. D. (2014). Multi-objective particle swarm optimization (MOPSO) based on pareto dominance approach. International journal of computer applications, 107(4). <ext-link ext-link-type="uri" xlink:href="http://dx.doi.org/10.5120/18738-9983">http://dx.doi.org/10.5120/18738-9983</ext-link></mixed-citation></ref>
<ref id="ref-45"><label>44</label><mixed-citation>Sun, Y., &amp; Gao, Y. (2019). A multi-objective particle swarm optimization algorithm based on gaussian mutation and an improved learning strategy. Mathematics, 7(2), 148. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3390/math7020148">https://doi.org/10.3390/math7020148</ext-link></mixed-citation></ref>
<ref id="ref-46"><label>45</label><mixed-citation>Mirsadeghi, E., &amp; Khodayifar, S. (2021). Hybridizing particle swarm optimization with simulated annealing and differential evolution. Cluster computing, 24(2), 1135–1163. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/s10586-020-03179-y">https://doi.org/10.1007/s10586-020-03179-y</ext-link></mixed-citation></ref>
<ref id="ref-47"><label>46</label><mixed-citation>Guo, E., Gao, Y., Hu, C., &amp; Zhang, J. (2023). A hybrid PSO-DE intelligent algorithm for solving constrained optimization problems based on feasibility rules. Mathematics, 11(3), 522. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3390/math11030522">https://doi.org/10.3390/math11030522</ext-link></mixed-citation></ref>
<ref id="ref-48"><label>47</label><mixed-citation>Brezočnik, L., Fister, I., &amp; Podgorelec, V. (2018). Swarm intelligence algorithms for feature selection: A review. Applied sciences, 8(9), 1521. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3390/app8091521">https://doi.org/10.3390/app8091521</ext-link></mixed-citation></ref>
<ref id="ref-49"><label>48</label><mixed-citation>Ahmad, I. (2015). Feature selection using particle swarm optimization in intrusion detection. International journal of distributed sensor networks, 11(10), 806954. <ext-link ext-link-type="uri" xlink:href="http://dx.doi.org/10.1155/2015/806954">http://dx.doi.org/10.1155/2015/806954</ext-link></mixed-citation></ref>
<ref id="ref-50"><label>49</label><mixed-citation>Xue, B., Zhang, M., &amp; Browne, W. N. (2012). New fitness functions in binary particle swarm optimisation for feature selection. 2012 IEEE congress on evolutionary computation (pp. 1–8). IEEE. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/CEC.2012.6256617">https://doi.org/10.1109/CEC.2012.6256617</ext-link></mixed-citation></ref>
<ref id="ref-51"><label>50</label><mixed-citation>Tang, J., Liu, G., &amp; Pan, Q. (2021). A review on representative swarm intelligence algorithms for solving optimization problems: Applications and trends. IEEE/CAA journal of automatica Sinica, 8(10), 1627–1643. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/JAS.2021.1004129">https://doi.org/10.1109/JAS.2021.1004129</ext-link></mixed-citation></ref>
<ref id="ref-52"><label>51</label><mixed-citation>Esmin, A. A., Coelho, R. A., &amp; Matwin, S. (2015). A review on particle swarm optimization algorithm and its variants to clustering high-dimensional data. Artificial intelligence review, 44(1), 23–45. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/s10462-013-9400-4">https://doi.org/10.1007/s10462-013-9400-4</ext-link></mixed-citation></ref>
<ref id="ref-53"><label>52</label><mixed-citation>Rezaee Jordehi, A., &amp; Jasni, J. (2013). Parameter selection in particle swarm optimisation: A survey. Journal of experimental &amp; theoretical artificial intelligence, 25(4), 527–542. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1080/0952813X.2013.782348">https://doi.org/10.1080/0952813X.2013.782348</ext-link></mixed-citation></ref>
<ref id="ref-54"><label>53</label><mixed-citation>Nickabadi, A., Ebadzadeh, M. M., &amp; Safabakhsh, R. (2011). A novel particle swarm optimization algorithm with adaptive inertia weight. Applied soft computing, 11(4), 3658–3670. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.asoc.2011.01.037">https://doi.org/10.1016/j.asoc.2011.01.037</ext-link></mixed-citation></ref>
<ref id="ref-55"><label>54</label><mixed-citation>Sankaran, K. S., &amp; Kim, J. (2022). Efficient and optimized communication in biomedical sensor networks based on bioinspired particle swarm optimization for medical applications. Medical engineering &amp; physics, 110, 103922. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.medengphy.2022.103922">https://doi.org/10.1016/j.medengphy.2022.103922</ext-link></mixed-citation></ref>
<ref id="ref-56"><label>55</label><mixed-citation>Fan, H. (2002). A modification to particle swarm optimization algorithm. Engineering computations, 19(8), 970–989. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1108/02644400210450378">https://doi.org/10.1108/02644400210450378</ext-link></mixed-citation></ref>
<ref id="ref-57"><label>56</label><mixed-citation>Lessmann, S., Caserta, M., &amp; Arango, I. M. (2011). Tuning metaheuristics: A data mining based approach for particle swarm optimization. Expert systems with applications, 38(10), 12826–12838. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.eswa.2011.04.075">https://doi.org/10.1016/j.eswa.2011.04.075</ext-link></mixed-citation></ref>
<ref id="ref-58"><label>57</label><mixed-citation>Chawla, M., &amp; Duhan, M. (2014). Applications of recent metaheuristics optimisation algorithms in biomedical engineering: A review. International journal of biomedical engineering and technology, 16(3), 268–</mixed-citation></ref>
<ref id="ref-59"><label>278</label><mixed-citation><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1504/IJBET.2014.065807">https://doi.org/10.1504/IJBET.2014.065807</ext-link></mixed-citation></ref>
<ref id="ref-60"><label>58</label><mixed-citation>del Valle, Y., Venayagamoorthy, G. K., Mohagheghi, S., Hernandez, J. C., &amp; Harley, R. G. (2008). Particle swarm optimization: Basic concepts, variants and applications in power systems. IEEE transactions on evolutionary computation, 12(2), 171–195. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/TEVC.2007.896686">https://doi.org/10.1109/TEVC.2007.896686</ext-link></mixed-citation></ref>
<ref id="ref-61"><label>59</label><mixed-citation>Li, X., &amp; Engelbrecht, A. P. (2007). Particle swarm optimization: An introduction and its recent developments. Proceedings of the 9th annual conference companion on genetic and evolutionary computation (pp. 3391–3414). Association for Computing Machinery. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1145/1274000.1274118">https://doi.org/10.1145/1274000.1274118</ext-link></mixed-citation></ref>
<ref id="ref-62"><label>60</label><mixed-citation>Gang, M., Wei, Z., &amp; Xiaolin, C. (2012). A novel particle swarm optimization algorithm based on particle migration. Applied mathematics and computation, 218(11), 6620–6626. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.amc.2011.12.032">https://doi.org/10.1016/j.amc.2011.12.032</ext-link></mixed-citation></ref>
<ref id="ref-63"><label>61</label><mixed-citation>Ab Wahab, M. N., Nefti-Meziani, S., &amp; Atyabi, A. (2015). A comprehensive review of swarm optimization algorithms. PloS one, 10(5), e0122827. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1371/journal.pone.0122827">https://doi.org/10.1371/journal.pone.0122827</ext-link></mixed-citation></ref>
<ref id="ref-64"><label>62</label><mixed-citation>Azadifar, S., &amp; Ahmadi, A. (2021). A graph-based gene selection method for medical diagnosis problems using a many-objective PSO algorithm. BMC medical informatics and decision making, 21(1), 333. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1186/s12911-021-01696-3">https://doi.org/10.1186/s12911-021-01696-3</ext-link></mixed-citation></ref>
<ref id="ref-65"><label>63</label><mixed-citation>Thangamani, M., Satheesh, S., Lingisetty, R., Rajendran, S., &amp; Shivahare, B. D. (2025). Mathematical model for swarm optimization in multimodal biomedical images. In swarm optimization for biomedical applications (pp. 86–107). CRC Press. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1201/9781032713762">https://doi.org/10.1201/9781032713762</ext-link></mixed-citation></ref>
<ref id="ref-66"><label>64</label><mixed-citation>Kaur, S., Kumar, Y., Koul, A., &amp; Kumar Kamboj, S. (2023). A systematic review on metaheuristic optimization techniques for feature selections in disease diagnosis: Open issues and challenges. Archives of computational methods in engineering, 30(3), 1863–1895. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/s11831-022-09853-1">https://doi.org/10.1007/s11831-022-09853-1</ext-link></mixed-citation></ref>
<ref id="ref-67"><label>65</label><mixed-citation>Lalwani, S., Singhal, S., Kumar, R., &amp; Gupta, N. (2013). A comprehensive survey: Applications of multi-objective particle swarm optimization (MOPSO) algorithm. Transactions on combinatorics, 2(1), 39–101. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.22108/toc.2013.2834">https://doi.org/10.22108/toc.2013.2834</ext-link></mixed-citation></ref>
<ref id="ref-68"><label>66</label><mixed-citation>Agarwal, S., Rani, N., &amp; Vajpayee, A. (2024). Bioinspired algorithms: opportunities and challenges. In bio-inspired optimization for medical data mining (pp. 1–30). Wiley Online Library. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1002/9781394214211.ch1">https://doi.org/10.1002/9781394214211.ch1</ext-link></mixed-citation></ref>
<ref id="ref-69"><label>67</label><mixed-citation>Kaur, P., &amp; Singh, R. K. (2023). A review on optimization techniques for medical image analysis. Concurrency and computation: Practice and experience, 35(1), e7443. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1002/cpe.7443">https://doi.org/10.1002/cpe.7443</ext-link></mixed-citation></ref>
<ref id="ref-70"><label>68</label><mixed-citation>Kaur, S., &amp; Singh, J. (2023). Enhancing medical image analysis and disease surveillance in healthcare: A study on pso- aco optimization using swarm intelligence. 2023 2nd international conference on computational modelling, simulation and optimization (ICCMSO) (pp. 269–276). IEEE. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/ICCMSO59960.2023.00058">https://doi.org/10.1109/ICCMSO59960.2023.00058</ext-link></mixed-citation></ref>
<ref id="ref-71"><label>69</label><mixed-citation>Ul Haq, I. (2024). Diagnosis of neurological disease using bioinspired algorithms. In bio-inspired optimization for medical data mining (pp. 227–268). Wiley Online Library. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1002/9781394214211.ch12">https://doi.org/10.1002/9781394214211.ch12</ext-link></mixed-citation></ref>
<ref id="ref-72"><label>70</label><mixed-citation>Casson, C. L., John, S. A., &amp; Ferrall-Fairbanks, M. C. (2023). Mathematical modeling of cardio-oncology: Modeling the systemic effects of cancer therapeutics on the cardiovascular system. Seminars in cancer biology, 97, 30–41. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.semcancer.2023.11.004">https://doi.org/10.1016/j.semcancer.2023.11.004</ext-link></mixed-citation></ref>
<ref id="ref-73"><label>71</label><mixed-citation>Peto, M., García-Ávila, J., Rodriguez, C. A., Siller, H. R., da Silva, J. V. L., &amp; Ramírez-Cedillo, E. (2024). Review on structural optimization techniques for additively manufactured implantable medical devices. Frontiers in mechanical engineering, 10, 1353108. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3389/fmech.2024.1353108">https://doi.org/10.3389/fmech.2024.1353108</ext-link></mixed-citation></ref>
<ref id="ref-74"><label>72</label><mixed-citation>Candia, D. A., Játiva, P. P., Azurdia Meza, C., Sánchez, I., &amp; Ijaz, M. (2024). Performance analysis of the particle swarm optimization algorithm in a VLC system for localization in hospital environments. Applied sciences, 14(6), 2514. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3390/app14062514">https://doi.org/10.3390/app14062514</ext-link></mixed-citation></ref>
</ref-list></back>
</article>