Search Algorithm Research Articles

Comparative analysis of AI-based search algorithms in solving 8 puzzle problems

Abstract Background The 8-puzzle problem is a well-known combinatorial search problem, often used to test the effectiveness of various artificial intelligence (AI) algorithms. This study aims to evaluate the performance of three AI-based search algorithms—Breadth-First Search (BFS), Depth-First Search (DFS), and A* Search—in solving the 8-puzzle problem. The algorithms were implemented in Java, and their performance was measured in terms of solution length, the number of expanded nodes, and execution time. Results Experiments were conducted on eight randomly generated instances of the 8-puzzle problem. The findings reveal that both BFS and A* Search consistently identify optimal solutions in all cases. However, BFS was found to use more memory and operate slower than A* Search. Conversely, DFS demonstrated faster execution times and lower memory usage compared to BFS but was less reliable in finding optimal or feasible solutions. The study also explored the impact of different heuristic functions on the performance of A* Search. Among the heuristics tested, the Manhattan distance heuristic was determined to be the most effective, offering the best balance between accuracy and efficiency. Conclusions In conclusion, both BFS and A* Search are effective in finding optimal solutions, with A* Search being more efficient in terms of speed and memory usage. DFS, while faster and more memory-efficient, is less consistent in producing optimal solutions. The Manhattan distance heuristic significantly enhances the performance of A* Search, making it the preferred heuristic for the 8-puzzle problem. These results suggest that A* Search, particularly with the Manhattan distance heuristic, is a highly efficient choice for solving the 8-puzzle problem, especially in contexts where computational resources are limited.

Optimum solution of power flow problem based on search and rescue algorithm

AbstractIn order to solve the optimal power flow (OPF) problem, a unique algorithm based on a search and rescue method is applied in this study. For the OPF problem under three objective functions, the SAR offers a straightforward and reliable solution. The three objective functions are used to minimize the fuel cost, power loss and voltage deviation as a single objective function. The OPF problem for benchmark test system, including the IEEE-14 bus, IEEE-30 bus, and IEEE-57 bus, are solved by the Search and Rescue algorithm (SAR) under specific objective functions that are determined by the operational and economic performance indices of the power system. To demonstrate the efficacy and possibilities of the SAR algorithm, SAR is contrasted with alternative optimization techniques such as harmony search algorithm, gradient method, adaptive genetic algorithm, biogeography-based optimization, Artificial bee colony, gravitational search algorithm, particle swarm optimization, Jaya algorithm, enhanced genetic algorithm, modified shuffle frog leaping algorithm, practical swarm optimizer, Moth flam optimizer, whale and moth flam optimizer, grey wolf optimizer, cheap optimization algorithm and differential evolution algorithm. The value of minimum power losses based on SAR technique is equal to 0.459733441487247 MW for IEEE-14 bus. The value of minimum total fuel cost based on SAR technique is equal to 8051.12225602148 $/h for IEEE-14 bus. The value of minimum voltage deviation based on SAR technique is equal to 0.0357680148269292 for IEEE-14 bus. The value of minimum power losses based on SAR technique is equal to 2.71286428848434 MW for IEEE-30 bus. The value of minimum total fuel cost based on SAR technique is equal to 798.197578585806 $/h for IEEE-30 bus. The value of minimum voltage deviation based on SAR technique is equal to 0.0978069572088536 for IEEE-30 bus. The value of minimum total fuel cost based on SAR technique is equal to 38017.7691758245 $/h for IEEE-57 bus. The acquired results for the OPF compared to all competitor algorithms in every case of fitness function demonstrate the superiority of the SAR method.

Case Ascertainment in Pediatric Heart Failure Using International Classification of Disease Clinical Modification (ICD-CM) Codes.

Most epidemiological studies in pediatric heart failure (HF) use administrative database sources, defining patient cohorts by presence of a single HF ICD code. However, the ability of ICD codes to identify true HF patients is unknown in pediatrics.Here we describe the accuracy of HF ICD-10-CM code search algorithms, in identifying pediatric patients with HF from electronic data sources. Based on the adult HF literature, search algorithms were designed to incorporate HF ICD codes, imaging, and medications. Sensitivity, specificity, positive and negative predictive value and accuracy of the algorithms were tested among children in an advanced HF clinic ("Clinic cohort"). Top-performing algorithms were then tested in a large-scale regional electronic data warehouse (EDW), 01/2017 to 01/2020, generating the "EDW Cohort". False positive cases were identified and characterized by chart review. Within the Clinic Cohort, 78/378 patients (21%) had gold standard HF diagnoses. A search algorithm with one HF ICD coded visit was more sensitive but less specific than > 1 HF ICD coded visit, (sensitivity 94% and specificity 89% versus 69% and 97%, respectively). Correspondingly, > 1 ICD coded visit had a higher PPV than one ICD coded visit; 84% vs. 69%. Accuracy was similar (90% vs 91%). Presence of 1 HF ICD code combined with HF medication had high sensitivity, specificity, PPV, NPV and accuracy, all higher than the single ICD code algorithm. The "1 HF coded visit + any medication" algorithm resulted in highest accuracy (93%). Top-performing algorithms were tested in the EDW: the algorithm with > 1 HF ICD coded visit, and the algorithm with one HF ICD coded visit combined with HF medication. In the EDW Cohort, 133/248 (53.6%) patients had gold standard HF diagnoses though 115/248 (46.3%) were false positive cases; 41% of those had pulmonary over-circulation from congenital heart disease. Excluding children < 30days old and those with a history of an isolated VSD repair, complete AVSD repair, or PDA closure further reduced the proportion of false positives to 50/248 (20%). A search algorithm using a single HF ICD code can have acceptable sensitivity, specificity, PPV, NPV and accuracy in identifying children with HF from within electronic medical records. Similar to adult HF literature, specificity improves by including HF medication. When applied to large data sources, however, the search algorithms result in a high proportion of patients with pulmonary overcirculation related to congenital heart disease. To narrow the population to those with myocardial dysfunction, case identification may require use of ICD codes with linked of administrative, surgical, and/or imaging databases.

Enhancing Multilayer Glass Transmittance through Particle Swarm Optimization: An Experimental Approach

Abstract. This study focuses on enhancing the solar transmittance of multilayer glass in buildings located in cold northern regions to improve natural lighting efficiency and maintain indoor warmth in harsh climates. The Particle Swarm Optimization (PSO) algorithm is utilized to optimize the glass layer thickness, and an optical model is constructed to calculate the light transmittance of the multilayer glass. Through simulations and experimental analysis, the impact of different glass thickness combinations on overall transmittance is investigated. The study examines the optical properties of gradient glass and calculates changes in light transmittance under varying thickness combinations using MATLAB software. The PSO algorithm is applied for global optimization to identify the glass thickness combination that maximizes light transmittance within the specific visible light range (400nm-800nm). The experimental results, including spectral energy distribution before and after sunlight transmission, validate the accuracy of the theoretical model. The findings demonstrate that the optimized glass thickness combination significantly improves solar transmittance, especially within the visible light band, contributing to more energy-efficient and comfortable building environments in cold regions. Additionally, the potential of the PSO algorithm in global search and local convergence is analyzed, suggesting future research directions to further enhance optimization through dynamic adjustments or combining with other algorithms.

Polyak’s Method Based on the Stochastic Lyapunov Function for Justifying the Consistency of Estimates Produced by a Stochastic Approximation Search Algorithm under an Unknown-But-Bounded Noise

In 1976–1977, Polyak published in the journal Avtomatica i Telemekhanika (Automation and Remote Control) two remarkable papers on how to study the properties of estimates of iterative pseudogradient algorithms. The first paper published in 1976 considered the general case based on the stochastic Lyapunov function, and the second one considered the linear case. The assumptions formulated in these papers and the estimates obtained in them can still be considered the state-of-the art. In the current paper, Polyak’s approach is applied to the study of the properties of estimates of a (randomized) stochastic approximation search algorithm for the case of unknown-but-bounded noise in observations. The obtained asymptotic estimates were already known earlier, and exact estimates for a finite number of observations are published for the first time.

Harmony search algorithm to enhance approach to permutation flow shop scheduling problem

The permutation flow-shop scheduling problem (PFSP) is one of the widely analysed and investigated problems within the general field of scheduling, as its major focus is on the allocation and sequencing of a set of jobs across a set of machines in order to minimize the makespan or satisfy other criteria. This paper further generalizes the problem to the distributed permutation flow-shop scheduling problem (DPFSP), namely in a manufacturing system with multiple factories, where every factory employs identical machines; with the objective of achieving the least makespan at the worst factory in terms of processing time. We resolve the issue through a Harmony Search Algorithm (HSA), a metaheuristic model developed from the musical harmonisation concept, together with constraint programming techniques, including interval variables and non-adjacent constraints. The problemsolving algorithm incorporates a lower bound estimation heuristic for efficiently directing the search in the right possible solution zone. Performance evaluation on both the small benchmark and the large benchmark data set showed the ability of the HSA to perform the different assignment in various problem scenarios that include the different number of jobs, machines and factories to support them. Comparisons with the best-known values established the performance of the HSA algorithm in identifying high quality solutions for the PFSP in less computation time.

Design of a Gomoku AI Based on the Alpha-Beta Pruning Search Algorithm

Abstract. This paper presents the implementation of a Gomoku AI based on the alpha-beta pruning search algorithm and the Negamax algorithm. Gomoku, a traditional board game known for its strategic depth, poses significant challenges in AI development due to the exponential increase in possible moves. The AI leverages the computational efficiency of Alpha-Beta Pruning, which enhances the Negamax algorithm by reducing the number of nodes that need to be evaluated in the game tree. This combination allows for faster decision-making without compromising accuracy. Additionally, a value evaluation function is used to assess board states and guide the AI in selecting optimal moves. In the results the performance of the AI was tested through simulations, demonstrating great performance in move selection and computational efficiency compared to traditional methods. The paper also explores potential improvements, including the integration of reinforcement learning (RL) techniques to further enhance the AI's adaptability and strategic decision-making capabilities.

Semantic Web-Driven Targeted Adversarial Attack on Black Box Automatic Speech Recognition Systems

The susceptibility of Deep Neural Networks (DNNs) to adversarial attacks in Automatic Speech Recognition (ASR) systems has drawn significant attention. Most work focuses on white-box methods, but the assumption of full transparency of model architecture and parameters is unrealistic in real-world scenarios. Although several targeted black-box attack methods have been proposed in recent years, due to the complexity of ASR systems, they primarily rely on query-based approaches with limited search capabilities, leading to low success rates and noticeable noise. To address this, we propose DE-gradient, a new black-box approach using differential evolution (DE), a population-based search algorithm. Inspired by Semantic Web ideas, we introduce modulation noise to preserve semantic coherence while enhancing imperceptibility. In experiments on two public datasets, DE-gradient improved attack success rates by 19% and increased the signal-to-noise ratio (SNR) of silent parts from 27 dB to 54 dB, establishing a strong baseline for evaluating black-box adversarial attacks in ASR systems.

A Modified Simulated Annealing and Enhanced Harmony Search Algorithms for the Continuous Facility Layout Problem (CFLP)

This paper focuses on solving the Continuous Facility Layout Problem (CFLP), which aims to minimize material handling costs by strategically placing facilities in a known or unknown area. The objective is to find optimal or near-optimal facility arrangements while adhering to non-overlapping and spatial constraints, thus enhancing the efficiency of production systems. The study addresses various layout scenarios, including single-row facility layout (with and without clearance), continuous layout, and unequal-area facility layout problems. To achieve this, the authors propose a mixed-integer nonlinear programming (MINLP) model tailored for continuous layouts. Two meta-heuristic algorithms are developed to optimize this model: a hybrid Simulated Annealing-Genetic Algorithm (SA-GA), which leverages genetic crossover operations, and an Enhanced Harmony Search Algorithm (EHSA), featuring dynamic parameters and a novel improvisation technique. The proposed methods provide flexible and efficient solutions for both small and large-scale layout problems, offering decision-makers practical tools for real-world applications.

Reliability Analysis of High-Pressure Tunnel System Under Multiple Failure Modes Based on Improved Sparrow Search Algorithm–Kriging–Monte Carlo Simulation Method

It is often difficult for a structural safety design method based on deterministic analysis to fully and reasonably reflect the randomness of mechanical parameters, while the traditional reliability analysis method has a large calculation cost and low accuracy. In this paper, based on the seepage–stress coupling numerical model, the random variables affecting the reliability of the collaborative bearing of surrounding rock and lining structures are successfully identified. Then, the improved sparrow search algorithm (ISSA) is used to optimize the hyper-parameters of the Kriging surrogate model, in order to improve the computational efficiency and accuracy of the reliability analysis model. Finally, the ISSA-Kriging-MCS model is used to quantitatively evaluate the reliability of the surrounding rock-reinforced concrete lining structure under multiple failure modes, and the sensitivity of each random variable is discussed in depth. The results show that the high-pressure tunnel structure has high safety and reliability. The reliability indexes of each failure mode decrease with the increase in the coefficient of variation (COV) of random variables. In addition, the same random variable also exhibits varying degrees of influence in different failure modes.

Spectrum Sensing and Resource Allocation for Frequency Hopping Based CRN Using Hazelnut Tree Search Algorithm

This paper presents a novel spectrum sensing and resource allocation method for Cognitive Radio Networks (CRNs) using the Hazelnut Tree Search (HTS) algorithm in a frequency-hopping framework. CRNs enable secondary users (SUs) to utilize unused licensed spectrum without causing interference to primary users (PUs). The proposed Spectrum Sensing and Resource Allocation using Hazelnut Tree Search in CRN (SS-RA-HTS-CRN) method detects PU presence, prompting SUs to switch channels to avoid interference, guided by a designated guide node (GN). The HTS algorithm selects optimal sensing nodes and improves spectrum sensing, enhancing resource allocation reliability. Simulations in NS-3.26 show that SS-RA-HTS-CRN achieves delay reductions of 28.93%, 31.9%, and 22.45%, delivery ratio improvements of 28.21%, 17.41%, and 11.565%, and packet drop rate reductions of 35.4%, 44.3%, and 23.12% compared with Energy-Aware Resource Allocation with Backtracking Search Optimization (SS-RA-BSO-CRN), Spectrum Sensing with Hybrid Particle Swarm and Gravitational Search (SS-hybrid PSOGSA-CRN), and Spectrum Sensing using Modified Spider Monkey Optimization (SS-MSMO-CRN). The proposed SS-RA-HTS-CRN method significantly enhances efficiency, reliability, and adaptability in CRNs, making it a promising solution for dynamic spectrum management.

A UAV path planning method based on the framework of multi-objective jellyfish search algorithm.

Multi-constraint UAV path planning problems can be viewed as many-objective optimization problems that can be solved by meta-heuristic algorithms with good self-organizing optimization capabilities. However, such algorithms mostly use random initializing methods, resulting in low-quality initial paths that reduce the efficiency of subsequent algorithmic searches. Moreover, as the number of objective functions increases, meta-heuristic algorithms face inadequate selection pressure and convergence capability, which lead to poor solution. In order to address these issues, this paper proposes a UAV path planning method based on the framework of multi-objective jellyfish search algorithm (UMOJS). Firstly, an initializing strategy based on Rapidly-exploring Random Trees (RRT) is proposed to achieve higher quality initial paths. Secondly, a jellyfish updating strategy guided by the class-optimal individual is designed to enhance the convergence ability of the algorithm. Furthermore, a set of predefined reference points is imported to obtain Pareto optimal solutions with better convergence and distribution in many-objective optimization problems. To evaluate the superiority of the proposed UMOJS algorithm, three different difficulties of simulated flight environments are constructed to verify its performance. The experimental results show that UMOJS is not only able to gain more UAV paths with shorter length, but also more evenly distributed Pareto optimal solutions compared to five meta-heuristic algorithms when the constraint conditions are satisfied.

Artificial intelligence neural network and fuzzy modelling of unsteady Sisko trihybrid nanofluids for cancer therapy with entropy insights.

The main objective of the current endeavor is to monitor hypothetical processes utilizing a Sisko tri-hybrid fluid over a rotating disk with entropy generation suspended in Darcy-Forchheimer porous medium. Electro Magneto Hydro Dynamics (EMHD), non-linear thermal radiation and exponential and thermal- space dependent heat source/sink coefficients are considered with the intent of conceiving an Runge-Kutta-Fehlberg method with shooting procedures integrated with a combination of an Adaptive Neuro-Fuzzy Inference System (ANFIS) and Reptile Search Algorithm (RSA). Then, ANFIS-RSA, is used to predict the Nusselt number, skin friction co-efficient in radial and tangential velocities. Reliable self-similarity variables have reduced a non-linear partial differential set of equations into an ordinary differential equation. According to the empirical evidence, Sisko fluid parameter rises the radial velocity whereas for magnetic field and Darcy-Forchheimer the azimuthal and axial velocities visualizations decreasing trend, respectively. The entropy generation and Bejan number rises for electric and radiation effects. Also, ANFIS-RSA indicates that the model attained a high level of precision in terms of radial velocity (98.13%), tangential velocity (98.18%) and Nusselt number (98.91%). Thus, the longer rendering of the nanoparticles used here might, makes them potentially helpful for regulating the therapeutic impact in the management and treatment of cancer.

An Optimized Approach for Detection and Classification of Spam Email’s Using Ensemble Methods

AbstractSince the advent of email services, spam emails have been a major concern because users’ security depends on the classification of emails as ham or spam. It’s a malware attack that has been used for spear phishing, whaling, clone phishing, website forgery, and other harmful activities. However, various ensemble Machine Learning (ML) algorithms used for the detection and filtering of spam emails have been less explored. In this research, we offer a ML-based optimized algorithm for detecting spam emails that have been enhanced using Hyper-parameter tuning approaches. The proposed approach uses two feature extraction modules, namely Count-Vectorizer and TFIDF-Vectorizer that provide the most effective classification results when we apply them to three different publicly available email data sets: Ling Spam, UCI SMS Spam, and the Proposed dataset. Moreover, to extend the performance of classifiers we used various ML methods such as Naive Bayes (NB), Logistic Regression (LR), Extra Tree, Stochastic Gradient Descent (SGD), XG-Boost, Support Vector Machine (SVM), Random Forest (RF), Multi-layer Perception (MLP), and parameter optimization approaches such as Manual search, Random search, Grid search, and Genetic algorithm. For all three data sets, the SGD outperformed other algorithms. All of the other ensembles (Extra Tree, RF), linear models (LR, Linear-SVC), and MLP performed admirably, with relatively high precision, recall, accuracies, and F1-score.

Research on Path Planning of Agricultural UAV Based on Improved Deep Reinforcement Learning

Traditional manual or semi-mechanized pesticide spraying methods often suffer from issues such as redundant coverage and cumbersome operational steps, which fail to meet current pest and disease control requirements. Therefore, there is an urgent need to develop an efficient pest control technology system. This paper builds upon the Deep Q-Network algorithm by integrating the Bi-directional Long Short-Term Memory structure to propose the BL-DQN algorithm. Based on this, a path planning framework for pest and disease control using agricultural drones is designed. This framework comprises four modules: remote sensing image acquisition via the Google Earth platform, task area segmentation using a deep learning U-Net model, rasterized environmental map creation, and coverage path planning. The goal is to enhance the efficiency and safety of pesticide application by drones in complex agricultural environments. Through simulation experiments, the BL-DQN algorithm achieved a 41.68% improvement in coverage compared with the traditional DQN algorithm. The repeat coverage rate for BL-DQN was 5.56%, which is lower than the 9.78% achieved by the DQN algorithm and the 31.29% of the Depth-First Search (DFS) algorithm. Additionally, the number of steps required by BL-DQN was only 80.1% of that of the DFS algorithm. In terms of target point guidance, the BL-DQN algorithm also outperformed both DQN and DFS, demonstrating superior performance.

Internet image search outputs propagate climate change sentiment and impact policy support

AbstractA critical step in tackling climate change involves structural, system-level changes facilitating action. Despite their ubiquity, little is known about how internet search algorithms portray climate change, and how these portrayals impact concern and action. In a sample of 49 countries, we found that nationwide climate concern, but not nation-level climate impact, predicted the emotional arousal caused by climate change Google Image Search outputs, as rated by a naive sample (n = 383). In a follow-up experiment we randomly assigned another sample (n = 899) to receive the climate change image outputs resulting from searches conducted in countries high or low in pre-existing climate concern, and found that participants exposed to images from countries with high pre-existing concern (compared to low) became more concerned about climate change, supportive of climate policy and likely to act pro-environmentally, suggesting a cycle of climate sentiment propagation systemically facilitated by internet search algorithms. We discuss the implications of these findings for climate action interventions.

Automatic face detection based on bidirectional recurrent neural network optimized by improved Ebola optimization search algorithm.

Face detection is a multidisciplinary research subject that employs fundamental computer algorithms, image processing, and patterning. Neural networks, on the other hand, have been widely developed to solve challenges in the domains of feature extraction, pattern detection, and the like in general. The presented study investigates the DNN (deep neural networks) use in the creation of facial detection operating systems. In this study, a novel optimized deep network has been presented to face detection. In this paper, after using some preprocessing stages for contrast enhancement and increasing the data number for the next deep tool, they fed to a bidirectional recurrent neural network (BRNN). The network is optimized via a novel enhanced version of Ebola optimization algorithm to provide far greater accuracy. The suggested procedure is examined on GTFD (Georgia Tech Face Database) and the results indicate that the proposed technique significantly outperforms other comparative methods, attaining an accuracy of 94.3%, a precision of 93.51%, a recall of 94.53%, and an F1-score of 92.47%. Furthermore, the method exhibits resilience against various challenges, achieving an accuracy of 95.6% under occlusions, 96.3% under lighting variations, 94.8% under pose variations, and 92.4% under low resolution conditions. Simulation results depict that the suggested technique gives far greater accuracy in comparison with the other comparative approaches.

Comparative analysis of direct search methods for material design optimization

This paper contributes to the field of optimization for periodic composite material design by systematically evaluating the performance of four direct search algorithms: greedy, simulated annealing (SA), genetic algorithms (GA), and particle swarm optimization (PSO). The central goal is to determine the optimal arrangement of two material domains inside a representative volume element (RVE) while respecting the constraint that half volume of the domains is composed of a specific material, with the effective shear modulus as the objective function. The main contribution of this work is the detailed comparison of these algorithms in terms of success rates and computational efficiency, providing critical insights into their suitability for different problem scales. For a small-scale problem (16 cells), PSO achieves a 100% success rate, while SA demonstrates over 90% success but at a higher computational cost. The greedy algorithm, despite its simplicity, achieves a 72% success rate with the lowest computational effort, requiring an average of 256 objective function evaluations. GA, however, exhibits the lowest success rate at 52% and requires the highest average number of evaluations (5003.2). Furthermore, the paper extends the analysis to a more complex problem (36 cells), where the adaptability and efficiency of the algorithms are tested. This investigation highlights the trade-offs between algorithmic complexity, success rate, and computational cost, offering practical guidelines for selecting suitable optimization methods based on problem size and characteristics.

Definitional Challenges in Understanding Hypertrophic Cardiomyopathy

Hypertrophic cardiomyopathy (HCM) is the most common hereditary cardiomyopathy. It is often caused by mutations of genes encoding for sarcomeric or sarcomere-associated proteins. Despite its clinical importance, divergent definitions are published by major cardiology societies. Some regard HCM as a specific genetic disease, whereas others define it as a broad ‘spectrum of the thick heart’. The present narrative review aimed to assess both definitions from a pathoanatomical perspective. As a conjoint interdisciplinary and translational approach is needed to further increase knowledge and improve the understanding of HCM, the PubMed database was searched using several advanced search algorithms to explore the perspectives of the (forensic) pathologist, clinician, and basic researcher regarding the difference between the definitions of HCM. This discrepancy between definitions can impact critical data, such as prevalence and mortality rate, and complicate the understanding of the disease. For example, due to the different definitions, research findings regarding molecular changes from studies applying the narrow definition cannot be simply extended to the ‘spectrum’ of HCM.

Multi-Objective Optimization of Three-Stage Turbomachine Rotor Based on Complex Transfer Matrix Method

This study presents the complex transfer matrix method (CTMM) as an advanced mathematical model, providing significant advantages over the finite element method (FEM) by yielding rapid solutions for complex optimization problems. In order to design a more efficient structure of a three-stage turbomachine rotor, we integrated this method with various optimization algorithms, including genetic algorithm (GA), differential evolution (DE), simulated annealing (SA), gravitational search algorithm (GSA), black hole (BH), particle swarm optimization (PSO), Harris hawk optimization (HHO), artificial bee colony (ABC), and non-metaheuristic pattern search (PS). Thus, the best rotor geometry can be obtained fast with minimum bearing forces and disk deflections within design limits. In the results, the efficiency of the CTMM for achieving optimized designs is demonstrated. The CTMM outperformed the FEM in both speed and applicability for complex rotordynamic problems. The CTMM was found to deliver results of comparable quality much faster than the FEM, especially with higher element quality. The use of the CTMM in the iterative optimization process is shown to be highly advantageous. Furthermore, it is noted that among the different optimization algorithms, ABC provided the best results for this multi-objective optimization problem.