Metaheuristic Algorithms Research Articles

Optimizing sheep growth curves using a meta-heuristic algorithm.

Sheep were among the first animals domesticated by humans, and to this day, small ruminants are primarily raised for their meat, milk, and wool. This study evaluated the goodness of fit for growth curve models using observed age and weight data from crossbred lambs of various breeds based on the mean values between paired breeds. We employed a hybrid metaheuristic algorithm, combining a simulated annealing (SA) algorithm and a genetic algorithm (GA) called SAGAC, to determine the optimal parameter values for growth models, ensuring the best alignment between simulated and observed curves. The goodness of fit and model accuracy was assessed using the coefficient of determination (R2), Mean Absolute Error (MAE), Root Mean Square Error (RMSE), and Mean Absolute Percentage Error (MAPE). Errors were measured by comparing the criteria differences between simulated and observed data. Thirty crossbreed combinations were simulated, considering the average weight. Analysis of the observed and simulated growth curves indicated that specific crossbreeding scenarios produced promising results. This simulation approach is believed to assist geneticists in predicting potential crossbreeding outcomes, thereby saving time and financial resources in field research.

An integrated binary metaheuristic approach in dynamic unit commitment and economic emission dispatch for hybrid energy systems

The current generation portfolio is obligated to incorporate zero-emissions energy sources, predominantly wind and solar, due to the depletion of fossil fuels and the alarming rate of global warming. In the current scenario, power engineers must devise a compromised solution that not only advocates for the adoption of renewable energy sources (RES) but also efficiently schedules all conventional power generation units to balance the increasing load demand while simultaneously minimizing fuel costs and harmful emissions that are currently addressed by Unit Commitment (UC) and Combined Economic Emission Dispatch (CEED) problem solutions. However, the integration of renewable energy resources (RES) further complicates the UC-CEED problem due to their intermittent nature. Recently, metaheuristic algorithms are acquiring momentum in resolving constrained UC-CEED problems due to their improved global solution ability, adaptability, and derivative-free construction. In this research, a computationally efficient binary hybrid version of crow search algorithm and improvised grey wolf optimization is proposed, namely Crow Search Improved Binary Grey Wolf Optimization Algorithm (CS-BIGWO) by inclusion of nonlinear control parameter, weight-based position updating, and mutation approach. Statistical results on standard mathematical functions prove the supremacy of the proposed algorithm over conventional algorithms. Further, a novel optimization strategy is devised by integrating enhanced lambda iteration with the CS-BIGWO algorithm (CS-BIGWO-λ\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\lambda$$\\end{document}) to solve a day-ahead UC-CEED problem of the hybrid energy system incorporating cost functions of RES. For the model, a day-ahead forecast of wind power and solar photovoltaic power is obtained by using the Levy-Flight Chaotic Whale Optimization Algorithm optimized Extreme Learning Machines(LCWOA-ELM). The proposed algorithm is tested for the UC-CEED solution of an IEEE-39 bus system with two distinct cases: (1) without RES integration and (2) with RES integration. Several independent trial runs are executed, and the performance of the algorithms is assessed based on optimal UC schedules, fuel cost, emission quantization, convergence curve, and computational time. For case 1, the proposed algorithm resulted in a percentage reduction of 0.1021% in fuel cost and 0.7995% in emission. In contrast, for test case 2, it resulted in a percentage reduction of 0.12896% in fuel cost and 0.772% in emission with the proposed algorithm. The results validate the dominance of the proposed methodology over existing methods in terms of lower fuel costs and emissions.

Forecasting urban water demand using different hybrid-based metaheuristic algorithms’ inspire for extracting artificial neural network hyperparameters

This research offers a novel methodology for quantifying water needs by assessing weather variables, applying a combination of data preprocessing approaches, and an artificial neural network (ANN) that integrates using a genetic algorithm enabled particle swarm optimisation (PSOGA) algorithm. The PSOGA performance was compared with different hybrid-based metaheuristic algorithms’ behaviour, modified PSO, and PSO as benchmarking techniques. Based on the findings, it is possible to enhance the standard of initial data and select optimal predictions that drive urban water demand through effective data processing. Each model performed adequately in simulating the fundamental dynamics of monthly urban water demand as it relates to meteorological variables, proving that they were all successful. Statistical fitness measures showed that PSOGA-ANN outperformed competing algorithms.

Reducing ACO Population Size to Increase Computational Speed

Ant Colony Optimization (ACO) is a powerful metaheuristic algorithm widely used to solve complex optimization problems in production and logistics. This paper presents a methodology for enhancing the ACO performance when applied to Traveling Salesman Problems (TSP). By reducing the number of ants in the colony, the algorithm's computational speed improves but solution quality is sacrificed. An optimal number of ants to produce the best results in the shortest time is specific to the problem at hand and can't be defined generally. This paper investigates the effect of ant population reduction relative to the problem size by measuring its impact on solution quality and execution time. Results show that for certain problem sizes ant population and execution time can be halved with practically no reduction in solution quality, or they can be reduced 5 times at the price of slightly worse solution quality. Reduction of ant population is much more impactful on reduction of execution time than it is on solution quality.

Leveraging metaheuristic algorithms with improved hybrid prediction model framework for enhancing surface roughness optimization in CNC turning AISI 316

Leveraging metaheuristic algorithms with improved hybrid prediction model framework for enhancing surface roughness optimization in CNC turning AISI 316

Inverse Kinematics of Robotic Manipulators Based on Hybrid Differential Evolution and Jacobian Pseudoinverse Approach

Robot manipulators play a critical role in several industrial applications by providing high precision and accuracy. To perform these tasks, manipulator robots require the effective computation of inverse kinematics. Conventional methods to solve IK often encounter significant challenges, such as singularities, non-linear equations, and poor generalization across different robotic configurations. In this work, we propose a novel approach to solve the inverse kinematics (IK) problem in robotic manipulators using a metaheuristic algorithm enhanced with a Jacobian step. Our method overcomes those limitations by selectively applying the Jacobian step to the differential evolution (DE) algorithm. The effectiveness and versatility of the proposed approach are demonstrated through simulations and real-world experimentation on a 5 DOF KUKA robotic arm.

AnFiS-MoH: Systematic exploration of hybrid ANFIS frameworks via metaheuristic optimization hybridization with evolutionary and swarm-based algorithms

The adaptive neuro-fuzzy inference system (ANFIS) has shown promising performance in modeling nonlinear problems, leveraging the strengths of both neural networks and fuzzy inference systems. However, as the problem scale increases, the growing number of tunable parameters in ANFIS can make it challenging to optimize via traditional gradient-based methods alone. This study introduces AnFiS-MoH, a novel framework that synergistically integrates ANFIS with metaheuristic optimization algorithms to address these challenges. By leveraging the global search capabilities of metaheuristics such as ant colony optimization (ACO), particle swarm optimization (PSO), genetic algorithm (GA), and simulated annealing (SA), ANFIS-MOH enhances the parameter tuning process of ANFIS models. We evaluate ANFIS-MOH on benchmark datasets including Boston Housing and Wine Quality, demonstrating significant improvements in prediction accuracy and generalization compared to traditional ANFIS and neural network approaches. The proposed framework achieves up to 20% reduction in Mean Squared Error and 15% increase in R2 scores, particularly excelling in handling high-dimensional, noisy data. This work contributes to the field of hybrid intelligent systems by introducing effective ways to combine the strengths of ANFIS with powerful metaheuristic optimization algorithms. The findings suggest that such hybrid approaches can be effective in tackling challenging nonlinear modeling problems. Our code is available at https://github.com/AmbitYuki/Metaheuristic-Adaptive-ANFIS.

Socio-Economical Analysis of a Green Reverse Logistics Network under Uncertainty: A Case Study of Hospital Constructions

This study addresses the critical issue of managing construction and demolition waste in urban environments. Effective waste management is not only essential for minimizing costs but also for enhancing sustainability and reducing environmental impact. In this context, the research introduces a green reverse logistics model designed for C&D waste management, integrating both sustainability considerations and current regulatory frameworks, such as LEED. A key innovation of this model is the incorporation of electric vehicles for waste collection, compared to traditional diesel vehicles, as part of the logistical process, as carbon emission is a significant concern. By evaluating the limitations and opportunities associated with electric vehicles, alongside robust optimization to manage uncertainties in waste collection, the model seeks to balance environmental, social, and economic objectives. It further incorporates decision-making tools like fuzzy logic to optimize multi-objective outcomes across various waste facilities, including separation labs, incineration centers, recycling centers, and landfills. A case study conducted in Tehran validates the model, highlighting the socio-economic and environmental benefits of using electric vehicles in waste collection. Sensitivity analysis indicates that hybrid and socially focused policies perform best under high-impact scenarios, although results can differ with varying data sets. Despite the complexity of managing reverse logistics networks, this research provides valuable insights for supply chain planners. It suggests potential future directions, such as the application of metaheuristic algorithms and improved stochastic planning methods.

How to optimize government R&D budget allocation? A review of recent studies and research gaps

Purpose Research and Development (R&D) activities are important for technological innovation and present opportunities for entrepreneurship. These activities depend on the flow of funding. This paper aims to review approaches used in R&D project selection and budget allocation. Design/methodology/approach This study conducts a systematic review, examining the content of 60 relevant papers (spanning 2000–2022) concerning public R&D budget allocation. The analysis focuses on allocation methodology, R&D output evaluation, budget allocation efficiency and the management of uncertainty in the allocation process. Findings The systematic review reveals different methods proposed for allocating government R&D budgets. These methods range from classical optimization, multi-criteria analysis and hierarchical analysis to techniques such as balanced scorecard, data envelopment analysis and analytic hierarchy process, including fuzzy approaches. Recent trends indicate an increase in the use of advanced optimization, integration and simulation algorithms. Performance indicators for reflecting R&D project outputs or goals can be categorized into four main groups: output (e.g. publications, patents, graduates), outcome, productivity (e.g. citations, patent references, articles and patents per capita) and sector-specific metrics. Practical implications Future research directions in government R&D budget allocation may include optimizing allocation to maximize social, economic and political benefits, developing ranking models, decision-making frameworks, simulations and evaluations of factors influencing allocation type and strategy. Additionally, there is a growing interest in novel budget allocation algorithms leveraging artificial intelligence and self-adjusting meta-heuristic algorithms. Originality/value The systematic review showed that some important research gaps in (government) R&D budget allocation could be considered in future studies; for example, long-term social, economic and political benefits in budget allocation optimization models, comprehensiveness of allocating government R&D budgets to universities, higher education and research institutes, R&D budget allocation to strategic technology development, e.g. renewable energy sector, supply chain issues and renewable energy value chain; new budget allocation algorithms based on artificial intelligence and self-adjusting meta-heuristic algorithms; methods for optimizing the structures of government budget allocation to R&D, considering executive and regulatory conflicts.

Optimization of vehicle crashworthiness problems using recent twelve metaheuristic algorithms

Abstract In recent years, numerous optimizers have emerged and been applied to address engineering design challenges. However, assessing their performance becomes increasingly challenging with growing problem complexity, especially in the realm of real-world large-scale applications. This study aims to fill this gap by conducting a comprehensive comparative analysis of twelve recently introduced metaheuristic optimizers. The analysis encompasses real-world scenarios to evaluate their effectiveness. Initially, a review was conducted on twelve prevalent metaheuristic methodologies to understand their behavior. These algorithms were applied to optimize an automobile structural design, focusing on minimizing vehicle weight while enhancing crash and noise, vibration, and harshness characteristics. To approximate the structural responses, a surrogate model employing radial basis functions was utilized. Notably, the MPA algorithm excelled in automobile design problems, achieving the lowest mass value of 96.90608 kg during both mid-range and long-range iterations, demonstrating exceptional convergence behavior.

A metaheuristic algorithm for large maximum weight independent set problems

A metaheuristic algorithm for large maximum weight independent set problems

Knowledge-Based Perturbation LaF-CMA-ES for Multimodal Optimization

Multimodal optimization presents a significant challenge in optimization problems due to the existence of multiple attraction basins. Balancing exploration and exploitation is essential for the efficiency of algorithms designed to solve these problems. In this paper, we propose the KbP-LaF-CMAES algorithm to address multimodal optimization problems based on the Covariance Matrix Adaptation Evolution Strategy (CMA-ES) framework. The Leaders and Followers (LaF) and Knowledge-based Perturbation (KbP) strategies are the primary components of the KbP-LaF-CMAES algorithm. The LaF strategy is utilized to extensively explore the potential local spaces, where two cooperative populations evolve in synergy. The KbP strategy is employed to enhance exploration capabilities. Improved variants of CMA-ES are used to exploit specific domains containing local optima, thereby potentially identifying the global optimum. Simulation results on the test suite demonstrate that KbP-LaF-CMAES significantly outperforms other meta-heuristic algorithms.

Practical solutions for microgrid energy management: Integrating solar forecasting and correction algorithms

Nowadays, the shift towards renewable energies is happening at an exponential pace. Microgrids are an integral part in integrating renewable energies into the global energy mix. Due to the volatility of renewables, such as solar or wind, proper energy management is needed to avoid generation or load curtailment. This issue is addressed throughout the literature using a wide variety of strategies, ranging from classical linear to nature inspired metaheuristic optimization algorithms. This paper goes beyond the simulation phase of different optimization algorithms and addresses the optimal energy management problem by proposing a novel framework to integrate optimization strategies into the daily operation of microgrids. The proposed framework showcases 3 practical methods for controlling the distributed generators, as well as a communication scheme which facilitates the data transfer between the machine running the optimization strategy and the energy management system of the microgrid. The framework is demonstrated on a small-scale islanded microgrid setup, located at the Technical University of Cluj-Napoca. The microgrid setup consists of a photovoltaic array, a battery energy storage system and two dispatchable generators. A two-stage optimization strategy is used, consisting of a day-ahead stage, which uses the solar forecast provided by the Global Forecast System, prior to each day, to issue a working plan for the dispatchable generators, and an intra-day stage, which uses hourly solar forecasts, issued during the day, to adjust the operation of the microgrid and minimize the error between the day-ahead solar forecast and the actual weather conditions. Mixed integer linear programming is used to solve the optimization problem and validate the correct operation of the proposed framework over two case studies. The results show that the microgrid works as intended, in both scenarios, as well as the benefits of using an intra-day correction stage.

Data-driven vehicle rental and routing optimization: An application in online retailing

Due to limited self-owned vehicles, online retailers often struggle to meet high demands for deliveries, especially during large promotions. This study employs machine learning to tackle this challenge by shipping products and renting vehicles in advance. We explore a large amount of historical demand data, enabling accurate forecasting of demand information. It is then combined with an improved meta-heuristic algorithm named the Improved Discrete Whale Optimization Algorithm (IDWOA) to help online retailers make optimal decisions. The algorithm involves a discretization method and an effective perturbation strategy, along with information sharing, Cauchy mutation, and an elimination strategy. Experimental results demonstrate that our method can reduce costs by 14.78% compared to temporary vehicle rentals, and it significantly outperforms other comparative algorithms. Therefore, our study effectively integrates machine learning algorithms with an improved meta-heuristic approach, allowing for increased utilization of data-driven advantages to enhance the precision and efficiency of vehicle rental and routing optimization.

Enhancing thermal management systems: a machine learning and metaheuristic approach for predicting thermophysical properties of nanofluids

Abstract In thermal engineering, predicting nanofluid thermophysical properties is essential for efficient cooling systems and improved heat transfer. Traditional methods often fall short in handling complex datasets. This study leverages machine learning (ML) and metaheuristic algorithms to predict key nanofluid properties, such as specific heat capacity (SHC), thermal conductivity (TC), and viscosity. By utilizing Artificial Neural Networks (ANN), Support Vector Regression (SVR), Gradient Boosting (GB), and Linear Regression (LR), alongside metaheuristic models like Differential Evolution (DE) and Particle Swarm Optimization (PSO), we achieve superior prediction accuracy compared to traditional models. The integration of these computational techniques with empirical data demonstrates their effectiveness in capturing the complex dynamics of thermofluids. Our results validate the precision of ML and metaheuristic models in predicting nanofluid properties and underscore their potential as robust tools for researchers and practitioners in thermal engineering. This work paves the way for future exploration of ML algorithms in thermal management, marking a significant advancement in optimizing nanofluid applications in industry and research.

A Comparative Study of Metaheuristic Feature Selection Algorithms for Respiratory Disease Classification.

The correct diagnosis and early treatment of respiratory diseases can significantly improve the health status of patients, reduce healthcare expenses, and enhance quality of life. Therefore, there has been extensive interest in developing automatic respiratory disease detection systems. Most recent methods for detecting respiratory disease use machine and deep learning algorithms. The success of these machine learning methods depends heavily on the selection of proper features to be used in the classifier. Although metaheuristic-based feature selection methods have been successful in addressing difficulties presented by high-dimensional medical data in various biomedical classification tasks, there is not much research on the utilization of metaheuristic methods in respiratory disease classification. This paper aims to conduct a detailed and comparative analysis of six widely used metaheuristic optimization methods using eight different transfer functions in respiratory disease classification. For this purpose, two different classification cases were examined: binary and multi-class. The findings demonstrate that metaheuristic algorithms using correct transfer functions could effectively reduce data dimensionality while enhancing classification accuracy.

Optimization modelling for a sustainable closed-loop supply chain network using IoT: multiobjective metaheuristic algorithms

Optimization modelling for a sustainable closed-loop supply chain network using IoT: multiobjective metaheuristic algorithms

Meta-Heuristic Scheduling: A Review on Swarm Intelligence and Hybrid Meta-Heuristics Algorithms for Cloud Computing

Meta-Heuristic Scheduling: A Review on Swarm Intelligence and Hybrid Meta-Heuristics Algorithms for Cloud Computing

Transfer function adaptation for effective feature selection with the side-blotched lizard algorithm

AbstractFeature selection is a crucial preprocessing step in data mining and machine learning, enhancing model performance and computational efficiency. This paper investigates the effectiveness of the Side-Blotched Lizard Optimization Algorithm (SBLA) for feature selection by developing six novel variants: Sbla-s1, Sbla-s2, Sbla-s3, Sbla-v1, Sbla-v2, and Sbla-v3, each employing distinct S-shaped or V-shaped transfer functions to convert the continuous search space to a binary format. These variants were rigorously evaluated on nineteen benchmark datasets from the UCI repository, comparing their performance based on average classification accuracy, average number of selected features, and average fitness value. The results demonstrated the superiority of Sbla-s3, achieving an average classification accuracy of 92.8% across all datasets, a mean number of selected features of 20, and an average fitness value of 0.08. Furthermore, Sbla-s3 consistently outperformed six other state-of-the-art metaheuristic algorithms, achieving the highest average accuracy on sixteen out of nineteen datasets. These findings establish Sbla-s3 as a promising and effective approach for feature selection, capable of identifying relevant features while maintaining high classification accuracy, potentially leading to improved model performance in various machine learning applications.

MSAO-EDA: A Modified Snow Ablation Optimizer by Hybridizing with Estimation of Distribution Algorithm.

Metaheuristic algorithms provide reliable and effective methods for solving challenging optimization problems. The snow ablation algorithm (SAO) performs favorably as a physics-based metaheuristic algorithm. Nevertheless, SAO has some shortcomings. SAO is overpowered in its exploitation, has difficulty in balancing the proportion of global and local search, and is prone to encountering local optimum traps when confronted with complex problems. To improve the capability of SAO, this paper proposes a modified snow ablation algorithm hybrid distribution estimation algorithm named MSAO-EDA. In this work, a collaborative search framework is proposed where SAO and EDA can be organically integrated together to fully utilize the exploitation capability of SAO and the exploration capability of EDA. Secondly, an offset EDA approach that combines the optimal solution and the agent itself is used to replace SAO's exploration strategy for the purpose of enhancing SAO's exploration capability. Finally, the convergence of SAO is accelerated by selecting the next generation of agents through a greedy strategy. MSAO-EDA is tested on the CEC 2017 and CEC 2022 test suites and compared with EO, RIME, MRFO, CFOA, and four advanced algorithms, AFDBARO, CSOAOA, EOSMA, and JADE. The experimental results show that MSAO-EDA has excellent efficiency in numerical optimization problems and is a highly competitive SAO variant.