Hybrid Metaheuristic Algorithm Research Articles

Optimizing time and cost in construction projects with a hybridized multi-verse optimizer and opposition-based learning

PurposeFor successful management of construction projects, a precise analysis of the balance between time and cost is imperative to attain the most effective results. The aim of this study is to present an innovative approach tailored to tackle the challenges posed by time-cost trade-off (TCTO) problems. This objective is achieved through the integration of the multi-verse optimizer (MVO) with opposition-based learning (OBL), thereby introducing a groundbreaking methodology in the field.Design/methodology/approachThe paper aims to develop a new hybrid meta-heuristic algorithm. This is achieved by integrating the MVO with OBL, thereby forming the iMVO algorithm. The integration enhances the optimization capabilities of the algorithm, notably in terms of exploration and exploitation. Consequently, this results in expedited convergence and yields more accurate solutions. The efficacy of the iMVO algorithm will be evaluated through its application to four different TCTO problems. These problems vary in scale – small, medium and large – and include real-life case studies that possess complex relationships.FindingsThe efficacy of the proposed methodology is evaluated by examining TCTO problems, encompassing 18, 29, 69 and 290 activities, respectively. Results indicate that the iMVO provides competitive solutions for TCTO problems in construction projects. It is observed that the algorithm surpasses previous algorithms in terms of both mean deviation percentage (MD) and average running time (ART).Originality/valueThis research represents a significant advancement in the field of meta-heuristic algorithms, particularly in their application to managing TCTO in construction projects. It is noteworthy for being among the few studies that integrate the MVO with OBL for the management of TCTO in construction projects characterized by complex relationships.

MCN portfolio: An efficient portfolio prediction and selection model using multiserial cascaded network with hybrid meta-heuristic optimization algorithm

ABSTRACT Generally, financial investments are necessary for portfolio management. However, the prediction of a portfolio becomes complicated in several processing techniques which may cause certain issues while predicting the portfolio. Moreover, the error analysis needs to be validated with efficient performance measures. To solve the problems of portfolio optimization, a new portfolio prediction framework is developed. Initially, a dataset is collected from the standard database which is accumulated with various companies’ portfolios. For forecasting the benefits of companies, a Multi-serial Cascaded Network (MCNet) is employed which constitutes of Autoencoder, 1D Convolutional Neural Network (1DCNN), and Recurrent Neural Network (RNN) is utilized. The prediction output for the different companies is stored using the developed MCNet model for further use. After predicting the benefits, the best company with the highest profit is selected by Integration of Artificial Rabbit and Hummingbird Algorithm (IARHA). The major contribution of our work is to increase the accuracy of prediction and to choose the optimal portfolio. The implementation is conducted in Python platform. The result analysis shows that the developed model achieves 0.89% and 0.56% regarding RMSE and MAE measures. Throughout the analysis, the experimentation of the developed model shows enriched performance.

Speed control of PMSM using a fuzzy logic controller with deformed MFS tuned by a novel hybrid meta-heuristic algorithm

Speed control of PMSM using a fuzzy logic controller with deformed MFS tuned by a novel hybrid meta-heuristic algorithm

A Sustainable Multi-Objective Model for Capacitated-Electric-Vehicle-Routing-Problem Considering Hard and Soft Time Windows as Well as Partial Recharging.

Due to the high pollution of the transportation sector, nowadays the role of electric vehicles has been noticed more and more by governments, organizations, and environmentally friendly people. On the other hand, the problem of electric vehicle routing (EVRP) has been widely studied in recent years. This paper deals with an extended version of EVRP, in which electric vehicles (EVs) deliver goods to customers. The limited battery capacity of EVs causes their operational domains to be less than those of gasoline vehicles. For this purpose, several charging stations are considered in this study for EVs. In addition, depending on the operational domain, a full charge may not be needed, which reduces the operation time. Therefore, partial recharging is also taken into account in the present research. This problem is formulated as a multi-objective integer linear programming model, whose objective functions include economic, environmental, and social aspects. Then, the preemptive fuzzy goal programming method (PFGP) is exploited as an exact method to solve small-sized problems. Also, two hybrid meta-heuristic algorithms inspired by nature, including MOSA, MOGWO, MOPSO, and NSGAII_TLBO, are utilized to solve large-sized problems. The results obtained from solving the numerous test problems demonstrate that the hybrid meta-heuristic algorithm can provide efficient solutions in terms of quality and non-dominated solutions in all test problems. In addition, the performance of the algorithms was compared in terms of four indexes: time, MID, MOCV, and HV. Moreover, statistical analysis is performed to investigate whether there is a significant difference between the performance of the algorithms. The results indicate that the MOSA algorithm performs better in terms of the time index. On the other hand, the NSGA-II-TLBO algorithm outperforms in terms of the MID, MOCV, and HV indexes.

Smart network security using advanced ensemble-DDoS attack detection and hybrid JA-SLOA-linked optimal routing-based mitigation

ABSTRACT Distributed Denial of Service (DDoS) attacks are distributed at a faster rate, and they are considered to be fatal threats over the Internet. Moreover, several deep learning approaches are insufficient to attain the maximum efficiency and appropriate detection due to the complexity and diversity of DDoS attack traffic under fast fast-speed network environment since they are providing with individual performance. Hence, an ensemble learning model is developed for DDoS detection and mitigation with the hybrid optimization algorithm to ensure good detective performance against DDoS attacks. The pre-processed data is fed to the feature extraction process where it is done through the Deep Belief Network (DBN) and Autoencoder techniques for acquiring the deep features. The optimized fusion of deep features takes place using hybrid meta-heuristic algorithm of Adaptive Sound Speed-based Jaya Sea Lion Optimization (ASS-JSLnO). The attack detection is performed by the Improved Ensemble Learning (IEL) approach. Then, the mitigation strategy is applied by the optimal routing and multi-objective function. Finally, the experiments are made to establish the high detection efficacy of the implemented attack detection and mitigation framework.

The distributed no-idle permutation flowshop scheduling problem with due windows

The distributed no-idle permutation flowshop scheduling problem has gained significant attention as a prominent area of research in recent years, particularly in industries where setup operations are so expensive that reactivating the machines is not cost-effective. This study addresses an extension of the distributed permutation flowshop scheduling problem with no-idle and due window constraints. The aim is to determine the job assignments to the factories and their sequences in each factory that provide the minimum total weighted earliness and tardiness (TWET) penalties considering due windows. This study is the first to formulate this problem, offering four different mathematical models, and presents a benchmark to examine different problem cases that may arise in practical applications. Furthermore, to effectively solve the diverse problem instances, two hybrid metaheuristic algorithms based on the Iterated Greedy are proposed. These metaheuristics exhibit promising capabilities, enabling the solution of problem instances involving up to 500 jobs. To assess the effectiveness of the proposed models and algorithms, extensive numerical experiments are conducted, facilitating a thorough evaluation and comparison of their performances.

A meta-heuristic approach for reliability-based design optimization of shell-and-tube heat exchangers

This study introduces a new framework for optimizing Shell-and-Tube Heat Exchanger (STHE) layouts using a reliability-based design optimization (RBDO) approach. The framework combines a control variate-based surrogate model and a hybrid metaheuristic algorithm. The proposed hybrid algorithm, k-means clustering and whale optimization algorithm (kWOA), was evaluated using CEC’2020 and a case study for optimizing STHE design under static conditions. kWOA showed superior performance in minimizing STHE's total annual cost and solving benchmark functions effectively. In our case study, the RBDO framework optimized the STHE design under two scenarios with target failure probabilities of 1% and 5%, resulting in cost increases of 112% and 82%, respectively, compared to deterministic optimization (DO). The integration of the RBDO approach with the STHE mathematical model, considering factors like inlet flow temperatures, mass flow rates, and fouling resistance, demonstrated the framework's ability to balance the trade-off between cost and reliability under uncertainty. Hybrid control variate radial basis function (RBF) models and Monte Carlo Simulation (MCS) were used to assess safety levels, showing the RBDO framework's superiority in improving safety and significantly reducing failure probability from 89% to 1% and 5%. The RBDO framework offers a robust approach for designing STHEs that achieve optimal performance while ensuring high reliability under uncertain conditions.

Partial and cost-minimized computation offloading in hybrid edge and cloud systems

Nowadays, numerous mobile devices (MDs) provide nearly anytime and anywhere services, running on top of various computation-intensive applications. However, bearing limited battery, bandwidth, computing, and storage resources, MDs cannot completely execute all tasks of such applications in real-time. Cloud data centers (CDCs) possess enormous resources and energy, which can help execute tasks offloaded from MDs. Nonetheless, CDCs reside in remote sites, thereby leading to long transmission latency. In recent years, small base stations (SBSs) have emerged to offer close proximity, high bandwidth, and low latency services to their nearby and limited MDs. However, it becomes a new challenge to minimize the total system cost in a complex and heterogeneous architecture. To address it, this work proposes an energy-minimized partial computation offloading technique. First, a limited optimization problem of cost minimization for the system is formulated. Afterward, an improved hybrid meta-heuristic algorithm is developed, which synergistically combines a Metropolis acceptance criterion of simulated annealing and genetic operations. One uniqueness of the proposed algorithm is that it simultaneously determines task allocation among MDs, an SBS, and a CDC, the transmission power of MDs, and bandwidth allocation of wireless channels between MDs and SBS. Experiments with real-life tasks from Google data centers have shown that the proposed Genetic Simulated-annealing-based Particle swarm optimization (GSP) significantly achieves lower system cost and faster convergence speed than benchmark peers.

A hybrid metaheuristic to optimize electric first-mile feeder services with charging synchronization constraints and customer rejections

This paper addresses the on-demand meeting-point-based feeder electric bus routing and charging scheduling problem under charging synchronization constraints. The problem considered exhibits the structure of the location routing problem, which is more difficult to solve than many electric vehicle routing problems with capacitated charging stations. We propose to model the problem using a mixed-integer linear programming approach based on a layered graph structure. An efficient hybrid metaheuristic solution algorithm is proposed. A mixture of random and greedy partial charging scheduling strategies is used to find feasible charging schedules under the synchronization constraints. The algorithm is tested on instances with up to 100 customers and 49 bus stops/meeting points. The results show that the proposed algorithm provides near-optimal solutions within less one minute on average compared with the best solutions found by a mixed-integer linear programming solver set with a 4-hour computation time limit. A case study on a larger sized case with 1000 customers and 111 meeting points shows the proposed method is applicable to real-world situations.

Hybrid Metaheuristic Algorithms for Optimization of Countrywide Primary Energy: Analysing Estimation and Year-Ahead Prediction

In the present work, India’s primary energy use is analysed in terms of four socio-economic variables, including Gross Domestic Product, population, and the amounts of exports and imports. Historical data were obtained from the World Bank database for 44 years as annual values (1971–2014). Energy use is analysed as an optimisation problem, where a unique ensemble of two metaheuristic algorithms, Grammatical Evolution (GE), and Differential Evolution (DE), is applied. The energy optimisation problem has been investigated in two ways: estimation and a year-ahead prediction. Models are compared using RMSE (objective function) and further ranked using the Global Performance Index (GPI). For the estimation problem, RMSE values are found to be as low as 0.0078 and 0.0103 on training and test datasets, respectively. The average estimated energy use is found in good agreement with the data (RMSE = 6.3749 kgoe/capita), and the best model (E10) has an RMSE of 5.8183 kgoe/capita, with a GPI of 1.7249. For the prediction problem, RMSE is found to be 0.0096 and 0.0122 on training and test datasets, respectively. The average predicted energy use has RMSE of 7.8857 (kgoe/capita), while Model P20 has the best value of RMSE (7.9201 kgoe/capita) and a GPI of 1.8836.

Neuro-computing solution for Lorenz differential equations through artificial neural networks integrated with PSO-NNA hybrid meta-heuristic algorithms: a comparative study

In this article, examine the performance of a physics informed neural networks (PINN) intelligent approach for predicting the solution of non-linear Lorenz differential equations. The main focus resides in the realm of leveraging unsupervised machine learning for the prediction of the Lorenz differential equation associated particle swarm optimization (PSO) hybridization with the neural networks algorithm (NNA) as ANN-PSO-NNA. In particular embark on a comprehensive comparative analysis employing the Lorenz differential equation for proposed approach as test case. The nonlinear Lorenz differential equations stand as a quintessential chaotic system, widely utilized in scientific investigations and behavior of dynamics system. The validation of physics informed neural network (PINN) methodology expands to via multiple independent runs, allowing evaluating the performance of the proposed ANN-PSO-NNA algorithms. Additionally, explore into a comprehensive statistical analysis inclusive metrics including minimum (min), maximum (max), average, standard deviation (S.D) values, and mean squared error (MSE). This evaluation provides found observation into the adeptness of proposed AN-PSO-NNA hybridization approach across multiple runs, ultimately improving the understanding of its utility and efficiency.

Dynamic Events in the Flexible Job-Shop Scheduling Problem: Rescheduling with a Hybrid Metaheuristic Algorithm

In the real world of manufacturing systems, production planning is crucial for organizing and optimizing various manufacturing process components. The objective of this paper is to present a methodology for both static scheduling and dynamic scheduling. In the proposed method, a hybrid algorithm is utilized to optimize the static flexible job-shop scheduling problem (FJSP) and dynamic flexible job-shop scheduling problem (DFJSP). This algorithm integrates the genetic algorithm (GA) as a global optimization technique with a simulated annealing (SA) algorithm serving as a local search optimization approach to accelerate convergence and prevent getting stuck in local minima. Additionally, variable neighborhood search (VNS) is utilized for efficient neighborhood search within this hybrid algorithm framework. For the FJSP, the proposed hybrid algorithm is simulated on a 40-benchmark dataset to evaluate its performance. Comparisons among the proposed hybrid algorithm and other algorithms are provided to show the effectiveness of the proposed algorithm, ensuring that the proposed hybrid algorithm can efficiently solve the FJSP, with 38 out of 40 instances demonstrating better results. The primary objective of this study is to perform dynamic scheduling on two datasets, including both single-purpose machine and multi-purpose machine datasets, using the proposed hybrid algorithm with a rescheduling strategy. By observing the results of the DFJSP, dynamic events such as a single machine breakdown, a single job arrival, multiple machine breakdowns, and multiple job arrivals demonstrate that the proposed hybrid algorithm with the rescheduling strategy achieves significant improvement and the proposed method obtains the best new solution, resulting in a significant decrease in makespan.

Particle Filter based on Jaya optimisation for Bayesian updating of nonlinear models

Particle filter (PF) is a powerful and commonly used filtering technique based on Sequential Monte Carlo framework. The main challenge in using PF for nonlinear state and parameter estimation is the degeneracy of particles. Although resampling techniques can solve this to some extent, it would still result in particle impoverishment when a limited number of particles are used thereby affecting the accuracy. Hence, a hybrid metaheuristic optimisation algorithm that combines the PF with Jaya optimisation, (PF-JAYA) has been proposed and implemented for joint state and parameter estimation for geotechnical engineering problems. The performance of PF-JAYA has been compared against the traditional Particle Filter with Sampling Importance Resampling (PF-SIR) technique. The synthetic examples show that PF-JAYA outperforms PF-SIR in terms of accuracy, rate of convergence, parameter identification and particle diversity. Furthermore, the performance of PF-JAYA is independent of the choice of prior distribution and due to its superior convergence proves to be efficient when working with sparse monitoring information. The performance of PF-JAYA on Bayesian updating of state and parameters of an elastoplastic model for a synthetic embankment case has also been evaluated where, along with PF-SIR, the Ensemble Kalman Filter (EnKF) is also chosen for comparison. Finally a further evaluation using the Lorenz ‘63 model, shows the superior performance of PF-JAYA in terms of accuracy and precision over the classical Data Assimilation techniques.

Multiobjective Neuro-Fuzzy Controller Design and Selection of Filter Parameters of UPQC Using Predator Prey Firefly and Enhanced Harmony Search Optimization

This research introduces a unified power quality conditioner (UPQC) that integrates solar photovoltaic (PV) system and battery energy systems (SBES) to address power quality (PQ) issues. The reference signals for voltage source converters of UPQC are produced by the Levenberg–Marquardt back propagation (LMBP) trained artificial neural network control (ANNC). This method removes the necessity for conventional dq0, abc complex shifting. Moreover, the optimal choice of parameters for the adaptive neuro-fuzzy inference system (ANFIS) was achieved through the integration of the enhanced harmony search algorithm (EHSA) and the predator-prey-based firefly algorithm (PPFA) in the form of the hybrid metaheuristic algorithm (PPF-EHSA). In addition, the algorithm is employed to optimize the selection of resistance and inductance values for the filters in UPQC. The primary objective of the ANNC with predator-prey-based firefly algorithm and enhanced harmony search algorithm (PPF-EHSA) is to enhance the stability of the DC-link capacitor voltage (DLCV) with reduced settling time amid changes in load, solar irradiation (G), and temperature (T). Moreover, the algorithm seeks to achieve a reduction in total harmonic distortion (THD) and enhance power factor (PF). The method also focuses on mitigating fluctuations such as swell, harmonics, and sag and also unbalances at the grid voltage. The proposed approach is examined through four distinct cases involving various permutations of loads and sun irradiation (G). However, in order to demonstrate the performance of the suggested approach, a comparison is conducted with the ant colony and genetic algorithms, i.e., (ACA) (GA), as well as the standard methods of synchronous reference frame (SRF) and instantaneous active and reactive power theory (p-q). The results clearly demonstrate that the proposed method exhibits a reduced mean square error (MSE) of 0.02107 and a lower total harmonic distortion (THD) of 2.06% compared to alternative methods.

Combining hybrid metaheuristic algorithms and reinforcement learning to improve the optimal control of nonlinear continuous-time systems with input constraints

This paper proposes an innovative method for achieving optimal tracking control in nonlinear continuous-time systems with input constraints. The method combines reinforcement learning and hybrid metaheuristics to enhance the controller’s performance. Specifically, a hybrid metaheuristic algorithm is employed to optimize the hyperparameters of a critic neural network, which serves as the system’s controller. The proposed approach is evaluated through extensive simulation studies on a nonlinear system with input constraints. Results demonstrate its superiority over traditional control techniques in terms of accuracy, timeliness, and stability. Notably, the approach effectively eliminates overshoot and steady-state error while providing precise and prompt tracking and showcasing remarkable robustness against model uncertainties. By synergistically integrating reinforcement learning and hybrid metaheuristics, this approach represents a significant advancement in enhancing the control performance of complex nonlinear systems. The simulation studies confirm superiority of the proposed approach over existing techniques, offering a promising solution for achieving optimal tracking control in nonlinear systems with input constraints. This approach holds potential for a wide range of applications, including robotics, aerospace, and manufacturing, where precise and prompt tracking control is critical.

Hybrid Metaheuristic Optimization Algorithms with Least-Squares Support Vector Machine and Boosted Regression Tree Models for Prediction of Air-Blast Due to Mine Blasting

Hybrid Metaheuristic Optimization Algorithms with Least-Squares Support Vector Machine and Boosted Regression Tree Models for Prediction of Air-Blast Due to Mine Blasting

Forecasting of energy-related carbon dioxide emission using ANN combined with hybrid metaheuristic optimization algorithms

Energy-related CO2 emissions are one of the biggest concerns facing urban design today, increasing rapidly as cities grow. This study uses as inputs the GDP of the G8 nations (from 1990 to 2016) depending on the utilization of various energy sources, including coal, oil, natural gas, and renewable energy. Multilayer perceptrons (MLP) are combined with various nature-inspired optimization algorithms, such as Heap-Based Optimizer (HBO), Teaching-Learning-Based Optimization (TLBO), Whale Optimization Algorithm (WOA), Vortex Search algorithm (VS), and Earthworm Optimization Algorithm (EWA), to create a dependable predictive network that takes the complexity of the problem into account. Our key contributions lie in developing and comprehensively evaluating these hybrid models assessing their efficacy in capturing the intricate dynamics of carbon emissions. The study found that TLBO and VS outperform other algorithms in CO2 emission computation accuracy. TLBO has a higher training MSE (3.6778) and lower testing MSE (4.4673), suggesting larger squared errors on training data and lower testing MSE, suggesting less overfitting due to better generalization to the testing set.

Design a hybrid meta-heuristic algorithm for optimal multicell-MMSE to maximize the spectral efficiency in massive MIMO systems

Abstract Due to many capabilities, “massive multiple-input multiple-output (MIMO) systems” are regarded as a crucial enabling innovation. High energy economy, great spectral efficiency (SE), and simultaneous communication to many user equipments (UEs) are some of the sophisticated characteristics of massive MIMO systems. Huge MIMO, which involves installing arrays of antennas with a high amount of active components at the base station (BS) and utilizing coherent baseband processing, is a viable method for boosting the SE of cell phone networks. Massive MIMO’s spatial multiplexing and unparalleled array gain can increase the processing power of cellular networks. Since its origin, it has been assumed that when the number of radios increases infinitely, the coherent interference brought on by pilot emissions leads to a limited capacity limit. To achieve this objective, an optimal multicell MMSE is proposed for SE maximization. It is processed as the precoding or combining technique that is considered the small amount of spatial channel correlation, more capacity and more number of antennas, large-scale fading variations, and pilot contamination. It is noted that several cases for increasing the SE, thus it contain multiple antenna information. The prime novelty of this paper is introducing the hybrid heuristic algorithm, named as Fitness-condition of red deer and rat swarm algorithm (FRDRSA) for providing the best solution. Finally, the work performance that produced the extensive findings is examined. On the other hand, the suggested method produces an impressive result when measuring the system’s overall SE.

A Quantum-Inspired Ant Colony Optimization Algorithm for Parking Lot Rental to Shared E-Scooter Services

Electric scooter sharing mobility services have recently spread in major cities all around the world. However, the bad parking behavior of users has become a major source of issues, provoking accidents and compromising urban decorum of public areas. Reducing wild parking habits can be pursued by setting reserved parking spaces. In this work, we consider the problem faced by a municipality that hosts e-scooter sharing services and must choose which locations in its territory may be rented as reserved parking lots to sharing companies, with the aim of maximizing a return on renting and while taking into account spatial consideration and parking needs of local residents. Since this problem may result difficult to solve even for a state-of-the-art optimization software, we propose a hybrid metaheuristic solution algorithm combining a quantum-inspired ant colony optimization algorithm with an exact large neighborhood search. Results of computational tests considering realistic instances referring to the Italian capital city of Rome show the superior performance of the proposed hybrid metaheuristic.

An Enhanced Path Finder Algorithm for the estimation of the stator current envelope to detect rotor bar breakage in an induction motor

The Enhanced Path Finder Algorithm (EPFA) is used in this research to present an innovative approach for examining the state of the rotor bars in an induction motor, employing a hybrid metaheuristic algorithm. Compared to current optimization techniques, the suggested approach permits more balanced exploration and exploitation. The method addresses the drawbacks of traditional analysis of fault related frequencies, such as short data length, spectrum leakages, and inadequate sampling frequency. The primary goal of this research is to identify the twice-slip frequency component and its harmonics in the current envelope that correlates with the fault. The A signal model of the stator current envelope and the residual error function have been used to define a nonlinear least-squares problem. An induction machine model has been developed in 2D ANSYS Maxwell software where faults have been implemented and studied. Finally, the efficiency of the fault detection scheme has been verified with a practical data set.