Search Results (1,887)

The Growth Optimizer algorithm (GO) is a novel metaheuristic that draws inspiration from people’s learning and introspection processes as they progress through society. Economic Load Dispatch (ELD), one of the primary problems in the power system, is resolved by the GO. To assess GO’s dependability, its performance is contrasted with a number of methods. These techniques include the Rime-ice algorithm (RIME), Grey Wolf Optimizer (GWO), Elephant Herding Optimization (EHO), and Tunicate Swarm Algorithm (TSA). Also, the GO algorithm has the competition of other literature techniques such as Monarch butterfly optimization (MBO), the Sine Cosine algorithm (SCA), the chimp optimization algorithm (ChOA), the moth search algorithm (MSA), and the snow ablation algorithm (SAO). Six units for the ELD problem at a 1000 MW load, ten units for the ELD problem at a 2000 MW load, and twenty units for the ELD problem at a 3000 MW load are the cases employed in this work. The standard deviation, minimum fitness function, and maximum mean values are measured for 30 different runs in order to evaluate all methods. Using the GO approach, the ideal power mismatch values of 3.82627263206814 × 10⁻¹², 0.0000622209480241054, and 5.5893360695336 × 10⁻⁷ were found for six, ten, and twenty generator units, respectively. The GO’s dominance over all other algorithms is demonstrated by the results produced for the ELD scenarios. Full article

The increasing adoption of plug-in electric vehicles (PEVs) leads to negative impacts on distribution network efficiency due to the extra load added to the system. To overcome this problem, this manuscript aims to optimally integrate distributed generators (DGs) in radial distribution networks (RDNs), while including uncoordinated charging of PEVs added to the basic daily load curve with different load models. The main objectives are minimizing the network’s daily energy losses, improving the daily voltage profile, and enhancing voltage stability considering various constraints like power balance, buses’ voltages, and line flow. These objectives are combined using weighting factors to formulate a weighted sum multi-objective function (MOF). A very recent metaheuristic approach, namely the Walrus optimization algorithm (WO), is addressed to identify the DGs’ best locations and sizes that achieve the lowest value of MOF, without violating different constraints. The proposed optimization model along with a repetitive backward/forward load flow (BFLF) method are simulated using MATLAB 2016a software. The WO-based optimization model is applied to IEEE 33-bus, 69-bus, and a real system in El-Shourok City-district number 8 (ShC-D8), Egypt. The simulation results show that the proposed optimization method significantly enhanced the performance of RDNs incorporated with PEVs in all aspects. Moreover, the proposed WO approach proved its superiority and efficiency in getting high-quality solutions for DGs’ locations and ratings, compared to other programmed algorithms. Full article

Electric vehicles worldwide provide numerous key advantages in the energy sector. They are advantageous over fossil fuel vehicles in many aspects: for example, they consume no fuel, are economical, and only require charging the internal batteries, which power the motor for propulsion. Thus, due to their numerous advantages, research is necessary to improve the technological aspects that can enhance electric vehicles’ overall performance and efficiency. However, electric vehicle charging stations are the key hindrance to their adoption. Charging stations will affect grid stability and may lead to altering different parameters, e.g., power losses and voltage deviation when integrated randomly into the distribution system. The distributed generation, along with charging stations with the best location and size, can be a solution that mitigates the above concerns. Metaheuristic techniques can be used to find the optimal siting and sizing of distributed generations and electric vehicle charging stations. This review provides an exhaustive review of various methods and scientific research previously undertaken to optimize the placement and dimensions of electric vehicle charging stations and distributed generation. We summarize the previous work undertaken over the last five years on the multi-objective placement of distributed generations and electric vehicle charging stations. Key areas have focused on optimization techniques, technical parameters, IEEE networks, simulation tools, distributed generation types, and objective functions. Future development trends and current research have been extensively explored, along with potential future advancement and gaps in knowledge. Therefore, at the conclusion of this review, the optimization of electric vehicle charging stations and distributed generation presents both the practical and theoretical importance of implementing metaheuristic algorithms in real-world scenarios. In the same way, their practical integration will provide the transportation system with a robust and sustainable solution. Full article

Nowadays, metaheuristic algorithms have been applied to optimize last lower-surface models. Also, the last lower-surface model has been adjusted through the computational algorithms to perform custom shoe lasts. Therefore, it is necessary to implement nature-inspired metaheuristic algorithms to perform the adjustment of last lower-surface model to the footprint topography. In this study, a metaheuristic genetic algorithm is implemented to adjust the last lower surface model to the footprint topography. The genetic algorithm is constructed through an objective function, which is defined through the last lower Bezier model and footprint topography, where a mean error function moves the last lower surface toward the footprint topography through the initial population. Also, the search space is deduced from the last lower surface and footprint topography. In this way, the genetic algorithm performs explorations and exploitations to optimize a Bezier surface model, which generates the adjusted last lower surface, where the surface is recovered via laser line scanning. Thus, the metaheuristic algorithm enhances the last lower-surface adjustment to improve the custom last manufacture. This contribution is elucidated by a discussion based on the proposed metaheuristic algorithm for surface model adjustment and the optimization methods implemented in recent years. Full article

With the increasing demand for expected data volume daily, current telecommunications infrastructure can not meet requirements without using enhanced technologies adopted by 5G and beyond networks. Due to their diverse features, 5G technologies and services will be phenomenal in the coming days. Proper planning procedures are to be adopted to provide cost-effective and quality telecommunication services. In this paper, we planned 5G network deployment in two frequency ranges, 3.5 GHz and 28 GHz, using a mixed cell structure. We used metaheuristic approaches such as Grey Wolf Optimization (GWO), Sparrow Search Algorithm (SSA), Whale Optimization Algorithm (WOA), Marine Predator Algorithm (MPA), Particle Swarm Optimization (PSO), and Ant Lion Optimization (ALO) for optimizing the locations of remote radio units. The comparative analysis of metaheuristic algorithms shows that the proposed network is efficient in providing an average data rate of 50 Mbps, can meet the coverage requirements of at least 98%, and meets quality-of-service requirements. We carried out the case study for an urban area and another suburban area of Kathmandu Valley, Nepal. We analyzed the outcomes of 5G greenfield deployment and 5G deployment using existing 4G infrastructure. Deploying 5G networks using existing 4G infrastructure, resources can be saved up to 33.7% and 54.2% in urban and suburban areas, respectively. Full article

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. Full article

The focus of this study is to introduce a hybrid predictive framework encompassing different meta-heuristic optimization and machine learning techniques to identify the regions susceptible to snow avalanches. To accomplish this aim, the present research sought to acquire the best-performed model among nine different hybrid scenarios encompassing three different meta-heuristics, namely particle swarm optimization (PSO), gravitational search algorithm (GSA), and Cuckoo Search (CS), and three different ML approaches, i.e., support vector classification (SVC), stochastic gradient boosting (SGB), and k-nearest neighbors (KNN), pertaining to different predictive families. According to diligent analysis performed with regard to the blinded testing set, the PSO-SGB illustrated the most satisfactory predictive performance with an accuracy of 0.815, while the precision and recall were found to be 0.824 and 0.821, respectively. The F1-score of the predictions was found to be 0.821, and the area under the receiver operating curve (AUC) was obtained to be 0.9. Despite attaining similar predictive success via the CS-SGB model, the time-efficiency analysis underscored the PSO-SGB, as the corresponding process consumed considerably less computational time compared to its counterpart. The SHapley Additive exPlanations (SHAP) implementation further informed that slope, elevation, and wind speed are the most contributing attributes to detecting snow avalanche susceptibility in the French Alps. Full article

When using point cloud technology to measure the dimension and geometric error of aircraft landing gear components, the point cloud data obtained after scanning may have certain differences because of the sophistication and diversity of the components that make up the landing gear. However, when using traditional point cloud registration algorithms, if the initial pose between point clouds is poor, it can lead to significant errors in the final registration results or even registration failure. Furthermore, the significant difference in registration results between point clouds can affect the final measurement results. Adopting Teaching-Learning-Based Optimization (TLBO) to solve some optimization problems has unique advantages such as high accuracy and good stability. This study integrates TLBO with point cloud registration. To increase the probability of using TLBO for point cloud registration to search for the global optimal solution, adaptive learning weights are first introduced during the learner phase of the basic TLBO. Secondly, an additional tutoring phase has been designed based on the symmetry and unimodality of the normal distribution to improve the accuracy of the solution results. In order to evaluate the performance of the proposed algorithm, it was first used to solve the CEC2017 test function. The comparison results with other metaheuristics showed that the improved TLBO has excellent comprehensive performance. Then, registration experiments were conducted using the open point cloud dataset and the landing gear point cloud dataset, respectively. The registration results showed that the point cloud registration method proposed in this paper has strong competitiveness. Full article

In the field of Unmanned Aerial Vehicle (UAV) path planning, designing efficient, safe, and feasible trajectories in complex, dynamic environments poses substantial challenges. Traditional optimization methods often struggle to address the multidimensional nature of these problems, particularly when considering constraints like obstacle avoidance, energy efficiency, and real-time responsiveness. In this paper, we propose a novel algorithm, Dimensional Learning Strategy and Spherical Motion-based Particle Swarm Optimization (DLS-SMPSO), specifically designed to handle the unique constraints and requirements of cooperative path planning for Multiple UAVs (Multi-UAVs). By encoding particle positions as motion paths in spherical coordinates, the algorithm offers a natural and effective approach to navigating multidimensional search spaces. The incorporation of a Dimensional Learning Strategy (DLS) enhances performance by minimizing particle oscillations and allowing each particle to learn valuable information from the global best solution on a dimension-by-dimension basis. Extensive simulations validate the effectiveness of the DLS-SMPSO algorithm, demonstrating its capability to consistently generate optimal paths. The proposed algorithm outperforms other metaheuristic optimization algorithms, achieving a feasibility ratio as high as 97%. The proposed solution is scalable, adaptable, and suitable for real-time implementation, making it an excellent choice for a broad range of cooperative multi-UAV applications. Full article

To address the limitations of traditional optimization methods in achieving high accuracy in high-dimensional problems, this paper introduces the snow leopard optimization (SLO) algorithm. SLO is a novel meta-heuristic approach inspired by the territorial behaviors of snow leopards. By emulating strategies such as territory delineation, neighborhood relocation, and dispute mechanisms, SLO achieves a balance between exploration and exploitation, to navigate vast and complex search spaces. The algorithm’s performance was evaluated using the CEC2017 benchmark and high-dimensional genetic data feature selection tasks, demonstrating SLO’s competitive advantage in solving high-dimensional optimization problems. In the CEC2017 experiments, SLO ranked first in the Friedman test, outperforming several well-known algorithms, including ETBBPSO, ARBBPSO, HCOA, AVOA, WOA, SSA, and HHO. The effective application of SLO in high-dimensional genetic data feature selection further highlights its adaptability and practical utility, marking significant progress in the field of high-dimensional optimization and feature selection. Full article

Metaheuristic algorithms (MAs) now are the standard in engineering optimization. Progress in computing power has favored the development of new MAs and improved versions of existing methods and hybrid MAs. However, most MAs (especially hybrid algorithms) have very complicated formulations. The present study demonstrated that it is possible to build a very simple hybrid metaheuristic algorithm combining basic versions of classical MAs, and including very simple modifications in the optimization formulation to maximize computational efficiency. The very simple hybrid metaheuristic algorithm (SHGWJA) developed here combines two classical optimization methods, namely the grey wolf optimizer (GWO) and JAYA, that are widely used in engineering problems and continue to attract the attention of the scientific community. SHGWJA overcame the limitations of GWO and JAYA in the exploitation phase using simple elitist strategies. The proposed SHGWJA was tested very successfully in seven “real-world” engineering optimization problems taken from various fields, such as civil engineering, aeronautical engineering, mechanical engineering (included in the CEC 2020 test suite on real-world constrained optimization problems) and robotics; these problems include up to 14 optimization variables and 721 nonlinear constraints. Two representative mathematical optimization problems (i.e., Rosenbrock and Rastrigin functions) including up to 1000 variables were also solved. Remarkably, SHGWJA always outperformed or was very competitive with other state-of-the-art MAs, including CEC competition winners and high-performance methods in all test cases. In fact, SHGWJA always found the global optimum or a best cost at most 0.0121% larger than the target optimum. Furthermore, SHGWJA was very robust: (i) in most cases, SHGWJA obtained a 0 or near-0 standard deviation and all optimization runs practically converged to the target optimum solution; (ii) standard deviation on optimized cost was at most 0.0876% of the best design; (iii) the standard deviation on function evaluations was at most 35% of the average computational cost. Last, SHGWJA always ranked 1st or 2nd for average computational speed and its fastest optimization runs outperformed or were highly competitive with their counterpart recorded for the best MAs. Full article

The Electric Fish Optimization (EFO) algorithm is inspired by the predation behavior and communication of weak electric fish. It is a novel meta-heuristic algorithm that attracts researchers because it has few tunable parameters, high robustness, and strong global search capabilities. Nevertheless, when operating in complex environments, the EFO algorithm encounters several challenges including premature convergence, susceptibility to local optima, and issues related to passive electric field localization stagnation. To address these challenges, this study introduces Adaptive Electric Fish Optimization Algorithm Based on Standstill Label and Level Flight (SLLF-EFO). This hybrid approach incorporates the Golden Sine Algorithm and good point set theory to augment the EFO algorithm’s capabilities, employs a variable-step-size Levy flight strategy to efficiently address passive electric field localization stagnation problems, and utilizes a standstill label strategy to mitigate the algorithm’s tendency to fall into local optima during the iterative process. By leveraging multiple solutions to optimize the EFO algorithm, this framework enhances its adaptability in complex environments. Experimental results from benchmark functions reveal that the proposed SLLF-EFO algorithm exhibits improved performance in complex settings, demonstrating enhanced search speed and optimization accuracy. This comprehensive optimization not only enhances the robustness and reliability of the EFO algorithm but also provides valuable insights for its future applications. Full article

The artificial bee colony (ABC) algorithm is a famous swarm intelligence method utilized across various disciplines due to its robustness. However, it exhibits limitations in exploration mechanisms, particularly in high-dimensional or complex landscapes. This article introduces the adaptive exploration artificial bee colony (AEABC), a novel variant that reinspires the ABC algorithm based on real-world phenomena. AEABC incorporates new distance-based parameters and mechanisms to correct the original design, enhancing its robustness. The performance of AEABC was evaluated against 33 state-of-the-art metaheuristics across twenty-five benchmark functions and an engineering application. AEABC consistently outperformed its counterparts, demonstrating superior efficiency and accuracy. In a variable-sized problem (n = 10), the traditional ABC algorithm converged to 3.086 × 10⁶, while AEABC achieved a convergence of 2.0596 × 10⁻²⁵⁵, highlighting its robust performance. By addressing the shortcomings of the traditional ABC algorithm, AEABC significantly advances mathematical optimization, especially in engineering applications. This work underscores the significance of the inspiration of the traditional ABC algorithm in enhancing the capabilities of swarm intelligence. Full article

This paper presents numerical works on estimating some logistic models using particle swarm optimization (PSO). The considered models are the Verhulst model, Pearl and Reed generalization model, von Bertalanffy model, Richards model, Gompertz model, hyper-Gompertz model, Blumberg model, Turner et al. model, and Tsoularis model. We employ data on commercial and rural banking assets in Indonesia due to their tendency to correspond with logistic growth. Most banking asset forecasting uses statistical methods concentrating solely on short-term data forecasting. In banking asset forecasting, deterministic models are seldom employed, despite their capacity to predict data behavior for an extended time. Consequently, this paper employs logistic model forecasting. To improve the speed of the algorithm execution, we use the Cauchy criterion as one of the stopping criteria. For choosing the best model out of the nine models, we analyze several considerations such as the mean absolute percentage error, the root mean squared error, and the value of the carrying capacity in determining which models can be unselected. Consequently, we obtain the best-fitted model for each commercial and rural bank. We evaluate the performance of PSO against another metaheuristic algorithm known as spiral optimization for benchmarking purposes. We assess the robustness of the algorithm employing the Taguchi method. Ultimately, we present a novel logistic model which is a generalization of the existence model. We evaluate its parameters and compare the result with the best-obtained model. Full article