Search

Enhanced index tracking (EIT) problem is concerned with selecting a tracking portfolio to beat the benchmark on return while having the minimum tracking error. This paper addresses the EIT problem based on uncertainty theory where stock returns are treated as uncertain variables instead of random variables. Under the framework of uncertainty theory, the paper proposes a new uncertain EIT model where the higher-order moment of the downside is used as the tracking error measure, as higher-order moment makes the model more widely applicable and the downside risk is in line with investors' perception of risk. Besides, some realistic constraints are considered in the new uncertain EIT model. Then, the properties of the proposed model are discussed. To solve the model, we proposed, which is a nonlinear integer programming problem, a meta-heuristic algorithm presented. The efficiency of the algorithm and the applications of the proposed model are illustrated through numerical experiments. [ABSTRACT FROM AUTHOR]

Cooperation search algorithm (CSA) is a new metaheuristic algorithm inspired from the team cooperation behaviors in modern enterprises and is characterized by fast convergence. However, for complex multimodal problems, it may get trapped into local optima and suffer from premature convergence for the shortcoming of population updating guided only by leading individuals. In this paper, the issue of low convergence efficiency and convergence accuracy of the CSA algorithm on complex multimodal problems is dramatically alleviated by integrating the mutation and crossover operators in DE algorithm. Experimental results demonstrate the better performance of CCSA on convergence speed and accuracy as compared to other existing optimizers. Furthermore, aiming at the problem that there is no universal approach for the multi-degree reduction in Ball Bézier surfaces under different interpolation constrains, we propose a new method to solve this problem by introducing metaheuristic methods, where the change of interpolation constrains is treated as the change of decision variables. The modeling examples show that the proposed method is effective and easy to implement under different interpolation constrains, which can achieve the multi-degree reduction in Ball Bézier surfaces at one time and can simplify the degree reduction procedure significantly. [ABSTRACT FROM AUTHOR]

Channel selection is difficult for electroencephalographic (EEG) channel data. The test for confidential information is performed using a 16-channel electrode and recorded EEG data. The system's performance suffers when optimal channel selection data are not available. Removing noise and irrelevant channels improves the outcomes and implementation of the EEG deception identification system. Swarm optimization techniques are frequently used to overcome feature selection problems. Transfer functions need swarm algorithms because they change the search space from one that is continuous to one that is discrete. The currently used sigmoid transfer function cannot balance exploration and exploitation stages in the search space, including optimal local problems. The novel binary Harris Hawks optimization with a time-varying transfer function (TVk-BHHO) is used in this work to select channels from EEG channel data optimally. Controlling the time-varying parameter is essential for balancing the search space's exploration and exploitation stages and avoiding the optimum local problem. In this case, a specific classifier from a random forest improves the system's performance and accuracy. The results show that TVk-BHHO has consistent channel selection, resulting in higher classification accuracy and more harmonious convergence. Existing meta-heuristic algorithms are against the simulation results of the new TVk-BHHO approach. The best accuracy achieved here is 98.50%. [ABSTRACT FROM AUTHOR]

In this study, the permutation flow shop scheduling problem with makespan criteria is investigated, and two algorithms, Jaya and SAMP-Jaya, are proposed. Jaya is a simple and effective meta-heuristic optimization technique that has been successfully applied in various engineering problems, while SAMP-Jaya is a modified version of Jaya that uses a multi-population approach. Both algorithms are parameter-less, and the ANOVA experiment is used to identify the significant control parameters. The population size is found to be the most crucial parameter for improving solution quality. The performance of Jaya and SAMP-Jaya is compared to the exact solution and the genetic algorithm, demonstrating the superiority of the proposed algorithms. The computational results confirm that the suggested optimization techniques are effective in terms of solution quality. [ABSTRACT FROM AUTHOR]

Hybrid renewable power generation becomes essential in most of electric power networks. Battery storage is commonly used in renewable energy systems (RESs) with distributed generation, such as solar and wind energy systems, to reduce power fluctuations caused by the intermittent behavior of renewable energy sources. A battery has been connected with the dc grid through a dc–dc bi-directional converter. The control scheme of the dc–dc bi-directional converter (BDC) is having two controlled loops. One is voltage-controlled loop, and another is the current-controlled loop. In this work, two-degree-of-freedom fractional order proportional integral derivative + proportional integral controller (2-DOF FOPID + PI) is proposed and applied in the voltage-controlled loop to stabilize the dc bus voltage and power flow effectively for both islanded mode and grid-connected mode. A novel meta-heuristic algorithm, i.e., modified sine cosine algorithm (m-SCA), is used to tune the controller parameters of the proposed controller. To test the performance of the modified SCA algorithm, various well-known uni-modal and multi-modal benchmark functions are taken in this paper. To confer the viability of the proposed controller, its performance is compared with other literature-based conventional controllers. This paper presents time-domain analysis, stability, and robustness test to illustrate the effectiveness of the proposed controller. MATLAB/Simulink has been used for computational work to analyze the system's efficiency. Finally, the proposed technique is validated by using OPAL-RT platform (Opal-RT-OP4510 model) with the power management of RES (PV and wind) and battery energy storage. Experimental work proved the effectiveness of the proposed m-SCA optimized 2-DOF FOPID + PI controller. [ABSTRACT FROM AUTHOR]

This paper introduces a new meta-heuristic technique, named geometric mean optimizer (GMO) that emulates the unique properties of the geometric mean operator in mathematics. This operator can simultaneously evaluate the fitness and diversity of the search agents in the search space. In GMO, the geometric mean of the scaled objective values of a certain agent's opposites is assigned to that agent as its weight representing its overall eligibility to guide the other agents in the search process when solving an optimization problem. Furthermore, the GMO has no parameter to tune, contributing its results to be highly reliable. The competence of the GMO in solving optimization problems is verified via implementation on 52 standard benchmark test problems including 23 classical test functions, 29 CEC2017 test functions as well as nine constrained engineering problems. The results presented by the GMO are then compared with those offered by several newly proposed and popular meta-heuristic algorithms. The results demonstrate that the GMO significantly outperforms its competitors on a vast range of the problems. Source codes of GMO are publicly available at https://github.com/farshad-rezaei1/GMO. [ABSTRACT FROM AUTHOR]

A novel multi-layer multi-spiking neural network (MMSNN) model sends information from one neuron to the next through multiple synapses in different spikes. When a suitable training method is unavailable, there are numerous complications in training spike neural networks. The convergence rate is slow when gradient descent algorithms are trained on multi-spike neural networks. Meanwhile, the spiking network is likely to perform poorly in classifying electroencephalographic (EEG) datasets due to its high propensity to fall within the local minima. With the help of a 16-channel electrode, the Concealed Information Test created the EEG dataset. The Mini Batch Stochastic Gradient Descent (MBSGD) built the batch size and cut the number of iterations to speed up the convergence rate. It can, however, avoid the problem of moving into the local minimum more effectively. This paper describes an MBSGD algorithm for MMSNN model training that addresses local minima and convergence rate issues. This paper presents an MBSGD-MMSNN model for classifying EEG data. The MBSGD algorithm adjusts the weight parameters of the MMSNN model based on the batch size until the error is less than the required value. As a result, we achieve a faster convergence rate and avoid issues with local minima. The performance of the proposed MBSGD-MMSNN model is compared to that of existing meta-heuristic algorithms. The proposed MBSGD-MMSNN model outperformed other state-of-the-art algorithms regarding the accuracy and learning performance. [ABSTRACT FROM AUTHOR]

With the support of enterprise intelligence system, an intelligent modeling method based on synthesizing various data sources and complex metabolic networks is adopted to provide technical support for the practical application of complex large-scale dynamic models. Academic research on international trade networks relies to a large extent on network models based on macro-national data and static analysis of international trade patterns, which are usually based on charts for trade flows and economic globalization. This paper presents an improved neural network algorithm for analyzing the complex dynamic meta-network model of international trade. By using a BP neural network to adjust the weighted values of the best neural network model, the need for continuous adjustment of neural network values is reduced, which may be an effective means to improve the efficiency of intrusion testing applications. The simulation results demonstrate that the model has good explanatory power. The globalization of enterprise markets, as the main driver of international business activities, has a significant impact on the establishment and development of national or regional international trade networks. Therefore, there is a need to study international trade networks using data at the micro level. This paper suggests an interdisciplinary approach to the study of international trade networks and a micro-level study of international trade networks. The model based on complex meta-network dynamic model elements, introduce the dynamic network representation, and use temporary labels to define the network boundary characteristics. [ABSTRACT FROM AUTHOR]

In order to assure accurate modelling, this study presents a new technique for appropriately modelling and simulating a proton exchange membrane fuel cell (PEMFC) system. The PEMFC is a cleaner and more sustainable energy source as compared to fossil fuels. The fundamental idea is to minimize the sum of squared error (SSE) between the estimated and measured output voltage for the Ballard Mark V model in order to identify the model parameters of PEMFC stacks as efficiently as possible using a newly developed meta-heuristic called enhanced efficient optimization algorithm (EINFO). The proposed optimizer is considered an enhanced version of the original INFO algorithm. By balancing the exploration and exploitation phases better, the EINFO algorithm is intended to improve the performance of the original INFO approach and prevent local optima. The new method was tested on 23 benchmark functions and compared to the original INFO algorithm as well as other recently evolved optimizers. The algorithm is examined and compared with some literature meta-heuristics, including the particle swarm optimization, sine cosine algorithm, dragonfly algorithm, atom search optimization, Harris hawks optimization, and efficient optimization algorithm, using 50 independent runs, in terms of convergence speed and least SSE. When compared to other methods, the final findings show that, the suggested technique achieves the fastest convergence speed. [ABSTRACT FROM AUTHOR]

For a stable system frequency without any problems, the generation and demand equation must always be balanced. But the difficulty of precisely predicting the changes in the load is a big problem. Here comes the responsibility of the load frequency control (LFC) loop to maintain the equality between supply and demand. The LFC loop's performance depends on the control technique or controller used. In our work, we propose a new cascade controller PD-P-PID that is applied in LFC applications for the first time. To obtain the optimum settings of our cascade controller, we used an optimization method called the marine predators algorithm (MPA). To verify the robustness of our controller, it was tested on three different systems: a single-area multi-source power system, a two-area multi-source power system with AC–DC tie-lines, and a three-area hydro-thermal power system with the generation rate constraints and Governor dead band taken into account for a more practical study. The obtained results are compared with many published works based on objective function integral time absolute error, settling time Ts, and overshoot/undershoot of frequency and tie-line power deviation. MPA-tuned PID-PD controllers offer superior performance to other literature as it gives a dynamic response with a shorter settling time and fewer frequency and tie-line power deviation oscillations when step loads are perturbed. [ABSTRACT FROM AUTHOR]

The feature selection (FS) is a binary optimization problem in the discrete optimization problem category. Maximizing the accuracy by using fewer features is the main aim of FS. Metaheuristic algorithms are widely used for FS in literature. Redundant and irrelevant features are selected/unselected by a binary metaheuristic optimization algorithm for FS. Search in a metaheuristic optimization algorithm is directed with a fitness function. The type and landscape of the search space affect the success of the algorithm. Generally, accuracy-based fitness functions of metaheuristic algorithms are used for FS. In this work, eleven existing and six novel fitness functions are analyzed on eleven various datasets with a novel binary threshold Lévy flight distribution (BTLFD) algorithm. The large datasets (Yale, ORL, and COIL20) have 1024 features. The medium datasets (SpectEW, BreastEW, Ionosphere, and SonarEW) has 22–60 features. The small datasets (Tic-tac-toe, WineEW, Zoo, and Lymphography) have 9–18 features. K-nearest neighbor is used as a classifier with five-fold cross-validation and the experimental results showed that three rarely used fitness functions produced more accurate solutions. In the comparisons, BTFLD outperformed 8 state-of-the-art metaheuristic algorithms on 21 datasets for FS. [ABSTRACT FROM AUTHOR]

Automotive Open System Architecture (AUTOSAR), as an open, standardized framework for automotive electronic software development, has gradually become the standard followed by major automotive manufacturers and automotive electronic device suppliers. The electronic software system problem improves the development efficiency and portability of the system by reducing the development cost of automotive electronic software while ensuring the quality of products and services, which is beneficial for subsequent upgrades and updates of the system. In order to improve the reliability of the software component deployment algorithm based on AUTOSAR architecture, we proposed the TDCA algorithm. During the execution of the algorithm, communication volume and communication degree are introduced to improve the accuracy of the deployment plan by optimizing the bus load and ECU balancing. Algorithm comparison experiments show that comparing heuristic and linear optimization algorithms, the TDCA algorithm proposed in this paper has significant advantages in reducing bus load and ECU utilization. The algorithm can reduce the communication between cores and balance ECU load according to the constraints of AUTOSAR architecture. [ABSTRACT FROM AUTHOR]

Community detection is a prominent research topic in Complex Network Analysis, and it constitutes an important research field on all those areas where complex networks represent a powerful interpretation tool for describing and understanding systems involved in neuroscience, biology, social science, economy, and many others. A challenging approach to uncover the community structure in complex network, and then revealing the internal organization of nodes, is Modularity optimization. In this research paper, we present an immune optimization algorithm (opt-IA) developed to detect community structures, with the main aim to maximize the modularity produced by the discovered communities. In order to assess the performance of opt-IA, we compared it with an overall of 20 heuristics and metaheuristics, among which one Hyper-Heuristic method, using social and biological complex networks as data set. Unlike these algorithms, opt-IA is entirely based on a fully random search process, which in turn is combined with purely stochastic operators. According to the obtained outcomes, opt-IA shows strictly better performances than almost all heuristics and metaheuristics to which it was compared; whilst it turns out to be comparable with the Hyper-Heuristic method. Overall, it can be claimed that opt-IA, even if driven by a purely random process, proves to be reliable and with efficient performance. Furthermore, to prove the latter claim, a sensitivity analysis of the functionality was conducted, using the classic metrics NMI, ARI and NVI. [ABSTRACT FROM AUTHOR]

This manuscript introduces a new socio-inspired metaheuristic technique referred to as leader–advocate–believer-based optimization algorithm (LAB) for engineering and global optimization problems. The proposed algorithm is inspired by the AI-based competitive behavior exhibited by the individuals in a group while simultaneously improving themselves and establishing a role (leader, advocate, believer). LAB performance in computational time and function evaluations are benchmarked using other metaheuristic algorithms. The algorithm is validated using the CEC 2005 and CEC 2017 benchmark functions. The algorithm was applied to solve engineering problems, including abrasive water jet machining, electric discharge machining, micro-machining processes and turning of titanium alloy in a minimum quantity lubrication environment. LAB algorithm was validated using the Friedman rank test. The results were compared with other algorithms such as FA, CI, GA, SA, PSO, Multi-CI, CMAES, ABC, SADE, CLPSO, BSA, IA, WOA, SHO, AVOA, LSHADE-Cn-EpsiN, FDB-SFS and LSHADE. For real-world problems, LAB outperformed SA, f best and f better by achieving 76%, 85% and 75% minimization of R a , respectively, for micro-milling with 0.7 mm tool diameter. For real-world problems, LAB achieved 81%, 72%, 85% minimization of R a when compared to SA, f best and f better for 1 mm tool diameter. LAB also achieved 24% and 34% minimization of B h and B t as compared to SA for micro-drilling with a tool diameter 0.5 mm. For tool diameters 0.8 mm and 0.9 mm, 16% and 3% minimization of B t , respectively, were achieved as compared to SA. The results from this study highlighted that the LAB outperforms the other algorithms in terms of function evaluations and computational time. The prominent features and limitations of the algorithm are also discussed. [ABSTRACT FROM AUTHOR]

In this paper, a novel metaheuristic optimization algorithm, called chief executive officer election optimization algorithm (CEOA), is proposed, which is inspired by the process of electing a Chief Executive Officer (CEO) in a company. CEOA simulates three stages of electing a CEO, namely the mass-election stage, election stage and authorization stage. The list of candidates is confirmed during the mass-election stage. In the election stage, each candidate has its own public relation team, and all the employees are divided into three different groups. The loyalist group always supports the candidate of their own faction, which enhances the exploitation ability of the algorithm. The speculator group tries to seize the CEO's position directly by taking advantage of the current candidates through a variety of behaviors, which enhance the exploration ability of the algorithm. The neutralist group takes its own interests as the priority, supports the candidate who meet its own interests by comparing the candidate teams and improves the exploitation and exploration ability of the algorithm at the same time. The final CEO is confirmed in the authorization stage. In addition, a precocity judgment rule is introduced to ensure the effectiveness and rationality of the election process and improve the ability of the algorithm to escape from the local optimal region. The performance of CEOA is evaluated through twenty-one classical test functions, twenty-nine CEC2017 test functions, six real-world engineering optimization problems and three date clustering problems. The average value, standard deviation, Friedman mean rank and Wilcoxon signed rank are used as criteria. The above experiments are compared with the well-studied and recent optimizers, such as GA, PSO, DE, EO, MPA, AEFA, SHADE, ISOS, mSSA and PO. For the twenty-one classical test functions, in both cases of function shifting and without shifting, CEOA can gain the first rank, and its performance in high-dimensional search space also outperforms other algorithms. For the twenty-nine CEC2017 test functions, CEOA gain the third rank, only slightly behind SHADE and LSHADE-SPACMA. However, in the twenty-one classical test functions without shifting, Friedman mean rank of CEOA is 2.4762, while SHADE and LSHADE-SPACMA are only 4.5952 and 6.0476, respectively. The experimental results show that CEOA outperforms most of optimizers and is competitive compared with high-performance methods. In addition, CEOA ranks first on all six constrained engineering optimization problems and has good performance on three real-life datasets clustering problems, proving its applicability on real-world optimization problems. [ABSTRACT FROM AUTHOR]

The maximal covering location problem refers to the problem of finding an optimal placement of given number of facilities to a network. The objective is to maximize the total demands of the covered population within some constraints. Several metaheuristic approaches were proposed to solve the problem as it is an NP hard problem. In this article, we have proposed a chemical reaction optimization (CRO)-based approach to solve MCLP. CRO is a metaheuristic based on population to solve optimization problems. We are proposing a method to solve MCLP by redesigning four fundamental operators of CRO. Sometimes the solutions get trapped into local maxima, so an additional repair operator is also designed to find optimal solutions. The proposed algorithm is tested for both small and large scales of instances of datasets, which include benchmark as well as random ones. The proposed method gives best percentage of coverage results in 91.60% of instances, and for the remaining 8.40% of instances it produces results with average error value 0.10% which is very close to the optimal value. Nevertheless, the proposed method performs very well in terms of computational time for all test instances (100%) on all datasets compared to state-of-the-art method (Atta_GA). Wilcoxon signed-rank test has been performed on the results of the proposed method to observe the statistical significance. For both real-world and random instances, the results of the statistical test are significant. [ABSTRACT FROM AUTHOR]

In the past few decades, meta-heuristic algorithms have become a research hotspot in the field of evolutionary computing. The electric fish optimization algorithm (EFO) is a new meta-heuristic algorithm. Because of its simplicity and easy implementation, it has attracted the attention of researchers. However, it still faces premature convergence and poor balance between exploration and exploitation. To address this problems, an orthogonal electric fish optimization algorithm with quantization (QOXEFO) is proposed in this paper. In QOXEFO, orthogonal cross-design and quantification technique are employed to enhance the diversity of population and convergence precision of EFO. Secondly, the dynamic boundary mechanism is adopted to improve the convergence speed of EFO. At the same time, a sine-based update strategy of active electrolocation is used to change the direction of movement of individuals, thereby helping them jump out of the local optimum. Finally, the CEC2017 benchmark function and Speed reducer design problem are used to verify the performance of the proposed QOXEFO. Experimental results and statistical analysis show that compared with 9 famous evolutionary algorithms, QOXEFO is competitive in solution accuracy and convergence speed. [ABSTRACT FROM AUTHOR]

This study proposes a two-stage surrogate-assisted meta-heuristic algorithm named SDAMA-SPS to solve computationally expensive problems with high dimensions. In this algorithm, a surrogate-assisted monkey algorithm with dynamic adaptation (SDAMA) is presented to globally search for the best solution of the first stage, and a surrogate-based perturbation search (SPS) is designed to perform a more intensive local search for the final optimal solution. In the first stage, a global radial basis function (RBF) surrogate model is constructed with all historical solutions and is used to evaluate the positions of monkeys in the climb process and watch-jump process. Such global RBF model is updated with the positions of monkeys and their real objective function values after the second round of the climb process for each iteration. In the second stage, a local RBF surrogate model is built with a set of current best solutions, which can help to select the most promising sample so as to further locally improve the solution searched in the first stage. Experimental studies are conducted on eight benchmark optimization problems with the number of dimensions varying from 30 to 100, and numerical results show that the proposed algorithm achieves better performance than five other state-of-the-art surrogate-assisted algorithms with a limited budget of function evaluations. [ABSTRACT FROM AUTHOR]

Diabetes is a set of long-term metabolic issues characterized by high blood glucose levels over a drawn-out time. It is a challenging and threatening disease because nearly half of patients who have diabetes do not know that they have it. Data mining techniques have been heavily utilized to predict diabetes in its earliest stage, and therefore can potentially reduce medication costs. Most of the existing research used metaheuristics to optimize neural network parameters or used other data mining algorithms to classify diabetes. This research integrates design of experiments (DOE), genetic algorithm (GA), and multilayer perceptron (MLP) to classify diabetic patients. Two sets of factorial designs were used to determine an optimal set of parameters for the GA. GA is used to optimize the parameters in the MLP, where the MLP acts as a simulator within the GA to provide the fitness evaluation of the solutions. The best resulting solution from DOE–GA–MLP represents the optimized MLP that achieves the highest classification accuracy in diabetes patients. The proposed approach outperforms eight different classification algorithms in terms of accuracy, sensitivity, and F1-score. The developed DOE–GA–MLP model presents a robust predictive tool that can help healthcare professionals identify patients with diabetes in its early stage. Intervention and/or preventive strategies can be implemented in those identified cases to improve patient care and possibly reduce diabetes rates and potential expenditures. [ABSTRACT FROM AUTHOR]

In this era of trying to get more information from data, demand forecasting plays a very important role for companies. Companies implement many of their plans based on these forecasts. However, forecasting demand is not always easy. Demand is divided into many different classes depending on its structure. One of them is the problem of intermittent demand. Estimating intermittent demand is a more difficult problem than estimating series with low variability and no null demand. When working with intermittent demands, either a good demand forecast or a good inventory policy is required. Determining an efficient inventory policy is important in terms of meeting customer demand and customer satisfaction. In this study, an inventory lower bound and upper bound are calculated to balance the inventory cost of intermittent demand and the lost sale cost. For this purpose, 7 different test data with intermittent demand structure were studied. A mathematical model is proposed to calculate the cost with the upper and lower inventories under intermittent demand. A feasible solution could not be obtained with the proposed model, and a fitness function for the relevant model was proposed. This function was run on test data using genetic algorithm (GA) and particle swarm optimization (PSO). The results and solution times of GA and PSO were compared. In this way, the variability of demand and the difference between arrival times of demands were met with minimal cost. [ABSTRACT FROM AUTHOR]

To overcome the shortcomings of the traditional parameter identification methods of photovoltaic cell model, including low accuracy, slow convergence speed, easy to be trapped in local optimum so on, a parameter identification method of photovoltaic cell model based on improved elephant herding optimization algorithm is proposed in this paper. The fast-moving operator is used, which greatly improves the convergence speed and global searching ability of the algorithm. The elitist strategy is also introduced where the worst individual is replaced with the optimal individual to improve the convergence speed and shorten the optimization time of the algorithm. When applied to the parameter identification of the photovoltaic cell model, the identification result of the improved elephant herding optimization algorithm proves to be better than other algorithms. The parameter identification of the photovoltaic cell model under different radiation conditions is carried out, and the fitting result of identification data is highly consistent with the measured data. Experiments validate that the improved elephant herding optimization algorithm can accurately and effectively identify the parameters of the photovoltaic cell model in different environments. [ABSTRACT FROM AUTHOR]

In recent years, the Internet of Things (IoT) has led to the spread of cloud computing devices in all commercial, industrial and agricultural sectors. The use of cloud computing environment services is increasing exponentially with all technology applications based on IoT. Fog computing has led to addressing issues in cloud computing environments. Fog computing reduces load balancing, processing, bandwidth, and storage as data file replication from the cloud to the network closest to sensors in different geographic locations. There are three critical issues:—what data should be replicated?—when should the data be replicated? and—where the new replicas should be placed? These three main open questions must be tackled for data replication in the cloud environments. This strategy, the identification and mode of the data replication problem are designed as a multi-objective optimization with modern meta-heuristic optimization method. Therefore, a new hybrid method using Arithmetic Optimization Algorithm (AOA) and the salp swarm algorithm (SSA) is proposed in this paper. Firstly, a new hybrid metaheuristic method, using the Arithmetic Optimization Algorithm (AOA) and the salp swarm algorithm (SSA), is proposed to handle the problem of selection and placement data replication in fog computing. Secondly, the Floyd algorithm is used to strategy the least cost path, distance, and data transmission in different geographic locations. The performance of the designed AOASSA strategy to tackling the data replication problem is evaluated using different datasets of different sizes. To validate the AOASSA strategy, a set of experiments was carried out to validate the proposed strategy AOASSA. Experiment results show the superiority of AOASSA over its competitors in terms of performance measures, such as least cost path, distance, and bandwidth. [ABSTRACT FROM AUTHOR]

This study proposes a new metaheuristic algorithm, which is called Artificial Locust Swarm Optimization (ALSO), inspired by random jumping and plant invasion behavior of locust swarms. Locusts interact in two different ways of searching for food: social and familial. In the familial phase, small locust groups search foods in a local area and the locusts share their information in the social phase. The proposed algorithm is less likely to trap into the local solution than other methods and has high performance in the sensitivity of the global solution. In addition, it is effective not only for the solution of black-box optimization problems but also for the solution of problems with an irregular objective function. The ALSO algorithm is compared with other recent and well-known optimization algorithms on 22 benchmark functions and 3 real engineering design problems. Simulation results prove that the ALSO algorithm is very competitive when compared to the other algorithms. Moreover, it even requires the less runtime and memory space under the same conditions. [ABSTRACT FROM AUTHOR]

Aiming at the poor population diversity and serious imbalance between global exploration and local exploitation in the original fruit fly optimization algorithm (FOA), a novel elitist fruit fly optimization algorithm (EFOA) with elite guidance and population diversity maintenance is proposed. EFOA consists of two search phases: an osphresis search with elite and random individual guiding and a vision search with elite and boundary guiding in an iteration. The former contains two sub-stages: exploration with random individual guiding and exploitation with elite individual guiding. Randomly selected individual and flight control parameter constructed by the Sigmoid-based function are first introduced into the algorithm to improve the exploration. The elite guiding strategy with two position-update approaches is designed to augment the local ability of the proposed algorithm. With these stages, EFOA can search some areas of the problem space as much as possible. Finally, elite and boundary information is introduced into EFOA to enhance population diversity. The proposed EFOA is compared with other algorithms, including the original FOA, three outstanding FOA variants, and five state-of-the-art meta-heuristic algorithms. The validation tests are conducted based on the classical benchmark functions and CEC2017 benchmark functions. The Wilcoxon signed rank test and Friedman test are utilized to verify the significance of the results from the perspective of non-parametric statistics. The results demonstrate that the elite guiding strategy and the alternating execution of the three search stages can effectively balance the exploration and exploitation capabilities of the EFOA and enhance its convergence speed. [ABSTRACT FROM AUTHOR]

In this study, an entropy-based grey wolf optimizer (IEGWO) algorithm is proposed for solving global optimization problems. This improvement is proposed to alleviate the lack of population diversity, the imbalance between exploitation and exploration, and the premature convergence of grey wolf optimizer algorithm and consists of three aspects: Firstly, we proposed an information entropy-based population generation strategy to optimize the distribution of initial grey wolf pack. Secondly, a modified dynamic position update equation based on information entropy is introduced to maintain the population diversity in the process of iteration, thus avoiding premature convergence. Thirdly, a nonlinear convergence strategy is proposed to balance the exploration and exploitation. The performance of the proposed IEGWO algorithm is assessed on the CEC2014 and CEC2017 test suites and compared with other meta-heuristic algorithms. Furthermore, two engineering design problems and one real-world problem are also solved using the IEGWO algorithm. The experimental and statistical results indicate that the IEGWO algorithm has better solution accuracy and robustness than the compared algorithms in solving global optimization problems. [ABSTRACT FROM AUTHOR]

We study a novel version of the capacitated facility location problem, which includes incompatibilities among customers. For this problem, we propose and compare on a fair common ground a portfolio of metaheuristic techniques developed independently from each other. We tested our techniques on a new dataset composed of instances of increasing size, varying from medium to very large ones. The outcome is that the technique based on data mining has been able to outperform the others in most instances, except for a few large cases, for which it is overcome by the simpler greedy one. In order to encourage future comparisons on this problem, we make the instances, solution validator and implementations of the metaheuristic techniques available to the community. [ABSTRACT FROM AUTHOR]

The primary aim of Virtual Machine Placement (VMP) is the mapping of Virtual Machines (VMs) to Physical Machines (PMs), such that the PMs may be utilized to their maximum efficiency, where the already active VMs are not to be interrupted. It provides a list of live VM migrations that must be accomplished to get the optimum solution and reduces energy consumption significantly. The inefficient VMP leads to wastage of resources and excessive energy consumption and increases the overall operational cost of the data center. A Metaheuristic Virtual Machine Placement Framework towards the Power Efficiency of Sustainable Cloud Environment (MV-PESC) approach is suggested to address the issues mentioned above. An Extended Flower Pollination Optimization algorithm is suggested, which combines the concept of the Random Fit algorithm and the Flower Pollination Optimization algorithm. The proposed work's performance is evaluated using actual workload traces of the benchmark Google Cluster Data set. The obtained results are compared with various state-of-the-art and demonstrate a notable reduction in power consumption, the number of active PMs, and execution time up to 64.89%, 35%, and 21.12%, respectively. [ABSTRACT FROM AUTHOR]

Butterfly Optimization Algorithm (BOA) is a recent metaheuristic that has been used in several optimization problems. In this paper, we propose a new version of the algorithm (xBOA) based on the crossover operator and compare its results to the original BOA and 3 other variants recently introduced in the literature. We also proposed a framework for solving the unknown area exploration problem with energy constraints using metaheuristics in both single- and multi-robot scenarios. This framework allowed us to benchmark the performances of different metaheuristics for the robotics exploration problem. We conducted several experiments to validate this framework and used it to compare the effectiveness of xBOA with well-known metaheuristics used in the literature through 5 evaluation criteria. Although BOA and xBOA are not optimal in all these criteria, we found that BOA can be a good alternative to many metaheuristics in terms of the exploration time, while xBOA is more robust to local optima; has better fitness convergence; and achieves better exploration rates than the original BOA and its other variants. [ABSTRACT FROM AUTHOR]

Nowadays, all enterprises have adopted the means of informatization for enterprise management to adapt to the development of society. With the advent of the information age, enterprise transformation has become an inevitable trend. The management efficiency of enterprises is effectively improved, and the optimal scheduling and efficient management of personnel are realized to design and develop a human resource management (HRM) information system to meet the actual needs of enterprises. By studying the current problems of intelligent enterprise system and HRM information system, based on Java programming language, spring model–view–controller (MVC) web application system is combined with browser/server (B/S) framework, and construction is realized on an intelligent enterprise HRM information system. Aiming at the complexity of enterprise HRM, the meta-heuristic algorithm is adopted to optimize the human resource optimization scheduling module. Through the specific example data, the system implementation and model performance comparison experiments are carried out to further verify the effectiveness of the intelligent enterprise HRM information system proposed here. The results show that the HRM information system based on intelligent enterprise system realizes the effective collection and sorting of data, the running system meets the expected research objectives, and different modules can effectively perform specific functions; the algorithm based on meta-heuristic can realize the reasonable scheduling of personnel, and its model performance is significantly higher than the latest algorithm model. With the continuous increase in the number of events, what is improved is the optimal solution ability of the algorithm. Moreover, it decreases with the increase in the number of iterations, converging around 80 times, and the optimization efficiency reaches 86.35%; the system can find the optimal solution in a shorter time under the same number of iterations. Besides, after the system clustering, the accuracy of employee performance reaches 92%. The intellectualization of enterprise HRM greatly improves the office efficiency. [ABSTRACT FROM AUTHOR]

The concepts of generalized Hukuhara difference and interval differential equation play important role in the theory of interval uncertainty. These concepts have many applications in different branches of research, viz. optimization, information theory, inventory control and others. The goal of this work is to study an application of Hukuhara difference and interval differential equation in inventory management. In this paper, an inventory model for imperfect production process under warranty-dependent demand and carbon tax regulatory mechanism, is presented with the help of Hukuhara difference and interval differential equation. Also, using the interval arithmetic, the generalized Hukuhara difference, and the existence and uniqueness theorem of interval differential equation, the corresponding average profit function of this model is obtained. In order to maximize the average profit, a center-radius optimization technique is proposed. Some numerical examples are considered and solved by using different variant of quantum-behaved particle swarm optimization algorithms. [ABSTRACT FROM AUTHOR]

Vehicular ad hoc Networks (VANETs) can be designed in a way to organize road protection with no specific need for any fixed infrastructure. Accordingly, the movement of all vehicles can be planned according to perceived information, and Quality of Services Routing (QoSR) algorithms can be pressured according to its available options, paths, and links, and according to the criteria and reliability of the QoSR. Ensure that QoSR is aware of the environment of the network of vehicles, including location of vehicles, direction, and speed. This study is to reduce the effects of unpredictable problems on the best pathway to replace the broken path/link. A QoSR with Particle Swarm Optimization (QoSR-PSO) is used in this article for improving QoSs in vehicular ad hoc networks. By modeling the behavior of a group of particles, particle swarm optimization algorithms find the best possible solution to the problem. In order to perform simulation experiments, NS2 simulator and VanetMobisim have been used. The comparison results with benchmark studies show the improvement in packet delivery rate (PDR), delay, Packet Drop, and overload. [ABSTRACT FROM AUTHOR]

Hierarchical Single-Allocation Hub Median Facility Location Problem (SA-H-MP) is a well-known optimization problem having single objective function. The objective of SA-H-MP is to find a network of demand nodes, hubs and central hubs so that the service cost is minimized. In this article, we have proposed two meta-heuristic algorithms, Genetic Algorithm (GA) and its refined version and compare their performances with CPLEX (exact method), Simulated Annealing (SA) and Iterated Local Search (ILS). These approaches are validated on the well-known benchmark CAB data set. Proposed refined version of the GA is found to improve the result over other meta heuristics in more than 88% cases. [ABSTRACT FROM AUTHOR]

Archimedes optimization algorithm (AOA) is a new meta-heuristic algorithm which is based on Archimedes principle and mimics the buoyancy force received by an object in water. The AOA is designed according to physical principles and has been the object of many scholars' research because of its simple and reliable performance. In the course of the study, this paper finds that the AOA is flawed. In the iterative update of the algorithm, the buoyancy principle applied to the object is not completely followed. Through the investigation and analysis of this problem, it is found that the algorithm design which follows the buoyancy principle completely is more advantageously and persuasively, and named the corrected algorithm CAOA. The performance of the CAOA and other comparison optimization algorithms is tested in benchmark functions CEC2017 under equal conditions to verify the ideas proposed in this paper. In the solution accuracy with dimensions of 30 and 50, the comprehensive score of the CAOA is 31 and 33 and ranks first in all algorithms. In the statistical analysis, the CAOA compared with other algorithms one by one, and achieved the best results in all test functions. When compared with other algorithms, the CAOA ranked first. It is hoped that the verification of the ideas in this paper will help the AOA to develop better and optimize the development of the algorithm. [ABSTRACT FROM AUTHOR]

Optimizing aircraft maintenance, repair and overhaul (MRO) planning, i.e., reviewing aircraft history based on when and where the aircraft should be serviced, is essential to ensuring aviation safety and operations. This paper examines a method for optimizing the scheduling of MRO operations for complex products. It has been shown in the literature that scheduling optimization of MRO operations is an NP-hard problem. In this study, the planning problem for MRO service resources is first analyzed, a mathematical model for the MRO process planning problem is established, and a multi-objective mathematical model for minimizing makespan time, maintenance time, and cost is proposed to represent the planning problem. Then, to optimize the makespan time, maintenance time, and cost, we first generate the maintenance, repair and overhaul transaction path (MROTP) data to utilize the PLM system efficiently, which ensures the effective operation of MRO actions throughout the aircraft lifecycle. MROTP data are obtained with engineering studies in our proposed research, and received data are retained in the PLM system. Finally, the modified ACO algorithm that performs scheduling optimization of the MRO process and the integration process of PLM with MRO operations is presented. The proposed algorithm is tested and validated by simulations in MATLAB software with the data obtained from the leading MRO company in Turkey. The Gurobi Solver is used to obtain the optimal solution by converting the problem into mixed-integer linear programming (MILP). The experimental setup is run using Gurobi with a 1-hour time limit, and the best solution is considered with an average run time calculated in seconds. When solving complicated instances, the MILP model-based approach is challenging. The study and comparison of the findings demonstrate that the proposed ACO-based algorithms have an advantage in planning MRO operations. The proposed ACO algorithm performs better than the other metaheuristic algorithms and the MILP model regarding maintenance time and cost. [ABSTRACT FROM AUTHOR]

This study presents a boxing match algorithm (BMA) as a new efficient meta-heuristic method to solve numerical optimization and NP-hard problems, such as knapsack. The proposed algorithm finds the best position (i.e., best solution) in the ring during the match (i.e., feasible solutions) through a simulation of the boxer's behavior, who can attract good support from his coach and fans to defeat his rival. The proposed algorithm is seeking good solutions by dividing the solution space into different sections and generating new solutions in each section through a semi-zigzag search. This division causes a proper and targeted search in the solution space to reach an efficient solution. Also, the unique boxer's movement in the ring (generating new solutions) enables the proposed BMA to give an acceptable level of performance in exploring the problem space. Several unconstrained mathematical, knapsack, and engineering benchmark problems undergo a standard test designed to confirm the powerful performance of the proposed BMA. A wide variety of complex numerical problems are solved and analyzed by a comparison between the results obtained from the test and the other well-known optimization methods. Quantitative data also indicate the proper performance of the proposed algorithm compared to the other ones. The results show that this algorithm can achieve 95% and 100% optimal solutions in 20 mathematical benchmark functions and eight examples of the knapsack problem, respectively. [ABSTRACT FROM AUTHOR]

Segmentation refers to the process of dividing an image into multiple regions based on some criteria such as intensity and color. In recent years, color image segmentation has received considerable attention from the researchers. However, it is still a highly complicated task due to the presence of more attributes or components as compared to monochrome images. Numerous meta-heuristics algorithms are developed to determine the optimal threshold value for segmenting color images efficiently. This paper presents an enhanced sine cosine algorithm (ESCA) to seek threshold for segmenting color images. Sine cosine algorithm (SCA) is a population-based optimization algorithm which has the ability of preventing local minima problem. First an input image is transformed to CIE L*a*b* color reduced space. ESCA is applied to determine the optimal threshold values for segmentation. The performance of the proposed method is tested on color images from Berkeley database, and segmentation results are compared with two metaheuristic algorithms, namely particle swarm optimization (PSO) and standard SCA. Experimental results are validated by measuring peak signal–noise ratio (PSNR), structural similarity index and computation time for all the images investigated. Results revealed that the proposed method outperforms the other methods like PSO and SCA by achieving PSNR of 23 dB and SSIM of 0.93 and also require less time for finding optimal threshold values than PSO and SCA. [ABSTRACT FROM AUTHOR]

The fusion of visible and infrared (IR) images is considered as one of the most efficient image fusion methods so far, as more valuable information can be obtained from the fused images overcoming the sensor limitations. Even in poor lighting conditions, by utilizing the thermal (IR) radiation information, the details can be obtained from the IR sensors. Visual images provide better spectral, spatial, and texture details. Thus, integrating the IR and visual images will provide more information about an object in a scene, thus enhancing the decision-making process in surveillance applications. The proposed work is aimed to be an object detection framework that utilizes this image fusion technique to identify an object. However, when the query image has more features, the computational complexity for extraction and processing of those features for identification of an object increases. This reduces the detection accuracy of the system. Hence, an optimal set of features ought to be identified before proceeding into the classification and detection processes. To achieve this, the research work has proposed a nature-inspired optimal feature selection methodology using ant colony optimization. Finding the optimal features to reduce the computational complexity and thereby increase the accuracy of detection is the research objective. The fusion of IR and visible images is progressed using pulse-coupled neural network. The rest of the processes such as classification and detection are performed using the convolutional neural network model. Experimental results have been compared with conventional techniques in terms of accuracy and computation time. [ABSTRACT FROM AUTHOR]

The knapsack problem is one of the combinational optimization issues. This problem is an NP-hard problem. Soft computing methods, including the use of metaheuristic algorithms, are one way to deal with these types of problems. The standard Giza Pyramids Construction (GPC) algorithm is the first ancient-inspired algorithm that is published recently. In this paper, a binary version of the GPC algorithm for solving the 0-1 knapsack problem is proposed. For this purpose, this study uses both accumulative and multiplicative penalty functions as the objective function to determine infeasible solutions. To compare the performance, thirty different datasets have been created and the proposed algorithm has been compared with four popular and state-of-the-art algorithms. Statistical analysis has been used to find a significant difference in the performance of algorithms. The results and statistical analysis show that the proposed algorithm performs better than other metaheuristic algorithms. [ABSTRACT FROM AUTHOR]

Determination of the parameters of metaheuristic methods, such as particle swarm optimization (PSO) is a vital issue. Determining the optimal values of these parameters is a very difficult task and sometimes impossible so we focus on identifying the most important PSO parameters. For this purpose, statistical analysis of the relationship between the performance of the PSO algorithm with the proper selection of the PSO parameters should be done. Thus, unlike the earlier studies, here the most important PSO parameters are statistically determined. In the related literature, PSO parameters are traditionally determined by using trial and error method or specified intuitively. In this study, a new approach for identifying the most important PSO parameters for any optimization problem is proposed by using the factorial design which is one of the most popular and widely used statistical technique in experimental studies. Here, the parameters of the Weibull distribution which has a wide usage in the engineering and statistics literature are estimated just for illustration. It is obvious that identifying the most important PSO parameters via the proposed approach is very important to reduce the dimension of the search space for the PSO parameters. Statistical results obtained from the Monte Carlo simulation study are given and discussed at the end of the paper. [ABSTRACT FROM AUTHOR]

Combined heat and power economic dispatch (CHPED) problem is one of the challenging issues in power system control, and operation, that searches for the optimal values of power and heat generation of different units to minimize the total operation cost. The interdependency of heat and power outputs of CHP units and valve point loading effects of power-only units make this problem very nonlinear and non-convex. So far, a wide variety of optimization algorithms based on simulation of various natural phenomena have been proposed and applied to solve this complex problem, claiming that the proposed algorithm is better than the similar optimization algorithms in terms of accuracy and run-time. In this paper, the CHPED problem is investigated in different case studies by using the imperialist competitive Harris hawks optimization (ICHHO) algorithm, as a combination of the imperialist competitive algorithm and Harris hawks optimization. The effectiveness of the proposed algorithm is first evaluated by testing it on the standard cases of 5, and 7 units as small-scale systems and 48-unit as the large-scale test system, considering the electrical losses. Also for the first time, the multi-zone CHPED (MZCHPED) problem is solved by a metaheuristic algorithm. The obtained results show that ICHHO algorithm reduces the operating costs in the range of 0.02–1.1%, compared to the best-reported results, in different single-zone CHPED (SZCHPED) problems. Also, the MZCHPED results, prove the effective performance of the algorithm compared to the similar SZCHPED problem. [ABSTRACT FROM AUTHOR]

A biomedical application of a novel metaheuristic optimizer is proposed in this paper by constructing an enhanced arithmetic optimization algorithm (AOA). The latter algorithm was constructed using the logarithmic spiral (Ls) search mechanism from the whale optimization algorithm and the greedy selection scheme from the differential evolution algorithm. The proposed algorithm (Ls-AOA) was tested against unimodal and multimodal benchmark functions and demonstrated better capability comparatively using other efficient metaheuristic algorithms reported in the literature. The constructed Ls-AOA algorithm was then proposed to design a proportional-integral-derivative (PID) controller employed in a functional electrical stimulation (FES) system for the first time. The initial statistical and convergence profile assessment showed better performance of the proposed algorithm. The comparative analyses for transient and frequency responses were performed for the PID-controlled FES system using the original AOA, sine–cosine and particle swarm optimization algorithms and the traditional Ziegler-Nichols tuning scheme. Similarly, the FES system tuned with the latter methods was also assessed for disturbance rejection and noise elimination. All the comparative analyses demonstrated that the proposed Ls-AOA has the greater capability for the challenging biomedical FES system. [ABSTRACT FROM AUTHOR]

A modified Artificial Bee Colony (ABC) metaheuristics optimization technique is applied for cancer classification, that reduces the classifier's prediction errors and allows for faster convergence by selecting informative genes. Cuckoo search (CS) algorithm was used in the onlooker bee phase (exploitation phase) of ABC to boost performance by maintaining the balance between exploration and exploitation of ABC. Tuned the modified ABC algorithm by using Naïve Bayes (NB) classifiers to improve the further accuracy of the model. Independent Component Analysis (ICA) is used for dimensionality reduction. In the first step, the reduced dataset is optimized by using Modified ABC and after that, in the second step, the optimized dataset is used to train the NB classifier. Extensive experiments were performed for comprehensive comparative analysis of the proposed algorithm with well-known metaheuristic algorithms, namely Genetic Algorithm (GA) when used with the same framework for the classification of six high-dimensional cancer datasets. The comparison results showed that the proposed model with the CS algorithm achieves the highest performance as maximum classification accuracy with less count of selected genes. This shows the effectiveness of the proposed algorithm which is validated using ANOVA for cancer classification. [ABSTRACT FROM AUTHOR]

Multi-verse optimizer (MVO) algorithm is one of the recent metaheuristic algorithms used to solve various problems in different fields. However, MVO suffers from a lack of diversity which may trapping of local minima, and premature convergence. This paper introduces two steps of improving the basic MVO algorithm. The first step is using opposition-based learning (OBL) in MVO, called OMVO. The OBL aids to speed up the searching and improving the learning technique for selecting a better generation of candidate solutions of basic MVO. The second stage, called OMVOD, combines the disturbance operator (DO) and OMVO to improve the consistency of the chosen solution by providing a chance to solve the given problem with a high fitness value and increase diversity. To test the performance of the proposed models, fifteen CEC 2015 benchmark functions problems, thirty CEC 2017 benchmark functions problems and seven CEC 2011 real-world problems were used in both phases of the enhancement. The second step, known as OMVOD, incorporates the disruption operator (DO) and OMVO to improve the accuracy of the chosen solution by giving a chance to solve the given problem with a high fitness value while also increasing variety. Fifteen CEC 2015 benchmark functions problems, thirty CEC 2017 benchmark functions problems and seven CEC 2011 real-world problems were used in both phases of the upgrade to assess the accuracy of the proposed models. [ABSTRACT FROM AUTHOR]

Brain computer interfaces are important for different application domain such as medical, natural interfaces and entertainment. Besides the difficulty of gathering data from the human brain via different channel probs, preprocessing of data is another different and important task that must be solved in order to get better achievement. Selection of the most active channels is an important problem to achieve high classification accuracy. Metaheuristics are good solutions for selecting the optimal subset from the original set, as they have the ability to obtain an acceptable solution in a reasonable time. At the same time, it is necessary to use the correct feature extraction method so that the data can be properly represented. In addition, traditional deep learning methods used for emotion recognition ignore the spatial properties of EEG signals. This reduces the classification accuracy. In this study, we used artificial bee colony optimization algorithm on the seed dataset to increase the classification accuracy. We implemented and tested four different variations of this algorithm. Then, we extracted the features of the obtained channels with the Welch PSD method. We used enhanced capsule network as a machine learning algorithm and showed the best configuration to solve the problem. At the end of the process, 99.98% training and 99.83% test accuracy rates were obtained. [ABSTRACT FROM AUTHOR]

Teaching–learning-based optimization is one of the latest metaheuristic algorithms. TLBO has a simple framework and good global search ability. In addition, TLBO only needs population size and terminal condition for performing search tasks. Given these advantages, TLBO has been used widely since it was proposed. However, TLBO may fall into local optimal solutions in solving complex multimodal optimization problems. This paper reports an improved TLBO, namely competitive teaching–learning-based optimization, for solving multimodal optimization problems. In CTLBO, population is first divided into outstanding group and common group by the designed competitive mechanism. Then outstanding group is updated by the learning strategies of TLBO and common group is guided by outstanding group. In addition, a mutation operator for the optimal individual is introduced to increase the ability of CTLBO to escape from the local optima. The performance of CTLBO is investigated by 45 benchmark test functions from CEC 2014 and CEC 2015 test suites and three challenging real-world engineering problems. Experimental results show that CTLBO is more reliable and efficient on most test cases than TLBO and the other compared algorithms. This supports the effectiveness of the improved strategies and the superiority of CTLBO in solving multimodal optimization problems. [ABSTRACT FROM AUTHOR]

Millimeter-wave (mmWave) non-orthogonal multiple access (NOMA) is a promising transmission scheme to provide the required quality of service in the fifth generation (5G) mobile networks. NOMA improves spectral efficiency and throughput compared with orthogonal multiple access (OMA) in modern high diversity communication networks. Random beamforming deployment facilitates low latency transmission besides the reliable communication in the systems with massive connectivity. In this paper, we introduce a mmWave-NOMA system utilizing a sparse antenna array that substantially improves the system energy efficiency and offer low-weight, cost-effective and small-size antenna apparatus. We also introduce an optimum low complexity PSO-based algorithm to further improve the outage probability. The simulation and analysis results demonstrate 50% reduction in the outage probability in average by performing the PSO-based optimization algorithms. A comparison between the performance of PSO-based algorithm and some metaheuristic algorithms is performed. Due to the time and outage probability performances, our presented PSO-based algorithm gives better results. [ABSTRACT FROM AUTHOR]

Human facial analysis (HFA) has recently become an attractive topic for computer vision research due to technological progress and mobile applications. HFA explores several issues as gender recognition (GR), facial expression, age, and race recognition for automatically understanding social life. This study explores HFA from the angle of recognizing a person's gender from their face. Several hard challenges are provoked, such as illumination, occlusion, facial emotions, quality, and angle of capture by cameras, making gender recognition more difficult for machines. The Archimedes optimization algorithm (AOA) was recently designed as a metaheuristic-based population optimization method, inspired by the Archimedes theory's physical notion. Compared to other swarm algorithms in the realm of optimization, this method promotes a good balance between exploration and exploitation. The convergence area is increased By incorporating extra data into the solution, such as volume and density. Because of the preceding benefits of AOA and the fact that it has not been used to choose the best area of the face, we propose utilizing a wrapper feature selection technique, which is a real motivation in the field of computer vision and machine learning. The paper's primary purpose is to automatically determine the optimal face area using AOA to recognize the gender of a human person categorized by two classes (Men and women). In this paper, the facial image is divided into several subregions (blocks), where each area provides a vector of characteristics using one method from handcrafted techniques as the local binary pattern (LBP), histogram-oriented gradient (HOG), or gray-level co-occurrence matrix (GLCM). Two experiments assess the proposed method (AOA): The first employs two benchmarking datasets: the Georgia Tech Face dataset (GT) and the Brazilian FEI dataset. The second experiment represents a more challenging large dataset that uses Gallagher's uncontrolled dataset. The experimental results show the good performance of AOA compared to other recent and competitive optimizers for all datasets. In terms of accuracy, the AOA-based LBP outperforms the state-of-the-art deep convolutional neural network (CNN) with 96.08% for the Gallagher's dataset. [ABSTRACT FROM AUTHOR]

Out of the various types of skin cancers, melanoma is observed to be the most malignant and fatal type. Early detection of melanoma increases the chances of survival which necessitates the need to develop an intelligent classifier that classifies the dermoscopic images accurately as melanoma or non-melanoma. Features extracted from an image have a major impact on the performance of a classifier. In this paper, handcrafted feature extraction techniques are used to extract features from dermoscopic images. It is quite possible that not all the features extracted from dermoscopic images contribute in the process of classification which imposes the need of selection of significant features from the feature set. Here, two binary variants of Harris Hawk Optimization (HHO) algorithm namely BHHO-S and BHHO-V are presented that employ S-shaped and V-shaped transfer functions with time-dependent behavior, respectively, for feature selection. The selected features are given to a classifier that classifies the dermoscopic image as melanoma or non-melanoma. Comparison of the performance of the proposed methods is done with existing metaheuristic algorithms. The results obtained after experimentation show the superiority of classifier that uses features selected using BHHO-S over BHHO-V and the classifiers that use existing state-of-the-art metaheuristic algorithms. The experimental results also reveal that texture features extracted using local binary pattern along with color features provides higher classification accuracy as compared to global and other local texture feature extraction techniques. [ABSTRACT FROM AUTHOR]

Based on the basic principles of system dynamics, the mathematic description for the stock market evolution which is a typical complicated dynamic system is provided. And according to this mathematic description, a new hybrid intelligent method based on multi-layer feed-forward neural network (MFNN) which is the most widely used neural network and new improved black hole algorithm (IBHA) which is a new nature-inspired metaheuristic algorithm is proposed to model the stock market. In this new hybrid intelligent method, the new IBHA whose structure is simple and which can be implemented easily, and the modified back propagation algorithm have been used to optimize the architectural and algorithmic parameters of MFNN simultaneously. This new method is applied to model two data groups of Shanghai stock market in 2015.9–2018.8 of China to show that the computing results of the new method coincide well with the real data and that the forecasting precision is highly accurate in these cases. At last, the new method has been applied to model seven other stock market data sets and compared with five state-of-the-art hybrid algorithms proposed in previous studies. The results show that the performance of the new method (including modeling effect and efficiency) has been demonstrated to be satisfactory by using for different problem settings and market situations and it is also easy to be implemented. [ABSTRACT FROM AUTHOR]

Several population-based techniques have subsequently been proposed. Despite their broad use in a variety of applications, we are still investigating the use of proposed methods to tackle real-world challenges. As a result, researchers must considerably modify and enhance their approaches based on the primary evolutionary processes in order to achieve rapid convergence, consistent equilibrium with high-quality data, and optimization. The paper proposes a fusion method (AOA–GOA) meta-heuristic optimization methods for global optimization tasks. They can be applied to different problems, including image processing, machine learning, wireless networks, power systems, engineering design, etc. The method fusion proposed is analyzed in context with GOA and AOA. To evaluate the performance, each method is tested on the same parameters like population size and number of iteration. The proposed IAOA is evaluated by varying the dimensions. The impact of varying dimensions is a standard test used in previous studies for optimizing test functions that show the effect of varying dimensions on efficiency of IAOA. From this, it is noted that it works efficiently for both high and low dimensional problems. In high dimensional problem, the proposed method gives efficient search results. [ABSTRACT FROM AUTHOR]