Search

Economic Dispatch Problems (EDP) refer to the process of determining the power output of generation units such that the electricity demand of the system is satisfied at a minimum cost while technical and operational constraints of the system are satisfied. This procedure is vital in the efficient energy management of electricity networks since it can ensure the reliable and efficient operation of power systems. As power systems transition from conventional to modern ones, new components and constraints are introduced to power systems, making the EDP increasingly complex. This highlights the importance of developing advanced optimization techniques that can efficiently handle these new complexities to ensure optimal operation and cost-effectiveness of power systems. This review paper provides a comprehensive exploration of the EDP, encompassing its mathematical formulation and the examination of commonly used problem formulation techniques, including single and multi-objective optimization methods. It also explores the progression of paradigms in economic dispatch, tracing the journey from traditional methods to contemporary strategies in power system management. The paper categorizes the commonly utilized techniques for solving EDP into four groups: conventional mathematical approaches, uncertainty modelling methods, artificial intelligence-driven techniques, and hybrid algorithms. It identifies critical research gaps, a predominant focus on single-case studies that limit the generalizability of findings, and the challenge of comparing research due to arbitrary system choices and formulation variations. The present paper calls for the implementation of standardized evaluation criteria and the inclusion of a diverse range of case studies to enhance the practicality of optimization techniques in the field. [ABSTRACT FROM AUTHOR]

The mathematical side of applied problems in multiple subject areas (biology, pattern recognition, etc.) is reduced to the problem of discrete optimization in the following mathematical method. We were provided a network and graphs in its leaves, for which we needed to find a rearrangement of graphs by non-leaf nodes, in which the given functional reached its minimum. Such a problem, even in the simplest case, is NP-hard, which means unavoidable restrictions on the network, on graphs, or on the functional. In this publication, this problem is addressed in the case of all graphs being so-called "structures", meaning directed-loaded graphs consisting of paths and cycles, and the functional as the sum (over all edges in the network) of distances between structures at the endpoints of every edge. The distance itself is equal to the minimal length of sequence from the fixed list of operations, the composition of which transforms the structure at one endpoint of the edge into the structure at its other endpoint. The list of operations (and their costs) on such a graph is fixed. Under these conditions, the given discrete optimization problem is called the reconstruction problem. This paper presents novel algorithms for solving the reconstruction problem, along with full proofs of their low error and low polynomial complexity. For example, for the network, the problem is solved with a zero error algorithm that has a linear polynomial computational complexity; and for the tree the problem is solved using an algorithm with a multiplicative error of at most two, which has a second order polynomial computational complexity. [ABSTRACT FROM AUTHOR]

This paper is concerned with the design of a dual-loop control system for permanent magnet synchronous motor (PMSM). An improved linear extended state observer (LESO) with excellent estimation capability is employed to develop an improved linear active disturbance rejection control (LADRC) suitable for PMSM speed regulation, achieving outstanding disturbance suppression in PMSM speed control. The use of an internal model control scheme to initialize the parameters of the proportional-integral- (PI-) based current controller simplifies the search space of the control system parameter optimization. An improved particle swarm optimization (PSO) algorithm is applied to optimize the controller parameters, thereby enhancing the overall system performance. Finally, through a series of simulations and experiments, we validate that our proposed controller exhibits superior performance compared to some other control methods. [ABSTRACT FROM AUTHOR]

Aquila optimizer (AO) is an efficient meta-heuristic optimization method, which mimics the hunting style of Aquila in nature. However, the AO algorithm may suffer from immature convergence during the exploitation stage. In this paper, two strategies are elegantly employed into conventional AO, such as random opposition-based learning and nonlinear flexible jumping factor, which can efficiently enhance the performance of conventional AO. Experiments on 1 7 benchmark functions and image segmentation demonstrate the effectiveness of the proposed algorithm. Comparison with several state-of-the-art meta-heuristic optimization techniques indicates the efficacy of the developed method. [ABSTRACT FROM AUTHOR]

A wireless sensor network (WSN) consists of an extensive number of low-power sensor nodes to gather information from their environment and monitor physical activities. This makes node localization a crucial aspect in most WSN applications since measurement data is worthless unless the location from where the data is acquired is known precisely. The majority of localization solutions rely on anchor nodes for estimating the node locations with different localization accuracy, complexity, and hence different applicability. But, the cost and complexity in the localization of large-scale WSNs are not significantly reduced. In this paper, a novel Hybridized Dragonfly and Jaya Optimization technique (HyDAJ) is introduced for improving localization accuracy and performance of mobile WSNs. The proposed hybrid technique combines the advantages of Dragonfly algorithm and Jaya algorithm to localize the sensor nodes in a more efficient way and overcomes the limitations of the original algorithm. The hybrid algorithm verifies that all target nodes are precisely localized with higher accuracy. Simulation results reveal that HyDAJ outperforms existing methods under multiple metrics including localization efficiency, mean localization error, computation time, and energy consumption. [ABSTRACT FROM AUTHOR]

This document discusses the importance of optimization in various fields such as statistics, biology, finance, economics, and control. It highlights the advancements made in optimization theory and methods, including first-order methods and augmented Lagrangian methods. The document also introduces a special issue on "Symmetry in Optimization Theory, Algorithms and Applications," which features five papers on topics such as ensemble learning, ant colony system algorithms, subspace algorithms, consensus problems in multi-agent systems, and dynamic conditional correlation models. The authors express their gratitude to the contributors and reviewers of the special issue. [Extracted from the article]

Clean and renewable energy is the only way to achieve sustainable energy development, with considerable social and economic benefits. As a key technology for clean and renewable energy, it is very important to research the reliability optimization of microgrids. This paper reviews the research progress in microgrid reliability optimization. This paper first classifies and summarizes the existing research on microgrid control strategies and reliability assessment. Then, the system reliability optimization framework is summarized in terms of both microgrid systems and optimization objectives. Next, we summarize the most commonly used optimization algorithms for microgrid reliability for different microgrid systems. Finally, we provide a bibliometric analysis of the literature on the reliability research of microgrids. In addition, we propose some research challenges in the future for the reliability of microgrids. [ABSTRACT FROM AUTHOR]

The pursuit of achieving total power network observability in smart grids using Phasor Measurement Units (PMUs) carries a significant promise of real-time Wide-Area Monitoring, Protection, and Control (WAMPAC). PMU applications eliminate periodical measurements, thereby increasing accuracy through a high sampling rate of the measured power systems quantities. The high costs of installation of PMUs for total power system observability presents a challenge in the implementation of PMUs. This is due to the expensive costs of PMU devices. This has led to a prominent optimal PMU placement (OPP) problem that researchers tirelessly aim to solve by ensuring a complete power network observability while using the least installed PMU devices possible. In this paper, a novel Binary Firefly Algorithm (BFA) based on the node degree centrality scores of each bus is proposed to minimize PMU installations. The BFA solves the OPP problem in consideration of the effect of Zero Injection Buses (ZIBs) under normal operation and single PMU outage (SPO). The robustness and efficiency of the proposed algorithm is tested on IEEE-approved test systems and visualized with a force-directed technique on an undirected power network graph. The proposed BFA yields the same but better optimal PMU numbers, obtained by existing meta-heuristic optimization techniques found in the literature for each of the IEEE test cases, as well as highlighting the cost–benefit of having a robust system against single PMU loss while considering the ZIB effect for an improved system measurement availability. [ABSTRACT FROM AUTHOR]

There is a trend to deploy neural network on edge devices in recent years. While the mainstream of research often concerns with single edge device processing and edge-cloud two-layer neural network collaborative computing, in this paper, we propose partitioning multi-layer edge network for neural network collaborative computing. With the proposed method, sub-models of neural network are deployed on multi-layer edge devices along the communication path from end users to cloud. Firstly, we propose an optimal path selection method to form a neural network collaborative computing path with lowest communication overhead. Secondly, we establish a time-delay optimization mathematical model to evaluate the effects of different partitioning solutions. To find the optimal partition solution, an ordered elitist genetic algorithm (OEGA) is proposed. The experimental results show that, compared with traditional cloud computing, single-device edge computing and edge-cloud collaborative computing, the proposed multi-layer edge network collaborative computing has a smaller runtime delay with limited bandwidth resources, and because of the pipeline computing characteristics, the proposed method has a better response speed when processing large number of requests. Meanwhile, the OEGA algorithm has better performance than conventional methods, and the optimized partitioning method outperforms other methods like random and evenly partition. [ABSTRACT FROM AUTHOR]

In this paper, a heuristic approach to doubly fed induction generator (DFIG) protection and low voltage ride through (LVRT) is carried out. DFIG-based wind systems are rapidly penetrating the power generation section. Despite their advantages, their direct coupling grid makes them highly sensitive to symmetrical faults. A well-known solution to this is the crowbar method of DFIG protection. This paper provides a method to determine the optimal crowbar resistance value, to ensure a strong trade-off between the rotor current and DC voltage transients. Further, since the crowbar method requires disconnection from the grid, the linear quadratic regulator (LQR) is applied to the system. This is to ensure fault ride through compliance with recent grid code requirements. The well-known PSO, as well as the recently developed African vultures optimization algorithm (AVOA), was applied to the problem. The first set of results show that for severe symmetrical voltage dips, the AVOA provides a good option for crowbar magnitude optimization, whereas PSO performed better for moderately severe dips. Secondly, when the LQR was optimized via the AVOA, it exhibited superiority over the conventional PSO-based PI controller. This superiority was in terms of rotor current transient magnitude, DC voltage transient magnitude, and reactive power steady-state ripple and were in the order of 67.5%, 20.35%, and 37.55%, respectively. When comparing the crowbar method and the LQR, it was observed that despite the LQR exhibiting superiority in terms of transient performance, the crowbar method offered a unanimously superior settling time. [ABSTRACT FROM AUTHOR]

Unconstrained continuous large-scale global optimization (LSGO) is still a challenging task for a wide range of modern metaheuristic approaches. A cooperative coevolution approach is a good tool for increasing the performance of an evolutionary algorithm in solving high-dimensional optimization problems. However, the performance of cooperative coevolution approaches for LSGO depends significantly on the problem decomposition, namely, on the number of subcomponents and on how variables are grouped in these subcomponents. Also, the choice of the population size is still an open question for population-based algorithms. This paper discusses a method for selecting the number of subcomponents and the population size during the optimization process ("on fly") from a predefined pool of parameters. The selection of the parameters is based on their performance in the previous optimization steps. The main goal of the study is the improvement of coevolutionary decomposition-based algorithms for solving LSGO problems. In this paper, we propose a novel self-adapt evolutionary algorithm for solving continuous LSGO problems. We have tested this algorithm on 15 optimization problems from the IEEE LSGO CEC'2013 benchmark suite. The proposed approach, on average, outperforms cooperative coevolution algorithms with a static number of subcomponents and a static number of individuals. [ABSTRACT FROM AUTHOR]

Large-scale numerical optimization problems arise from many fields and have applications in both industrial and academic contexts. Finding solutions to such optimization problems efficiently requires algorithms that are able to leverage the increasing parallelism available in modern computing hardware. In this paper, we review previous work on parallelizing algorithms for nonlinear optimization. To introduce the topic, the paper starts by giving an accessible introduction to nonlinear optimization and high-performance computing. This is followed by a survey of previous work on parallelization and utilization of high-performance computing hardware for nonlinear optimization algorithms. Finally, we present a number of optimization software libraries and how they are able to utilize parallel computing today. This study can serve as an introduction point for researchers interested in nonlinear optimization or high-performance computing, as well as provide ideas and inspiration for future work combining these topics. [ABSTRACT FROM AUTHOR]

This article considers a box-constrained global optimization problem for Lipschitz continuous functions with an unknown Lipschitz constant. The well-known derivative-free global search algorithm DIRECT (DIvide RECTangle) is a promising approach for such problems. Several studies have shown that recent two-step (global and local) Pareto selection-based algorithms are very efficient among all DIRECT-type approaches. However, despite its encouraging performance, it was also observed that the candidate selection procedure has two possible shortcomings. First, there is no limit on how small the size of selected candidates can be. Secondly, a balancing strategy between global and local candidate selection is missing. Therefore, it may waste function evaluations by over-exploring the current local minimum and delaying finding the global one. This paper reviews and employs different strategies in a two-step Pareto selection framework (1-DTC-GL) to overcome these limitations. A detailed experimental study has revealed that existing strategies do not always improve and sometimes even worsen results. Since 1-DTC-GL is a DIRECT-type algorithm, the results of this paper provide general guidance for all DIRECT-type algorithms on how to deal with excessive local refinement more efficiently. [ABSTRACT FROM AUTHOR]

This paper presents the data description of the African buffalo optimization algorithm (ABO). ABO is a recently-designed optimization algorithm that is inspired by the migrant behaviour of African buffalos in the vast African landscape. Organizing their large herds that could be over a thousand buffalos using just two principal sounds, the /maaa/ and the /waaa/ calls present a good foundation for the development of an optimization algorithm. Since elaborate descriptions of the manual workings of optimization algorithms are rare in literature, this paper aims at solving this problem, hence it is our main contribution. It is our belief that elaborate manual description of the workings of optimization algorithms make it user-friendly and encourage reproducibility of the experimental procedures performed using this algorithm. Again, our ability to describe the algorithm's basic flow, stochastic and data generation processes in a language so simple that any non-expert can appreciate and use as well as the practical implementation of the popular benchmark Rosenbrock and Shekel Foxhole functions with the novel algorithm will assist the research community in benefiting maximally from the contributions of this novel algorithm. Finally, benchmarking the good experimental output of the ABO with those of the popular, highly effective and efficient Cuckoo Search and Flower Pollination Algorithm underscores the ABO as a worthy contribution to the existing body of population-based optimization algorithms [ABSTRACT FROM AUTHOR]

Considering that in the process of job scheduling, the cluster load should be prebalanced rather than remedied when the load is seriously unbalanced; therefore, in this paper, the task scheduling flow of the Hadoop cluster is analyzed deeply. On the Hadoop platform, a self-dividing algorithm is proposed for load balancing. An intelligent optimization algorithm is used to solve load balance. A dynamic feedback load balancing scheduling method is proposed from the point of view of task scheduling. In order to solve the shortcoming of the fair scheduling algorithm, this paper proposes two ways to improve the resource utilization and overall performance of Hadoop. When the mapping task is completed and the tasks to be reduced are assigned, the task assignment is based on the performance of the nodes to be reduced. It gives full play to the advantages of the ant colony algorithm and the hive colony algorithm so that the fusion algorithm can better deal with load balance. Then, three existing scheduling algorithms are introduced in detail: single queue scheduling, capacity scheduling, and fair scheduling. On this basis, an improved task scheduling strategy based on genetic algorithm is proposed to allocate and execute application tasks to reduce task completion time. The experiment verifies the effectiveness of the algorithm. The LBNP algorithm greatly improves the efficiency of reducing task execution and job execution. The delay capacity scheduling algorithm can ensure that most tasks can achieve localization scheduling, improve resource utilization, improve load balance, and speed up job completion time. [ABSTRACT FROM AUTHOR]

Based on the theory and application, this paper discusses the optimization of art image segmentation algorithm based on FFNN (Feed Forward Neural Network). In this paper, residual units are used in the corresponding stages of encoder and decoder, and feature information of several convolution layers in each convolution stage of encoder is extracted at the same time. And the feature pyramid module is used to extract multiscale features from the feature map of the last convolution stage in the encoder. Finally, pixel by pixel additions combine the previously mentioned feature information into the corresponding layer of the decoder. Additionally, an improved weight adaptive algorithm based on feature preservation is suggested in this paper, which addresses the issue that the conventional image segmentation algorithm is noise-sensitive. The adaptive connection weight mechanism is also introduced. The accuracy and recall rates of this optimization algorithm can both reach 96.574%, according to the results of 50% cross-validation. All the segmentation performance evaluation indexes of this algorithm are higher than the existing main algorithms. Moreover, the algorithm takes a short time, does not need too much manual intervention, and can effectively segment artistic images. The optimization algorithm in this paper has certain reference significance for the related research of artistic image segmentation. [ABSTRACT FROM AUTHOR]

In this paper, a new Modified Meta-Heuristic algorithm is proposed. This method contains some modifications to improve the performance of the simulated-annealing algorithm (SA). Most authors who deal with improving the SA algorithm presented some improvements and modifications to one or more of the five standard features of the SA algorithm. In this paper, we improve the SA algorithm by presenting some suggestions and modifications to all five standard features of the SA algorithm. Through these suggestions and modifications, we obtained a new algorithm that finds the approximate solution to the global minimum of a non-convex function. The new algorithm contains novel parameters, which are updated at each iteration. Therefore, the variety and alternatives in choosing these parameters demonstrated a noticeable impact on the performance of the proposed algorithm. Furthermore, it has multiple formulas by which the candidate solutions are generated. Diversity in these formulas helped the proposed algorithm to escape a local point while finding the global minimizer of a non-convex function. The efficiency of the proposed algorithm is reported through extensive numerical experiments on some well-known test problems. The performance profiles are used to evaluate and compare the performance of our proposed algorithm against the other five meta-heuristic algorithms. The comparison results between the performance of our suggested algorithm and the other five algorithms indicate that the proposed algorithm is competitive with, and in all cases superior to, the five algorithms in terms of the efficiency, reliability, and effectiveness for finding the global minimizers of non-convex functions. This superiority of the new proposed algorithm is due to those five modified standard features. [ABSTRACT FROM AUTHOR]

With the increasingly widespread application of UAV intelligence, the need for autonomous navigation and positioning is becoming more and more important. To solve the problem that UAV cannot perform localization in complex scenes, a new multi-source fusion framework factor graph optimization algorithm is used for UAV localization state estimation in this paper, which is based on IMU/GNSS/VO multi-source sensors. Based on the factor graph model and the iSAM incremental inference algorithm, a multi-source fusion model of IMU/GNSS/VO is established, including the IMU pre-integration factor, IMU bias factor, GNSS factor, and VO factor. Mathematical simulations and validations on the EuRoC dataset show that, when the selected sliding window size is 30, the factor graph optimization (FGO) algorithm can not only meet the requirements of real time and accuracy at the same time, but it also achieves a plug-and-play function in the event of local sensor failures. Finally, compared with the traditional federated Kalman algorithm and the adaptive federated Kalman algorithm, the positioning accuracy of the FGO algorithm in this paper is improved by 1.5–2-fold, and can effectively improve autonomous navigation system robustness and flexibility in complex scenarios. Moreover, the multi-source fusion framework in this paper is a general algorithm framework that can satisfy other scenarios and other types of sensor combinations. [ABSTRACT FROM AUTHOR]

In edge computing, application components can be placed over a range of computational devices from cloud data centers to nodes at the network edge. Application placement can have significant impact on important metrics like latency and resource utilization. Thus, application placement is an important optimization problem. In edge computing, the characteristics of both the infrastructure and the application may change over time, which may require the dynamic re-optimization of the application placement. Most algorithms suggested so far for the dynamic re-optimization of edge application placement are centralized, i.e., they rely on one entity collecting information from the whole infrastructure and making decisions centrally. However, centralized approaches suffer from limited scalability and are vulnerable to failures. In this paper, we present a decentralized approach for the dynamic re-optimization of edge application placement. We adopt an algorithm of Malek et al. for distributed systems and modify it to make it applicable to edge computing. In this approach, each node makes decisions autonomously, using auctions for coordination. Our empirical results demonstrate that the proposed algorithm is very effective in optimizing edge application placement. In an edge system with 637 edge nodes and 563 end devices, our algorithm achieves 54% higher reduction of application latency than a previous decentralized algorithm. • Optimized placement of application components on cloud and edge devices. • Decentralized optimization algorithm using local knowledge and local modifications. • Auctions and distributed locking for synchronization. • Minimization of application latency. [ABSTRACT FROM AUTHOR]

The soil water retention curve (SWRC) has a significant role in determining the unsaturated properties of soil. A stochastic optimisation algorithm named Rao-1 algorithm is employed to estimate the parameters of the SWRC model in this paper. The Rao-1 algorithm is a simple heuristic search algorithm containing only addition and multiplication operations. This paper introduces the method and its application in determining soil water retention this model parameters in detail. In this study, the van Genuchten model is used to depict the SWRC for its good fitting capacity, and the van Genuchten model parameters are determined using Rao-1 algorithm. The feasibility and efficiency of the proposed method are validated via the experimental results of 24 soil samples of 12 soil textural classes. Besides, the performance of Rao-1 algorithm is compared with that of salp swarm algorithm, the particle swarm optimization algorithm, differential evolution algorithm, and RETC program. Through comparative analysis, Rao-1 algorithm outperforms other methods in determining SWRC parameters. [ABSTRACT FROM AUTHOR]

Although the existing protein recognition methods have improved the recognition accuracy of key proteins to a certain extent, they have ignored the biological features of the proteins. In view of this shortcoming, this paper constructed a high-order dynamic complex protein network for key protein recognition. At first, this paper presented a method for feature selection and candidate set evaluation of complex protein network; a weighted network was constructed based on the obtained topological features of the complex protein network and the semantic similarity of protein gene ontology annotations. Then, this paper proposed an algorithm for recognizing key proteins in high-order dynamic protein network based on a Fruit fly optimization algorithm. At last, the effectiveness of the proposed model was verified by experimental results. [ABSTRACT FROM AUTHOR]

Numerous research based on offline Tamil recognition deals only with few Tamil characters since it becomes extremely complicated in distinguishing small variations in large handwritten document. The writer's complexity affects the overall formation of the characters. Such types of complexities are due to discontinuation of structures, unnecessary over loops, variation in shapes as well as irregular curves. This complex issue results in enhanced error value rate. Therefore, to conquer such issues, this paper proposes a novel approach to enhance the offline Tamil handwritten character recognition by utilizing four principal steps: pre-processing, segmentation, feature extraction and classification. For optimal segmentation of Tamil characters, this paper utilizes the Tsallis entropy approach-based atom search (TEAS) optimization algorithm. Then a Newton algorithm based deep convolution extreme learning (DELM) approach is utilized for the extraction and classification of input images. Finally, experiments are carried out for numerous Tamil handwritten recognition-based approaches. The proposed Tamil character recognition utilizes the datasets of isolated Tamil handwritten characters established by HP lab India to evaluate the efficiency of the system. [ABSTRACT FROM AUTHOR]

Abstract: During a Wet End break, the loss of paper feed through the paper machine causes loss of sensory information and the remaining parts of the process are operated in open-loop. This causes the stock composition in the Headbox to deviate substantially from the nominal specifications, causing paper quality (after start up) and paper machine runability issues. In this work, the Base Sheet Ash measurement of the scanner is estimated using a least absolute value (LAV) model which can then be used for control of the chalk valve during the breaks to keep the Headbox Ash within specified limits. The model is computed using a very fast optimization algorithm which is able to compute the LAV solution using only basic elementary operations. The proposed approach has been developed for a UK paper mill. [Copyright &y& Elsevier]

In many statistical learning problems, it is desired that the optimal solution conform to an a priori known sparsity structure represented by a directed acyclic graph. Inducing such structures by means of convex regularizers requires nonsmooth penalty functions that exploit group overlapping. Our study focuses on evaluating the proximal operator of the latent overlapping group lasso developed by Jacob et al. in 2009. We implemented an alternating direction method of multiplier with a sharing scheme to solve large-scale instances of the underlying optimization problem efficiently. In the absence of strong convexity, global linear convergence of the algorithm is established using the error bound theory. More specifically, the paper contributes to establishing primal and dual error bounds when the nonsmooth component in the objective function does not have a polyhedral epigraph. We also investigate the effect of the graph structure on the speed of convergence of the algorithm. Detailed numerical simulation studies over different graph structures supporting the proposed algorithm and two applications in learning are provided. Summary of Contribution: The paper proposes a computationally efficient optimization algorithm to evaluate the proximal operator of a nonsmooth hierarchical sparsity-inducing regularizer and establishes its convergence properties. The computationally intensive subproblem of the proposed algorithm can be fully parallelized, which allows solving large-scale instances of the underlying problem. Comprehensive numerical simulation studies benchmarking the proposed algorithm against five other methods on the speed of convergence to optimality are provided. Furthermore, performance of the algorithm is demonstrated on two statistical learning applications related to topic modeling and breast cancer classification. The code along with the simulation studies and benchmarks are available on the corresponding author's GitHub website for evaluation and future use. [ABSTRACT FROM AUTHOR]

• A robust method is proposed to alleviate the effect of traffic data with outliers. • A comprehensive traffic flow prediction indicator system is established in this paper. • We hybridize polynomial and Gaussian kernel to build nonlinear version of our method. • Parameters of the proposed method are optimized by Fruit Fly Optimization Algorithm. A novel least squares twin support vector regression method is proposed based on the robust L 1 -norm distance to alleviate the negative effect of traffic data with outliers. Although there is some known work for the short-term traffic flow prediction problems, their efficacy depends heavily on the collected traffic data, which are often affected by various external factors (e.g. weather, traffic jam or accident), leading to errors and missing data. This makes it difficult to pick an effective method that accurately predicts the traffic state. As a contribution of this paper, an iterative algorithm is designed to solve the non-smooth L 1 -norm terms of our method; its convergence also proved. Further, a comprehensive traffic flow indicator system based on speed, traffic flow, occupancy and ample degree is utilized in this paper. We also extend the proposed method to a nonlinear version by hybridizing the polynomial kernel and radial basis function kernel, where the weight coefficient of hybrid kernel is determined by the change tendency of traffic data. To promote the prediction performance, the parameters of our nonlinear method are optimized by adaptive fruit fly optimization algorithm. Extensive experiments on real traffic data are performed to evaluate our model. The results indicate that the newly constructed model yields better prediction performance and robustness than other models in various experimental settings. [ABSTRACT FROM AUTHOR]

• Formulate a non-cooperative game with both UEs and MECs as players. • Prove the existence of and convergence to a Nash equilibrium. • Develop a set of algorithms to find the Nash equilibrium. • Demonstrate numerical examples of non-cooperative games with and without MECs' participation. In a newly emerged fog computing environment, various user equipments (UE) enhance their computing power and extend their battery lifetime by computation offloading to mobile edge cloud (MEC) servers. Such an environment is distributed and competitive in nature. In this paper, we take a game theoretical approach to computation offloading optimization in a fog computing environment. Such an approach captures and characterizes the nature of a competitive environment. The main contributions of the paper can be summarized as follows. First, we formulate a non-cooperative game with both UEs and MECs as players. Each UE attempts to minimize the execution time of its tasks with an energy constraint. Each MEC attempts to minimize the product of its power consumption for computation and execution time for allocated tasks. Second, we develop a heuristic algorithm for a UE to determine its "heuristically" best response to the current situation, an algorithm for an MEC to determine its best response to the current situation, and an iterative algorithm to find the Nash equilibrium. Third, we prove that our iterative algorithm converges to a Nash equilibrium. We demonstrate numerical examples of our non-cooperative games with and without MECs' participation. We observe that our iterative algorithm always quickly converges to a Nash equilibrium. The uniqueness of our non-cooperative games is that the strategy set of a player can be discrete and the payoff function of a player can be obtained by a heuristic algorithm for combinatorial optimization. To the best of the author's knowledge, there has been no such investigation of non-cooperative games based on combinatorial optimization for computation offloading optimization in a fog computing environment. [ABSTRACT FROM AUTHOR]

The paper presents a new method of optimization by the Layered Algorithm (LA). The proposed algorithm reduces the initial area to the sub-area containing the optimum. The proposed technique is based on the classification of the optimized function values (data sampled by sensors). The classification method uses a two-dimensional three-state Cellular Automata (CA). The CA classifies all area points ascribed to the CA cells based on their values. Specification of the categorization layers to the data gives a possibility to identify the different levels areas. Consequently, after analysis, a sub-area containing the optimum can be designated. In this paper, the proposed algorithm is applied to find the location of the airborne contaminant source by analyzing the concentration of released substances reported by mobile sensors distributed over the domain of interest. The Gaussian dispersion model simulation of the contaminant dispersion in the urbanized area is applied to generate the data used to verify the efficiency of the proposed Layered Algorithm. The LA successfully estimates the sub-area of the considered domain where the contamination source is located, taking to account data from sensors solely. • Optimization method reducing the initial area to the sub-area containing the optimum. • Verification of the Layered Algorithm (LA) with Selected Benchmark Functions. • Analysis of the LA efficiency to localize the airborne contaminant source. • LA results assessment by the measures: classification and accuracy error, relevance. [ABSTRACT FROM AUTHOR]

In biomedical data mining, the gene dimension is often much larger than the sample size. To solve this problem, we need to use a feature selection algorithm to select feature gene subsets with a strong correlation with phenotype to ensure the accuracy of subsequent analysis. This paper presents a new three-stage hybrid feature gene selection method, that combines a variance filter, extremely randomized tree, and whale optimization algorithm. First, a variance filter is used to reduce the dimension of the feature gene space, and an extremely randomized tree is used to further reduce the feature gene set. Finally, the whale optimization algorithm is used to select the optimal feature gene subset. We evaluate the proposed method with three different classifiers in seven published gene expression profile datasets and compare it with other advanced feature selection algorithms. The results show that the proposed method has significant advantages in a variety of evaluation indicators. [ABSTRACT FROM AUTHOR]

The efficiency and the effectiveness of a machine learning (ML) model are greatly influenced by feature selection (FS), a crucial preprocessing step in machine learning that seeks out the ideal set of characteristics with the maximum accuracy possible. Due to their dominance over traditional optimization techniques, researchers are concentrating on a variety of metaheuristic (or evolutionary) algorithms and trying to suggest cutting-edge hybrid techniques to handle FS issues. The use of hybrid metaheuristic approaches for FS has thus been the subject of numerous research works. The purpose of this paper is to critically assess the existing hybrid FS approaches and to give a thorough literature review on the hybridization of different metaheuristic/evolutionary strategies that have been employed for supporting FS. This article reviews pertinent documents on hybrid frameworks that were published in the period from 2009 to 2022 and offers a thorough analysis of the used techniques, classifiers, datasets, applications, assessment metrics, and schemes of hybridization. Additionally, new open research issues and challenges are identified to pinpoint the areas that have to be further explored for additional study. [ABSTRACT FROM AUTHOR]

The importance of the time-cost-quality trade-off problem in construction projects has been widely recognized. Its goal is to minimize time and cost and maximize quality. In this paper, the bonus-penalty mechanism is introduced to improve the traditional time-cost model, and considering the nonlinear relationship between quality and time, a nonlinear time-cost quality model is established. Meanwhile, in order to better solve the time-cost-quality trade-off problem, a multi-objective immune wolf colony optimization algorithm has been proposed. The hybrid method combines the fast convergence of the wolf colony algorithm and the excellent diversity of the immune algorithm to improve the accuracy of the wolf colony search process. Finally, a railway construction project is taken as an example to prove the effectiveness of the method. [ABSTRACT FROM AUTHOR]

Meta-heuristic algorithms are widely used in complex problems that cannot be solved by traditional computing methods due to their powerful optimization capabilities. However, for high-complexity problems, the fitness function evaluation may take hours or even days to complete. The surrogate-assisted meta-heuristic algorithm effectively solves this kind of long solution time for the fitness function. Therefore, this paper proposes an efficient surrogate-assisted hybrid meta-heuristic algorithm by combining the surrogate-assisted model with gannet optimization algorithm (GOA) and the differential evolution (DE) algorithm, abbreviated as SAGD. We explicitly propose a new add-point strategy based on information from historical surrogate models, using information from historical surrogate models to allow the selection of better candidates for the evaluation of true fitness values and the local radial basis function (RBF) surrogate to model the landscape of the objective function. The control strategy selects two efficient meta-heuristic algorithms to predict the training model samples and perform updates. A generation-based optimal restart strategy is also incorporated in SAGD to select suitable samples to restart the meta-heuristic algorithm. We tested the SAGD algorithm using seven commonly used benchmark functions and the wireless sensor network (WSN) coverage problem. The results show that the SAGD algorithm performs well in solving expensive optimization problems. [ABSTRACT FROM AUTHOR]

Single image dehazing has been a challenge in the field of image restoration and computer vision. Many model-based and non-model-based dehazing methods have been reported. This study focuses on a model-based algorithm. A popular model-based method is dark channel prior (DCP) which has attracted a lot of attention because of its simplicity and effectiveness. In DCP-based methods, the model parameters should be appropriately estimated for better performance. Previously, we found that appropriate scaling factors of model parameters helped dehazing performance and proposed an improved DCP (IDCP) method that uses heuristic scaling factors for the model parameters (atmospheric light and initial transmittance). With the IDCP, this paper presents an approach to find optimal scaling factors using the whale optimization algorithm (WOA) and haze level information. The WOA uses ground truth images as a reference in a fitness function to search the optimal scaling factors in the IDCP. The IDCP with the WOA was termed IDCP/WOA. It was observed that the performance of IDCP/WOA was significantly affected by hazy ground truth images. Thus, according to the haze level information, a hazy image discriminator was developed to exclude hazy ground truth images from the dataset used in the IDCP/WOA. To avoid using ground truth images in the application stage, hazy image clustering was presented to group hazy images and their corresponding optimal scaling factors obtained by the IDCP/WOA. Then, the average scaling factors for each haze level were found. The resulting dehazing algorithm was called optimized IDCP (OIDCP). Three datasets commonly used in the image dehazing field, the RESIDE, O-HAZE, and KeDeMa datasets, were used to justify the proposed OIDCP. Then a comparison was made between the OIDCP and five recent haze removal methods. On the RESIDE dataset, the OIDCP achieved a PSNR of 26.23 dB, which was better than IDCP by 0.81 dB, DCP by 8.03 dB, RRO by 5.28, AOD by 5.6 dB, and GCAN by 1.27 dB. On the O-HAZE dataset, the OIDCP had a PSNR of 19.53 dB, which was better than IDCP by 0.06 dB, DCP by 4.39 dB, RRO by 0.97 dB, AOD by 1.41 dB, and GCAN by 0.34 dB. On the KeDeMa dataset, the OIDCP obtained the best overall performance and gave dehazed images with stable visual quality. This suggests that the results of this study may benefit model-based dehazing algorithms. [ABSTRACT FROM AUTHOR]

In recent years, model-agnostic meta-learning (MAML) has become a popular research area. However, the stochastic optimization of MAML is still underdeveloped. Existing MAML algorithms rely on the "episode" idea by sampling a few tasks and data points to update the meta-model at each iteration. Nonetheless, these algorithms either fail to guarantee convergence with a constant mini-batch size or require processing a large number of tasks at every iteration, which is unsuitable for continual learning or cross-device federated learning where only a small number of tasks are available per iteration or per round. To address these issues, this paper proposes memory-based stochastic algorithms for MAML that converge with vanishing error. The proposed algorithms require sampling a constant number of tasks and data samples per iteration, making them suitable for the continual learning scenario. Moreover, we introduce a communication-efficient memory-based MAML algorithm for personalized federated learning in cross-device (with client sampling) and cross-silo (without client sampling) settings. Our theoretical analysis improves the optimization theory for MAML, and our empirical results corroborate our theoretical findings. Interested readers can access our code at https://github.com/bokun-wang/moml. [ABSTRACT FROM AUTHOR]

In the optimization of dynamic systems, the variables typically have constraints. Such problems can be modeled as a Constrained Markov Decision Process (CMDP). This paper considers the peak Constrained Markov Decision Process (PCMDP), where the agent chooses the policy to maximize total reward in the finite horizon as well as satisfy constraints at each epoch with probability 1. We propose a model-free algorithm that converts PCMDP problem to an unconstrained problem and a Q-learning based approach is applied. We define the concept of probably approximately correct (PAC) to the proposed PCMDP problem. The proposed algorithm is proved to achieve an (ε, p)-PAC policy when the episode K ≥ Ω(...), where S and A are the number of states and actions, respectively. H is the number of epochs per episode. I is the number of constraint functions, and l = log(SAT/p). We note that this is the first result on PAC kind of analysis for PCMDP with peak constraints, where the transition dynamics are not known apriori. We demonstrate the proposed algorithm on an energy harvesting problem and a single machine scheduling problem, where it performs close to the theoretical upper bound of the studied optimization problem. [ABSTRACT FROM AUTHOR]

This paper solves the shortcomings of sparrow search algorithm in poor utilization to the current individual and lack of effective search, improves its search performance, achieves good results on 23 basic benchmark functions and CEC 2017, and effectively improves the problem that the algorithm falls into local optimal solution and has low search accuracy. This paper proposes an improved sparrow search algorithm based on iterative local search (ISSA). In the global search phase of the followers, the variable helix factor is introduced, which makes full use of the individual's opposite solution about the origin, reduces the number of individuals beyond the boundary, and ensures the algorithm has a detailed and flexible search ability. In the local search phase of the followers, an improved iterative local search strategy is adopted to increase the search accuracy and prevent the omission of the optimal solution. By adding the dimension by dimension lens learning strategy to scouters, the search range is more flexible and helps jump out of the local optimal solution by changing the focusing ability of the lens and the dynamic boundary of each dimension. Finally, the boundary control is improved to effectively utilize the individuals beyond the boundary while retaining the randomness of the individuals. The ISSA is compared with PSO, SCA, GWO, WOA, MWOA, SSA, BSSA, CSSA, and LSSA on 23 basic functions to verify the optimization performance of the algorithm. In addition, in order to further verify the optimization performance of the algorithm when the optimal solution is not 0, the above algorithms are compared in CEC 2017 test function. The simulation results show that the ISSA has good universality. Finally, this paper applies ISSA to PID parameter tuning and robot path planning, and the results show that the algorithm has good practicability and effect. [ABSTRACT FROM AUTHOR]

Aiming at the problems existing in the traditional teaching mode, this paper intelligently optimizes English teaching courses by using multidirectional mutation genetic algorithm and its optimization neural network method. Firstly, this paper gives the framework of intelligent English course optimization system based on multidirectional mutation genetic BP neural network and analyses the local optimization problems existing in the traditional BP algorithm. A BP neural network optimization algorithm based on multidirectional mutation genetic algorithm (MMGA-BP) is presented. Then, the multidirectional mutation genetic BPNN algorithm is applied to the intelligent optimization of English teaching courses. The simulation shows that the multidirectional mutation genetic BP neural network algorithm can solve the local optimization problem of traditional BP neural network. Finally, a control group and an experimental group are set up to verify the role of multidirectional mutation genetic algorithm and its optimization neural network in the intelligent optimization system of English teaching courses through the combination of summative and formative teaching evaluations. The data show that MMGA-BP algorithm can significantly improve the scores of academic students in English courses and has better teaching performance. The effect of vocabulary teaching under the guidance of MMGA-BP optimization theory is very significant, which plays a certain role in the intelligent curriculum optimization of the experimental class. [ABSTRACT FROM AUTHOR]

The decomposition-based algorithm, for example, multiobjective evolutionary algorithm based on decomposition (MOEA/D), has been proved effective and useful in a variety of multiobjective optimization problems (MOPs). On the basis of MOEA/D, the MOEA/D-DE replaces the simulated binary crossover (SBX) operator with differential evolution (DE) operator, which is used to enhance the diversity of the solutions more effectively. However, the amplification factor and the crossover probability are fixed in MOEA/D-DE, which would lead to a low convergence rate and be more likely to fall into local optimum. To overcome such a prematurity problem, this paper proposes three different adaptive operators in DE with crossover probability and amplification factors to adjust the parameter settings adaptively. We incorporate these three adaptive operators in MOEA/D-DE and MOEA/D-PaS to solve MOPs and many-objective optimization problems (MaOPs), respectively. This paper also designs a sensitive experiment for the changeable parameter η in the proposed adaptive operators to explore how η would affect the convergence of the proposed algorithms. These adaptive algorithms are tested on many benchmark problems, including ZDT, DTLZ, WFG, and MaF test suites. The experimental results illustrate that the three proposed adaptive algorithms have better performance on most benchmark problems. [ABSTRACT FROM AUTHOR]

Recent advancements in computer science include some optimization models that have been developed and used in real applications. Some metaheuristic search/optimization algorithms have been tested to obtain optimal solutions to speed controller applications in self-driving cars. Some metaheuristic algorithms are based on social behaviour, resulting in several search models, functions, and parameters, and thus algorithm-specific strengths and weaknesses. The present paper proposes a fitness function on the basis of the mathematical description of proportional integrative derivate controllers showing that mean square error is not always the best measure when looking for a solution to the problem. The fitness developed in this paper contains features and equations from the mathematical background of proportional integrative derivative controllers to calculate the best performance of the system. Such results are applied to quantitatively evaluate the performance of twenty-one optimization algorithms. Furthermore, improved versions of the fitness function are considered, in order to investigate which aspects are enhanced by applying the optimization algorithms. Results show that the right fitness function is a key point to get a good performance, regardless of the chosen algorithm. The aim of this paper is to present a novel objective function to carry out optimizations of the gains of a PID controller, using several computational intelligence techniques to perform the optimizations. The result of these optimizations will demonstrate the improved efficiency of the selected control schema. [ABSTRACT FROM AUTHOR]

One of the useful knowledge representation tools, which can describe the joint probability distribution between some random variables with a graphical model and can be trained by a dataset, is the Bayesian network (BN). A BN is composed of a network structure and a conditional probability distribution table for each node. Discovering an optimal BN structure is an NP‐hard optimization problem that various meta‐heuristic algorithms are applied to solve this problem by researchers. The genetic algorithms, ant colony optimization, evolutionary programming, artificial bee colony, and bacterial foraging optimization are some of the meta‐heuristic methods to solve this problem using a dataset. Most of these methods are applying a scoring metric to generate the best network structure from a set of candidates. A Fixed Structure Learning Automata‐Based (FSLA‐B) algorithm is presented in this paper to solve the structure learning problem of BNs. There is a fixed structure learning automaton for each pair of vertices in the BN's graph structure in the proposed algorithm. The action of this automaton determines the presence and direction of an edge between the vertices. The proposed algorithm performs a guided search procedure using the FSLA and escapes from local optimums. Several datasets are utilised in this paper to evaluate the performance of the proposed algorithm. By performing various experiments, multiple meta‐heuristic algorithms are compared with the introduced new one. The obtained results represented that the proposed algorithm could produce competitive results and find the near‐optimal solution for the BN structure learning problem. [ABSTRACT FROM AUTHOR]

At present, there are some problems in the process of human motion recognition, such as poor timeliness and low fault tolerance rate. How to effectively identify the motion process accurately has become a hot spot in the optimization system. In the existing research studies, the recognition accuracy is not very good and the response time is long. To end this issue, the paper proposed an information processing system and optimization method of human motion recognition based on the GA-BP neural network algorithm. Firstly, a human motion recognition system based on dynamic capture recognition technology is designed, which realizes the recognition of motion information from common postures such as action span, speed change, motion trajectory, and other aspects in the process of human motion. Secondly, the proposed algorithm is used to comprehensively analyse and evaluate the motion state. Finally, experiments are designed to verify and analyse the results. Compared to some baseline methods in human motion recognition information systems, the system in this paper based on the GA-BP neural network algorithm has the advantages of higher data accuracy and response speed, which can quickly and accurately identify the muscle group change in the process of human motion, and it can also provide customized motion suggestions based on the results. [ABSTRACT FROM AUTHOR]

The deep Q-network (DQN) is one of the most successful reinforcement learning algorithms, but it has some drawbacks such as slow convergence and instability. In contrast, the traditional reinforcement learning algorithms with linear function approximation usually have faster convergence and better stability, although they easily suffer from the curse of dimensionality. In recent years, many improvements to DQN have been made, but they seldom make use of the advantage of traditional algorithms to improve DQN. In this paper, we propose a novel Q-learning algorithm with linear function approximation, called the minibatch recursive least squares Q-learning (MRLS-Q). Different from the traditional Q-learning algorithm with linear function approximation, the learning mechanism and model structure of MRLS-Q are more similar to those of DQNs with only one input layer and one linear output layer. It uses the experience replay and the minibatch training mode and uses the agent's states rather than the agent's state-action pairs as the inputs. As a result, it can be used alone for low-dimensional problems and can be seamlessly integrated into DQN as the last layer for high-dimensional problems as well. In addition, MRLS-Q uses our proposed average RLS optimization technique, so that it can achieve better convergence performance whether it is used alone or integrated with DQN. At the end of this paper, we demonstrate the effectiveness of MRLS-Q on the CartPole problem and four Atari games and investigate the influences of its hyperparameters experimentally. [ABSTRACT FROM AUTHOR]

Q-learning is a classical reinforcement learning algorithm and one of the most important methods of mobile robot path planning without a prior environmental model. Nevertheless, Q-learning is too simple when initializing Q-table and wastes too much time in the exploration process, causing a slow convergence speed. This paper proposes a new Q-learning algorithm called the Paired Whale Optimization Q-learning Algorithm (PWOQLA) which includes four improvements. Firstly, to accelerate the convergence speed of Q-learning, a whale optimization algorithm is used to initialize the values of a Q-table. Before the exploration process, a Q-table which contains previous experience is learned to improve algorithm efficiency. Secondly, to improve the local exploitation capability of the whale optimization algorithm, a paired whale optimization algorithm is proposed in combination with a pairing strategy to speed up the search for prey. Thirdly, to improve the exploration efficiency of Q-learning and reduce the number of useless explorations, a new selective exploration strategy is introduced which considers the relationship between current position and target position. Fourthly, in order to balance the exploration and exploitation capabilities of Q-learning so that it focuses on exploration in the early stage and on exploitation in the later stage, a nonlinear function is designed which changes the value of ε in ε-greedy Q-learning dynamically based on the number of iterations. Comparing the performance of PWOQLA with other path planning algorithms, experimental results demonstrate that PWOQLA achieves a higher level of accuracy and a faster convergence speed than existing counterparts in mobile robot path planning. The code will be released at https://github.com/wanghanyu0526/improveQL.git. [ABSTRACT FROM AUTHOR]

In this paper, cognitive technology is introduced into the integrated satellite terrestrial system to realize the dynamic spectrum sharing of the system and improve the utilization rate of spectrum resources. To overcome the effects of low signal-to-noise ratio (SNR) and noise uncertainty in the channel, a dual-threshold cooperative sensing strategy based on energy detection is introduced. Spectrum sensing is considered as a binary hypothesis problem, but the uncertainty of noise interference in the integrated satellite terrestrial cognitive system will cause the perception to appear ambiguous. Moreover, the noise power varies with time and relative position within a certain range. In the fuzzy state, the perception technology adopts the equal-gain merging algorithm, and derives the voting optimization algorithm to improve the accuracy of decision-making. In addition, taking the minimum error probability as the optimization goal, the optimal adjustment of the adaptive double threshold is realized based on the equal-gain combining algorithm. The simulation results show that the spectrum detection accuracy under low SNR is improved, and the opportunity for terrestrial networks to share spectrum resources is increased. [ABSTRACT FROM AUTHOR]

The present paper proposes self-adaptive multi-population elitist (SAMPE) Rao algorithms and chaotic Rao algorithms for design optimization of selected mechanical engineering components. The proposed algorithms are applied to 25 benchmark problems and 15mechanical engineering design optimization problems to examine their performance. The Friedman rank test is utilized to demonstrate the significance of the proposed algorithms and the algorithms are ranked according to their performance. The results obtained using the proposed algorithms are compared with the results obtained using other advanced optimization algorithms to demonstrate the effectiveness of the proposed algorithms. It is observed that the performance of the proposed algorithms is either better or competitive to the basic Rao algorithms and the other advanced optimization algorithms. [ABSTRACT FROM AUTHOR]

Imaging through the wavy water–air interface is challenging since the random fluctuations of water will cause complex geometric distortion and motion blur in the images, seriously affecting the effective identification of the monitored object. Considering the problems of image recovery accuracy and computational efficiency, an efficient reconstruction scheme that combines lucky-patch search and image registration technologies was proposed in this paper. Firstly, a high-quality reference frame is rebuilt using a lucky-patch search strategy. Then an iterative registration algorithm is employed to remove severe geometric distortions by registering warped frames to the reference frame. During the registration process, we integrate JADE and LBFGS algorithms as an optimization strategy to expedite the control parameter optimization process. Finally, the registered frames are refined using PCA and the lucky-patch search algorithm to remove residual distortions and random noise. Experimental results demonstrate that the proposed method significantly outperforms the state-of-the-art methods in terms of sharpness and contrast. [ABSTRACT FROM AUTHOR]

The optimization problems are becoming more complicated, requiring new and efficient optimization techniques to solve them. Many bio-inspired meta-heuristic algorithms have emerged in the last decade to solve these complex problems as most of these algorithms may be trapped into local optima and could not effectively solve all types of optimization problems. Hence, researchers are still trying to develop new and better optimization algorithms. This paper introduces a novel biologically-based optimization algorithm called circulatory system-based optimization (CSBO). CSBO is modeled based on the function of the body's blood vessels with two distinctive circuits, i.e. pulmonary and systemic circuits. The proposed CSBO algorithm is tested on a wide variety of complex functions of the real world and validated with the standard meta-heuristic algorithms. The results indicate that the CSBO algorithm successfully achieves the optimal solutions and avoids local optima. Note that the source code of the CSBO algorithm is publicly available at . [ABSTRACT FROM AUTHOR]

In this paper, a new stochastic optimization algorithm is introduced, called Driving Training-Based Optimization (DTBO), which mimics the human activity of driving training. The fundamental inspiration behind the DTBO design is the learning process to drive in the driving school and the training of the driving instructor. DTBO is mathematically modeled in three phases: (1) training by the driving instructor, (2) patterning of students from instructor skills, and (3) practice. The performance of DTBO in optimization is evaluated on a set of 53 standard objective functions of unimodal, high-dimensional multimodal, fixed-dimensional multimodal, and IEEE CEC2017 test functions types. The optimization results show that DTBO has been able to provide appropriate solutions to optimization problems by maintaining a proper balance between exploration and exploitation. The performance quality of DTBO is compared with the results of 11 well-known algorithms. The simulation results show that DTBO performs better compared to 11 competitor algorithms and is more efficient in optimization applications. [ABSTRACT FROM AUTHOR]

Most of the current algorithms for solving distributed online optimization problems are based on the first-order method, which are simple in computation but slow in convergence. Newton's algorithm with fast convergence speed needs to calculate the Hessian matrix and its inverse, leading to computationally complex. A distributed online optimization algorithm based on Newton's step is proposed in this paper, which constructs a positive definite matrix by using the first-order information of the objective function to replace the inverse of the Hessian matrix in Newton's method. The convergence of the algorithm is proved theoretically and the regret bound of the algorithm is obtained. Finally, numerical experiments are used to verify the feasibility and efficiency of the proposed algorithm. The experimental results show that the proposed algorithm has an efficient performance on practical problems, compared to several existing gradient descent algorithms. [ABSTRACT FROM AUTHOR]

Feature selection provides the optimal subset of features for data mining models. However, current feature selection methods for high-dimensional data also require a better balance between feature subset quality and computational cost. In this paper, an efficient hybrid feature selection method (HFIA) based on artificial immune algorithm optimization is proposed to solve the feature selection problem of high-dimensional data. The algorithm combines filter algorithms and improves clone selection algorithms to explore the feature space of high-dimensional data. According to the target requirements of feature selection, combined with biological research results, this method introduces the lethal mutation mechanism and the Cauchy operator to improve the search performance of the algorithm. Moreover, the adaptive adjustment factor is introduced in the mutation and update phases of the algorithm. The effective combination of these mechanisms enables the algorithm to obtain a better search ability and lower computational costs. Experimental comparisons with 19 state-of-the-art feature selection methods are conducted on 25 high-dimensional benchmark datasets. The results show that the feature reduction rate for all datasets is above 99%, and the performance improvement for the classifier is between 5% and 48.33%. Compared with the five classical filtering feature selection methods, the computational cost of HFIA is lower than the two of them, and it is far better than these five algorithms in terms of the feature reduction rate and classification accuracy improvement. Compared with the 14 hybrid feature selection methods reported in the latest literature, the average winning rates in terms of classification accuracy, feature reduction rate, and computational cost are 85.83%, 88.33%, and 96.67%, respectively. [ABSTRACT FROM AUTHOR]

In this paper, develop image encryption algorithm based on a chaotic bit-plane decomposition and optimization algorithm of a War Optimization Algorithm (WOA). Initially, utilization of SHA-256 hash algorithm for computing the plaintext images hash parameter as initial parameter of the fractional Lorenz hyperchaotic system after the process. Use the chaotic sequence for permuting plaintext image in a bit plane to achieve the scrambled images. After that, block the scrambles image into four sub images of similar size and count the hash parameter of every row of every block through the SHA-256 hash algorithm as the initial parameter of the Sine-Tent Logistic chaotic system. Utilize the achieved chaotic sequence to substitute the images. After that, the four sub-block images to get the last encrypted image and the population can be achieved. At last, utilization information entropy of ciphertext images as the fitness function of WOA. Choose the ciphertext image with the optimal information entropy of ciphertext images as the fitness function of the WOA. Select the ciphertext image with the best information entropy from the population as the optimal encrypted image, and then, return the position value of the best war source meanwhile. The proposed method is implemented in MATLAB and performance is analyzed with performance metrices. The proposed method is compared with the conventional techniques. [ABSTRACT FROM AUTHOR]