Search

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 article demonstrates techniques to solve the linear fractional programming (LFP) problem using an interval approach. This approach addresses uncertainties as intervals and employs interval arithmetic for robustness. In this paper, a reasonable attempt is made to construct a mathematical model of interval linear fractional programming, and various approaches were employed to solve it. The proposed process emphasizes solving the ILFP problem in different optimization techniques and uses interval arithmetic to obtain a better range of intervals. The study illustrates the practical aspects of this approach and its effectiveness in solving real-world situations when uncertainties are significant. The methods, process, solutions, and time consumption are analyzed later to show our proposed method's real-life application and efficiency. [ABSTRACT FROM AUTHOR]

In this paper, we focus on using the low-rank factorization approach to solve the SDP relaxation of a graph equipartition problem, which involves an additional spectral upper bound over the traditional linear SDP. We discuss the equivalence between the decomposed problem and the original SDP problem. We also derive a sufficient condition, under which a second order stationary point of the non-convex problem is also a global minimum. Moreover, the constraints of the non-convex problem involve an algebraic variety with conducive geometric properties which we analyse. We also develop a method to escape from a non-optimal singular point on this variety. This allows us to use Riemannian optimization techniques to solve the SDP problem very efficiently with certified global optimality. [ABSTRACT FROM AUTHOR]

Direct electromagnetic (EM) optimization for microwave components design is usually a time‐consuming process. To improve the optimization efficiency, this paper proposes a novel parallel EM optimization technique exploiting improved pole‐residue‐based neuro‐transfer function (neuro‐TF) surrogate and isomorphic orthogonal design of experiment (DOE) sampling strategy. We propose a new sampling method combining isomorphic orthogonal DOE and parallel EM simulations to generate training data for developing the neuro‐TF surrogate. This proposed sampling method can ensure the scattered distribution of data samples in the overall optimization process, thus effectively improving the surrogate accuracy and increasing the optimization speed. We also propose a new pole‐residue tracking technique for order‐changing to solve the discontinuity problem of pole/residues during the neuro‐TF surrogate development. Different from the fixed split ratio in existing pole‐residue tracking technique, the split ratio of poles and residues in the proposed technique is adaptive and determined according to the information of neighboring samples. Therefore, the continuity and smoothness of pole/residues after the splitting are improved, so as the neuro‐TF surrogate accuracy. In addition, the trust region algorithm is exploited during EM optimization to improve the convergence speed. In this way, the proposed EM optimization technique obtains the optimal solution in a shorter time with fewer iterations than the existing techniques. Two examples of EM optimizations of microwave components are used to illustrate the proposed technique. [ABSTRACT FROM AUTHOR]

Particle swarm optimization algorithms (PSOA) is a metaheuristic algorithm used to optimize computational problems using candidate solutions or particles based on selected quality measures. Despite the extensive research published, studies that critically examine its recent scientific developments and research impact are lacking. Therefore, the publication trends and research landscape on PSOA research were examined. The Preferred Reporting Items for Systematic Reviews and Meta-Analyses (PRISMA) and bibliometric analysis techniques were applied to identify and analyze the published documents indexed in Scopus from 2001 to 2021. The published documents on PSOA increased from 8 to 1,717 (21,362.50%) due to the growing applications of PSOA in solving computational problems. "Conference papers" is the most common document type, whereas the most prolific researcher on PSOA is Andries P. Engelbrecht (South Africa). The most active affiliation (Ministry of Education) and funding organization (National Natural Science Foundation) are based in China. The research landscape on PSOA revealed high levels of publications, citations, and collaborations among the top authors, institutions, and countries worldwide. Keywords co-occurrence analysis revealed that "particle swarm optimization (PSO)" occurred more frequently than others. The findings of the study could provide researchers and policymakers with insights into the prospects and challenges of PSOA research relative to similar algorithms in the literature. [ABSTRACT FROM AUTHOR]

This paper presents a novel Fourier spectral method that utilizes optimization techniques to ensure the positivity and conservation of moments in the space of trigonometric polynomials. We rigorously analyze the accuracy of the new method and prove that it maintains spectral accuracy. To solve the optimization problem, we propose an efficient Newton solver that has a quadratic convergence rate. Numerical examples are provided to demonstrate the high accuracy of the proposed method. Our method is also integrated into the spectral solver of the Boltzmann equation, showing the benefit of our approach in applications. [ABSTRACT FROM AUTHOR]

Production problems have a significant impact on the on-time delivery of orders, resulting in deviations from planned scenarios. Therefore, it is crucial to predict interruptions during scheduling and to find optimal production sequencing solutions. This paper introduces a selflearning framework that integrates association rules and optimisation techniques to develop a scheduling algorithm capable of learning from past production experiences and anticipating future problems. Association rules identify factors that hinder the production process, while optimisation techniques use mathematical models to optimise the sequence of tasks and minimise execution time. In addition, association rules establish correlations between production parameters and success rates, allowing corrective factors for production quantity to be calculated based on confidence values and success rates. The proposed solution demonstrates robustness and flexibility, providing efficient solutions for Flow-Shop and Job-Shop scheduling problems with reduced calculation times. The article includes two Flow-Shop and Job-Shop examples where the framework is applied. [ABSTRACT FROM AUTHOR]

In this paper, different methods are utilized to solve the coordination issue involving directional overcurrent relays (DOCRs) and distance relays. The proper coordination of DOCRs and distance relays is a critical issue for system security in electrical networks. Finding the DOCRs setting, pickup current(Ip) and timed dial setting (TDS), and operating time for zone-2 of distance relays is the primary objective of solving the coordination problem. The constant parameters A & B of the directional overcurrent relay that are responsible to control the form of the relay´s characteristics as well as the Ip and TDS have been regarded as variables in this problem. The optimal value for these four DOCR settings has been determined using different optimization techniques. The primary and backup relays must operate sequentially and without any violations, and this must be guaranteed by optimization techniques. In order to determine the operation time for zone-2 and DOCRs setting, optimization methods are examined utilizing the 8-bus and IEEE 30-bus networks. Different optimization algorithms, including recent and traditional techniques, are compared. The obtained results show the superiority of the genetic algorithm (GA) in solving the coordination problem of distance relays and DOCRs. Also, the obtained results prove the ability of the GA method compared to the particle swarm algorithm (PSO), grey wolf optimization (GWO), water cycle technique (WCA), equilibrium optimizer (EO), African vultures optimization algorithm (AVOA), flow direction algorithm (FDA), and gorilla troops optimizer (GTO) techniques. [ABSTRACT FROM AUTHOR]

Optimal control of linear time-varying (LTV) systems is one of the most common problems in engineering, economics, biology, etc. Solving this problem is not always possible, and this motivates us to improve the existing approximate solution methods. In this paper, the optimality conditions are first obtained, and then the well-known variational iteration method, interpolated by B-spline functions, is applied to solve these conditions. The method is also accelerated through the elimination of redundant calculations. Our method provides a feedback controller for LTV optimal control problems and does not need to solve any system of equations or optimization problems at each iteration. The convergence of the proposed method is proved, and the algorithm's efficiency is illustrated through several examples. [ABSTRACT FROM AUTHOR]

The efficient design of the aerodynamic surfaces in the aircraft allows the optimal performance of the vehicle and the reduction of the fuel consumption. Among these surfaces, the wing is the main contributor to the force which lifts the aircraft enabling the flight. However, the application of this force out of the center of gravity generates a moment that must be balanced through a force applied in the Horizontal-Tail-Plane (HTP) reaching the longitudinal trim of the aircraft. Traditionally, the design of the wing and HTP have been performed iteratively attaining suboptimal or time ineffective results. In this paper, we solve this problem through the application of a Genetic Algorithm for the combined optimization of the wing and the HTP by adjusting the aspect ratio, the taper ratio, the twist angle and the incidence angle of both surfaces to produce the optimal balance of lift adjusting its distribution to an elliptical configuration and enabling the longitudinal trim. Results show the automatic adjustment of the parameters of the aerodynamic surfaces thus fulfilling the objectives of this paper. [ABSTRACT FROM AUTHOR]

When the meta-heuristic algorithm solves the joint resource allocation problem of multi-beam satellites, the computational complexity increases and the algorithm is difficult to converge due to the time delay constraint and capacity constraint. This paper introduced a penalty mechanism in the objective function, and added a penalty value to the objective function of the invalid solution, so that the optimized solution adaptively satisfied these two constraints. Based on this, this paper proposed a joint resource allocation algorithm based on quantum-behaved particle swarm optimization. Simulation results show that the introduction of the penalty strategy solves the problem of difficulty in handling the delay constraint and capacity constraint when applying the meta-heuristic algorithm. The quantum-behaved particle swarm optimization algorithm with penalty mechanism outperforms the existing joint allocation algorithm in terms of allocation fairness index and total system capacity. [ABSTRACT FROM AUTHOR]

The advent of the cloud computing paradigm allowed multiple organizations to move, compute, and host their applications in the cloud environment, enabling seamless access to a wide range of services with minimal effort. An efficient and dynamic task scheduler is required to handle concurrent user requests for cloud services using various heterogeneous and diversified resources. Improper scheduling can lead to challenges with under or over-utilization of resources, which could waste cloud resources or degrade service performance. Nature-inspired optimization techniques have been proven effective at solving scheduling problems. This paper accomplishes a review of nature-inspired optimization techniques for scheduling tasks in cloud computing. A novel classification taxonomy and comparative review of these techniques in cloud computing are presented in this research. The taxonomy of nature-inspired scheduling techniques is categorized as per the scheduling algorithms, nature of the scheduling problem, type of tasks, the primary objective of scheduling, task-resource mapping scheme, scheduling constraint, and testing environment. Additionally, guidelines for future research issues are also provided, which should undoubtedly benefit researchers and practitioners as well as open the door for newcomers eager to pursue their glory in the field of cloud task scheduling. [ABSTRACT FROM AUTHOR]

In the field of many-objective evolutionary optimization algorithms (MaOEAs), how to maintain the balance between convergence and diversity has been a significant research problem. With the increase of the number of objectives, the number of mutually nondominated solutions increases rapidly, and multi-objective evolutionary optimization algorithms, based on Pareto-dominated relations, become invalid because of the loss of selection pressure in environmental selection. In order to solve this problem, indicator-based many-objective evolutionary algorithms have been proposed; however, they are not good enough at maintaining diversity. Decomposition-based methods have achieved promising performance in keeping diversity. In this paper, we propose a MaOEA based on indicator and decomposition (IDEA) to keep the convergence and diversity simultaneously. Moreover, decomposition-based algorithms do not work well on irregular PFs. To tackle this problem, this paper develops a reference-points adjustment method based on the learning population. Experimental studies of several well-known benchmark problems show that IDEA is very effective compared to ten state-of-the-art many-objective algorithms. [ABSTRACT FROM AUTHOR]

The main objective of this paper is to present an improved neural network algorithm (INNA) for solving the reliability-redundancy allocation problem (RRAP) with nonlinear resource constraints. In this RRAP, both the component reliability and the redundancy allocation are to be considered simultaneously. Neural network algorithm (NNA) is one of the newest and efficient swarm optimization algorithms having a strong global search ability that is very adequate in solving different kinds of complex optimization problems. Despite its efficiency, NNA experiences poor exploitation, which causes slow convergence and also restricts its practical application of solving optimization problems. Considering this deficiency and to obtain a better balance between exploration and exploitation, searching procedure for NNA is reconstructed by implementing a new logarithmic spiral search operator and the searching strategy of the learner phase of teaching–learning-based optimization (TLBO) and an improved NNA has been developed in this paper. To demonstrate the performance of INNA, it is evaluated against seven well-known reliability optimization problems and finally compared with other existing meta-heuristics algorithms. Additionally, the INNA results are statistically investigated with the Wilcoxon sign-rank test and Multiple comparison test to show the significance of the results. Experimental results reveal that the proposed algorithm is highly competitive and performs better than previously developed algorithms in the literature. [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]

To solve the problems of high ground stress, low permeability and low coalbed methane recovery, this paper proposes an optimization technique for improving coal seam permeability, i.e., water-gas alternating displacement enhances coalbed methane recovery (WGA-ECBM). The seepage field of gas-water two-phase flow is derived and a multiphase fluid-solid coupling model between physical parameters is established. This paper studies the effects of three displacement methods (water injection, air injection and water-air alternating injection) on methane recovery. The influence of injection pressure and injection duration on the WGA-ECBM technique is also studied. The V C H 4 (methane volume fraction) of the three methods decrease by 17.84%, 12.72% and 44.62% in the borehole, respectively. The influence ranges (diameter) are 24.68 m, 149.73 m and 135.21 m, respectively. Pore pressures and displacement area also increase as injection pressure increases in a 5 MPa gradient. And V C H 4 in the borehole decrease by 35.57%, 43.82%, 46.78% and 51.72% from 10 MPa to 25 MPa, respectively. With the increase of injection duration, the influence range expands significantly but the pore pressure distribution changes little. And V C H 4 decreases slightly in the displaced area and the displacement velocity gradually slows down. This technique promotes multiphase flow migration in coal seam, and increases the displacement range and methane recovery efficiency. [ABSTRACT FROM AUTHOR]

To solve the problems of low convergence accuracy, slow convergence speed and easy to fall into local optimum of traditional particle swarm algorithm, this paper proposed an improved particle swarm algorithm with multistrategy fusion. Firstly, in order to accelerate the convergence speed of free particles, the improved algorithm used a method of updating the position of free particles based on the midperpendicular algorithm. secondly, the improved algorithm designed a strategy of generating exploding particles near the optimal particles to enhance the optimizationseeking accuracy and optimization-seeking speed of the algorithm, and the improved algorithm also designed a particle velocity updating strategy relying only on the global optimal particle position to accommodate the first two strategies. Finally, The algorithm also used the inertia weights and particle position update methods of the simplified particle swarm optimization algorithm based on probabilistic hierarchy. This paper designed a few comparison experiments with other five improved particle swarm algorithms, and the results show that the improved algorithm in this paper has a greater advantage and better performance whether dealing with low-dimensional problems or high-dimensional problems. [ABSTRACT FROM AUTHOR]

The U-turn task is one of the contents of autonomous driving research, and most of the solutions under the standard roads in cities cannot be implemented on non-standard roads. Aiming at solving this problem, this paper establishes a vehicle U-turn dynamical model and designs a multi-scale convolutional neural network to extract feature maps as the input of the agent. In addition, for the sparse reward problem in the U-turn task, this paper proposes a hierarchical proximal policy optimization algorithm that combines hierarchical reinforcement learning and proximal policy optimization algorithm. In experiments with simple and complex scenarios, this algorithm learns policies faster and has a higher success rate of U-turn compared to other algorithms. [ABSTRACT FROM AUTHOR]

To solve the autonomous navigation problem in complex environments, an efficient motion planning approach is newly presented in this paper. Considering the challenges from large-scale, partially unknown complex environments, a three-layer motion planning framework is elaborately designed, including global path planning, local path optimization, and time-optimal velocity planning. Compared with existing approaches, the novelty of this work is twofold: 1) a novel heuristic-guided pruning strategy of motion primitives is proposed and fully integrated into the state lattice-based global path planner to further improve the computational efficiency of graph search, and 2) a new soft-constrained local path optimization approach is proposed, wherein the sparse-banded system structure of the underlying optimization problem is fully exploited to efficiently solve the problem. We validate the safety, smoothness, flexibility, and efficiency of our approach in various complex simulation scenarios and challenging real-world tasks. It is shown that the computational efficiency is improved by 66.21% in the global planning stage and the motion efficiency of the robot is improved by 22.87% compared with the recent quintic Bézier curve-based state space sampling approach. We name the proposed motion planning framework E $\mathbf {^{3}} $ MoP, where the number 3 not only means our approach is a three-layer framework but also means the proposed approach is efficient in three stages. Note to Practitioners—This paper is motivated by the challenges of motion planning problems of mobile robots. A three-layer motion planning framework is proposed by combining global path planning, local path optimization, and time-optimal velocity planning. For mobile robot navigation applications in semi-structured environments, optimization-based local planners are recommended. Extensive simulation and experimental results show the effectiveness of the proposed motion planning framework. However, due to the non-convexity of the path optimization formulation, the proposed local planner may get stuck in local optima. In future research, we will concentrate on extending the proposed local path optimization approach with the theory of homology classes to maintain several homotopically distinct local paths and seek global optima. [ABSTRACT FROM AUTHOR]

At present, cloud services and cloud manufacturing are developing rapidly, speed and accuracy have become the themes of cloud manufacturing development. The core component of cloud manufacturing is resource portfolio optimization. In cloud manufacturing today, the scale of service portfolios is expanding rapidly, and the number of candidate services which in the service pool is increasing gradually. To adapt to the development of cloud services, an optimization algorithm with faster speed, greater precision and higher stability is required to solve the problem of cloud service composition and optimization (CSCO). To increase the convergence rate and avoid falling into local optima with the artificial bee colony algorithm, a self-learning artificial bee colony genetic algorithm (SLABC-GA) is proposed in this paper, which is based on reinforcement learning (RL), and the RL is used to intelligently select the number of dimensions of each update of a feasible solution. A global optimal individual is used to search and guide the search equation to avoid obtaining local optima and improve algorithm development and the precision of the traditional artificial bee colony algorithm (ABC). A genetic algorithm (GA) is introduced in a later stage of the algorithm to further improve its accuracy and convergence speed. Additionally, this paper analyzes and constructs the self-learning model in SLABC, the optimal learning method is Q-learning algorithm, and designs a reward method and state determination method of RL in the environment of the bee colony algorithm. Finally, a large number of comparative experiments have been carried out, the results show that the accuracy and speed of the SLABC-GA outperform for CSCO problems, and the performance of the SLABC-GA for large-scale CSCO problems is better than that of genetic algorithm (GA) and the traditional artificial bee colony algorithm (ABC). [ABSTRACT FROM AUTHOR]

In this paper, we focus on a subclass of quadratic optimization problems, that is, disjoint bilinear optimization problems. We first show that disjoint bilinear optimization problems can be cast as two-stage robust linear optimization problems with fixed-recourse and right-hand-side uncertainty, which enables us to apply robust optimization techniques to solve the resulting problems. To this end, a solution scheme based on a blending of three popular robust optimization techniques is proposed. For disjoint bilinear optimization problems with a polyhedral feasible region and a general convex feasible region, we show that, under mild regularity conditions, the convex relaxations of the original bilinear formulation and its two-stage robust reformulation obtained from a reformulation-linearization-based technique and linear decision rules, respectively, are equivalent. For generic bilinear optimization problems, the convex relaxations from the reformulation-linearization-based technique are generally tighter than the one from linear decision rules. Numerical experiments on bimatrix games, synthetic disjoint bilinear problem instances, and convex maximization problems demonstrate the efficiency and effectiveness of the proposed solution scheme. Summary of Contribution: Computing solutions for disjoint bilinear optimization problems are of much interest in real-life applications, yet they are, in general, computationally intractable. This paper proposes a computationally tractable approximation as well as a convergent algorithm to the optimal values of such problems. Extensive computational experiments on (i) (constrained) bimatrix games, (ii) synthetic disjoint bilinear problems, and (iii) convex maximization problems are conducted to demonstrate the effectiveness and efficiency of the proposed approach. [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]

Metaheuristics in recent years has proven its effectiveness; however, robust algorithms that can solve real-world problems are always needed. In this paper, we suggest the first extended version of the recently introduced gaining–sharing knowledge optimization (GSK) algorithm, named multiobjective gaining–sharing knowledge optimization (MOGSK), to deal with multiobjective optimization problems (MOPs). MOGSK employs an external archive population to store the nondominated solutions generated thus far, with the aim of guiding the solutions during the exploration process. Furthermore, fast nondominated sorting with crowding distance was incorporated to sustain the diversity of the solutions and ensure the convergence towards the Pareto optimal set, while the ϵ -dominance relation was used to update the archive population solutions. ϵ -dominance helps provide a good boost to diversity, coverage, and convergence overall. The validation of the proposed MOGSK was conducted using five biobjective (ZDT) and seven three-objective test functions (DTLZ) problems, along with the recently introduced CEC 2021, with fifty-five test problems in total, including power electronics, process design and synthesis, mechanical design, chemical engineering, and power system optimization. The proposed MOGSK was compared with seven existing optimization algorithms, including MOEAD, eMOEA, MOPSO, NSGAII, SPEA2, KnEA, and GrEA. The experimental findings show the good behavior of our proposed MOGSK against the comparative algorithms in particular real-world optimization problems. [ABSTRACT FROM AUTHOR]

In recent years, many studies have been used in feed-forward neural network (FNN) to develop decision-making systems. The primary objective is to get the least error by finding the best combination of control parameters. It has been observed that FNNs using meta-heuristics techniques always converges very quickly towards the optimal positions but suffers from slow searching speeds at later stages of generation. Due to slow convergence, it is a prevalent phenomenon that traditional optimization does not ensure to find global optima. As a result, it falls under local optima. Recently, another meta-heuristic optimization-based algorithm called sine cosine algorithms (SCA) was introduced to solve the aforementioned issues. The algorithm is fundamentally predicated on two trigonometric functions, one being sine and the other being cosine. However, like other traditional approaches, SCA has a tendency to be stuck in sub-optimal regions due to poor exploration and exploitation capabilities. This paper proposes an improved version of SCA named chaotic oppositional SCA (COSCA) by integrating with chaos theory and oppositional based learning into the SCA optimization process. It is an incipient training method employed to train an FNN. Three benchmark problems are used to examine the precision and performance of FNNs equipped with COSCA, COPSO, OSCA, SCA, PSO, and backpropagation. The experimental results showed that, relative to other meta-heuristic optimization techniques, the COSCA technique is able to improve performance. [ABSTRACT FROM AUTHOR]

This paper describes a computational procedure to establish the optimal distribution of network reconfiguration by means of a novel gray wolf optimization (GWO) algorithm. The procedure aimed to diminish the system's power loss and produce a better voltage profile while fulfilling the operating constraints described by different operating conditions. Under practical restrictions, the distribution network reconfiguration (DNR) problem is classified as multimodal and highly nonlinear. Constraint breaches were appropriately handled to produce stable convergence characteristics, and high-quality solutions were obtained in a shorter execution time. The 33-bus and 69-bus systems were used to obtain the optimal reconfiguration by incorporating the method developed in this work. The simulation results obtained were collated and compared with the outcomes of other well-known optimization techniques, confirming the efficacy of the GWO algorithm in solving the DNR problem. [ABSTRACT FROM AUTHOR]

In this paper, a distributed fixed time gradient algorithm for neurodynamic systems is proposed for solving optimization problems with local inequality constraints. The algorithm is designed using fixed time theory and sliding model control techniques, where each agent has a local objective function known only to itself, and the optimal solution of each local objective function sum can be obtained in a fixed time by the information interaction between neighbors under the condition of local inequality constraints. In addition, the upper bound of the fixed time can be obtained and it is proved theoretically that the upper bound of the fixed time is independent of the initial value. Finally, the stability and effectiveness of the algorithm are verified by numerical examples. [ABSTRACT FROM AUTHOR]

The echoes collected by wideband radar systems provide abundant information on target scatterers, which is beneficial to target detection, classification, and recognition. However, as the radar range resolution increases, range cell migration (RCM) during the coherent integration (CI) period happens much easier, which may cause a degradation of target detection probability. In addition, due to the target's orientation and structure relative to the radar, the distribution characteristics of the target scatterers in high-resolution range profiles (HRRPs) and the detection window length may vary from pulse to pulse, which may reduce the performance of traditional energy integration (EI) detectors. To solve those problems, moving range-spread target (RST) detection combining the modified keystone transform (MKT) and improved EI (IEI) is proposed in this paper. Firstly, based on waveform entropy minimization, MKT using hunter–prey optimization (HPO) is introduced to reduce the CI gain loss. The target Doppler ambiguity factor is estimated using such an effective optimization technique. Then, the IEI detector optimized by the adaptive threshold and detection window is utilized to achieve target detection, which minimizes the sensitivity of the traditional EI detector to the detection window length. The proposed method significantly improves the performance of moving RSTs in sea clutter without prior knowledge of the target Doppler ambiguity factor. Experiments are conducted by comparing the proposed method with other competing methods on both simulation data and real sea clutter data. The results demonstrate that the proposed method can obtain the CI more efficiently and has a higher detection probability. [ABSTRACT FROM AUTHOR]

This paper addresses the reconstruction issue of sparse signal by developing centralized and distributed neurodynamic approaches. An l 1 -minimization problem can be employed for reconstructing sparse signal, and for solving this problem, a centralized neurodynamic approach with derivative feedback is designed. Considering the fact that the distributed approaches decompose the large-scale problem into small-scale one without central processing node in centralized ones, it effectively reduces the computational complexity of a single node. According to the distributed consensus and graph theory, the original l 1 -minimization problem can be equivalently transformed as a distributed optimization problem. Then, based on our proposed centralized approach, a distributed neurodynamic approach with derivative feedback is further proposed. Through the convex optimization theory and Lyapunov method, we indicate that the optimal solution of l 1 -minimization problem is equivalent to the equilibrium point of centralized or distributed approach, and that each neurodynamic approach globally converges to its equilibrium point. Furthermore, by comparing with several state-of-the-art neurodynamic approaches, our proposed approaches demonstrate their effectiveness and superiority by simulation results in reconstructing sparse signals and images. [ABSTRACT FROM AUTHOR]

Mixed pixels are the main reason for the low accuracy of traditional remote sensing applications. Hyperspectral image unmixing can explore the sub-pixel information of mixed pixels, which is an effective measure to solve the problems of low precision. Current unmixing methods only consider the correlation of local or global pixels and do not fully utilize images information. Based on the above problems, we proposed a novel sparse unmixing model named combining low-rank constrain for similar superpixels and total variation sparse unmixing (CLRSS-TV) in this current research paper. The adjacent similar pixels are clustered first into superpixels, then the superpixels with the same semantic information are merged into a collection. The spatial information of the image is fully considered by twice clustering. Weighted low-rank constraint is imposed on each collection to consider the spectral correlation of pixels. Moreover, the TV regularization and l2,1 norm are utilized to improve the smoothness and row sparsity, respectively. Experimental results reveal that the proposed method is not only competitive with the four state-of-the-art algorithms in simulated and actual datasets, but also has good anti-noise ability and universality. However, this paper still fails to overcome the problem of parameters selection in sparse unmixing, so the future work study intends to adopt the intelligent optimization algorithm to obtain the optimal parameters. [ABSTRACT FROM AUTHOR]

Video shooting conditions are almost never close to ideal. Even under favorable conditions (good lighting, diffused light, etc.), the resulting image may be blurred because of camera movement or poor focus. This problem is especially acute in fields where image restoration can be very expensive or even impossible. There are many methods to solve this problem; however, none of them completely solves it. The existing approaches can be divided into two classes: manual restoration and automatic restoration. For manual restoration, it is necessary to have information about the factors that caused blurring, as well as about their parameters. In practice, these parameters are almost always not known. Therefore, the problem of automatic restoration of blurred images (blind deconvolution) is of greater interest and importance. The process of solving this problem in blind deconvolution methods consists in optimizing a certain function. This paper presents an overview of existing image restoration methods and proposes a restoration procedure based on an optimization model that uses genetic algorithms with certain recombination operators. For optimization, blind deconvolution mainly uses gradient methods. However, these methods have a flaw: they tend to stuck in local minima. Genetic algorithms are more robust. However, despite this advantage, there are few studies devoted to the use of the genetic algorithm as an optimization model for blind deconvolution. The results of our research, including some specific aspects of using genetic algorithms, are discussed at the end of the paper. [ABSTRACT FROM AUTHOR]

Virtualization technology, as the technical support for cloud computing, frees users from the limitations of hardware resources. Dynamic migration technology enables virtual machines to be moved across hosts, and services running on the virtual machines are basically uninterrupted during the migration process, which greatly facilitates the maintenance work in the data center. However, dynamic migration needs to transmit a large amount of repeated data. In order to improve the migration efficiency, this paper conducts the following research on the original pre-copy algorithm. First, we introduce a high dirty page determination algorithm based on the locality principle to classify memory pages and propose an improved memory migration pre-copy algorithm on this basis. Second, in order to solve the problem that the pre-copy algorithm cannot converge under a high load, an improved VM downtime determination algorithm is proposed. Third, the paper also introduces the LZ4 compression algorithm to further optimize the memory migration process. Finally, this paper implements the above optimization scheme on a KVM platform and tests its performance. It is compared with the native pre-copy algorithm and Three-Phase Optimization algorithm (TPO). The result shows that the optimized scheme significantly reduces the total migration time and downtime. [ABSTRACT FROM AUTHOR]

In order to effectively solve the problem that the radar detection system is difficult to detect the "low, small, slow" UAV, the high-performance computing early warning neural network is used to recognize the air UAV in real time and extract the target category and image space location information; the PSO algorithm is used to optimize the parameters of the anti-UAV to ensure that the anti-UAV not only relies on factors but also fully combines the dependence of the visual field factor to quickly obtain the optimal solution through analyzing the high-performance computing early warning neural network in this paper. This algorithm is used to initialize the anti-UAV resources and improve the global optimization capability of the algorithm proposed in this paper. Finally, the experimental results show that the proposed PSO algorithm has better high-performance computing early warning performance to meet the actual needs of network high-performance computing early-warning neural networks. [ABSTRACT FROM AUTHOR]

Grasshopper optimization algorithm (GOA) is a meta-heuristic algorithm for solving optimization problems by modeling the biological habit and social behavior of grasshopper swarms in nature. Compared with other optimization algorithms, GOA still has room to improve its performance on solving complex problems. Therefore, this paper proposes an improved grasshopper optimization algorithm (EMGOA) based on dynamic dual elite learning and sinusoidal mutation. First of all, dynamic elite learning strategy is adopted to improve the influence of elites on the update process, enabling the algorithm to have a faster convergence speed. Then, sinusoidal function is utilized to guide the mutation of the current global optimal individual during each iteration to avoid the algorithm falling into the local optimum and improve the convergence accuracy of the algorithm. In order to investigate the performance of the proposed EMGOA algorithm, experiments are conducted on 26 benchmark functions and CEC2019 in this paper. The experimental results show that the optimization performance of EMGOA is obviously better than GOA, and EMGOA is competitive with six state-of-the-art meta-heuristic optimization algorithms. [ABSTRACT FROM AUTHOR]

Particle swarm optimization (PSO) is a popular optimization technique known for its simplicity and effectiveness. This paper introduces a variant that achieves a better balance between exploration and exploitation, named DiPSO. DiPSO incorporates a novel strategy based on trends in mean distance between individuals for local exploitation control. Experiments on 29 benchmark functions demonstrate that DiPSO consistently outperforms the state‐of‐the‐art variant of PSO. Convergence analysis reveals that DiPSO achieves faster convergence and superior solutions. These results highlight the effectiveness of DiPSO in solving optimization problems. © 2023 Institute of Electrical Engineer of Japan and Wiley Periodicals LLC. [ABSTRACT FROM AUTHOR]

In this paper, a whale optimization algorithm based on adaptive inertia weight and variable spiral position updating strategy is proposed. The improved algorithm is used to solve the problem that the whale optimization algorithm is more dependent on the randomness of the parameters, so that the algorithm's convergence accuracy and convergence speed are insufficient. The adaptive inertia weight, which varies with the fitness of individual whales, is used to balance the algorithm's global search ability and local exploitation ability. The variable spiral position update strategy based on the collaborative convergence mechanism is used to dynamically adjust the search range and search accuracy of the algorithm. The effective combination of the two can make the improved whale optimization algorithm converge to the optimal solution faster. It had been used 18 international standard test functions, including unimodal function, multimodal function, and fixed-dimensional function to test the improved whale optimization algorithm in this paper. The test results show that the improved algorithm has faster convergence speed and higher algorithm accuracy than the original algorithm and several classic algorithms. The algorithm can quickly converge to near the optimal value in the early stage, and then effectively jump out of the local optimal through adaptive adjustment, and has a certain ability to solve large-scale optimization problems. [ABSTRACT FROM AUTHOR]

In order to solve the problem of premature convergence and falling into local optimum in biogeography-based optimization algorithm, this paper proposed an improved biogeography-based optimization algorithm introducing species evolution (SEBBO). The algorithm divided all habitats into three regions according to the number of species, established a co-evolution relationship, and reasonably adopted interval invasion and regional cooperation/competition strategies to meet diversity while avoided premature convergence. It defined two mutation strategies of species change and species development, and designed the dual-strategy cooperative mutation operator to solve the damage of the mutation operator to the better solution. Then, compared with standard BBO and other related improved algorithms on 8 benchmark functions from CEC2017, SEBBO algorithm is superior to BBO and other BBO variants in terms of algorithm performance and stability, and local optimal values is not easily limit the algorithm. Finally, this paper applied the SEBBO algorithm to flexible Job-Shop scheduling with maximum completion time as the goal to test its practical application value. Experiments show that the algorithm has a certain effectiveness in solving FJSP. [ABSTRACT FROM AUTHOR]

This paper discusses a nonlinear optimization problem with the system of max-Archimedean bipolar fuzzy relation equations as constraints. Some results related to the structure of the solution set of max-Archimedean bipolar fuzzy relation equations are proved. Using these results, a genetic algorithm is proposed to solve the problem for obtaining optimal or converging solutions. The effectiveness of the algorithm is also compared with other methods found in the literature. The previous methods require conversion of the problem into 0-1 mixed integer optimization problem solvable by some nonlinear optimization solvers and thereby, the computational work may increase with the size of the problem. Some test problems are developed to evaluate the performance of the proposed algorithm. [ABSTRACT FROM AUTHOR]

Introduction/purpose: In this paper, a new solution for solving a multiobjective integer programming problem with probabilistic multi – objective optimization is formulated. Furthermore, discretization by means of the good lattice point and sequential optimization are employed for a successive simplifying treatment and deep optimization. Methods: In probabilistic multi – objective optimization, a new concept of preferable probability has been introduced to describe the preference degree of each performance utility of a candidate; each performance utility of a candidate contributes a partial preferable probability and the product of all partial preferable probabilities deduces the total preferable probability of a candidate; the total preferable probability thus transfers a multi-objective problem into a single-objective one. Discretization by means of the good lattice point is employed to conduct discrete sampling for a continuous objective function and sequential optimization is used to perform deep optimization. At first, the requirements of integers in the treatment could be given up so as to simply conduct above procedures. Finally, the optimal solutions of the input variables must be rounded to the nearest integers. Results: This new scheme is used to deal with two production problems, i.e., maximizing profit while minimizing pollution and determining a purchasing plan for spending as little money as possible while getting as large amount of raw materials as possible. Promising results are obtained for the above two problems from the viewpoint of the probability theory for simultaneous optimization of multiple objectives. Conclusion: This method properly considers simultaneous optimization of multiple objectives in multi-objective integer programming, which naturally reflects the essence of multi-objective programming, and opens a new way of solving multi-objective problems. [ABSTRACT FROM AUTHOR]

With the rapid growth of the number of web services on the Internet, various service providers provide many similar services with the same function but different quality of service (QoS) attributes. It is a key problem to be solved urgently to select the service composition quickly, meeting the users' QoS requirements from many candidate services. Optimization of web service composition is an NP-hard issue and intelligent optimization algorithms have become the mainstream method to solve this complex problem. This paper proposed a hybrid strategy improved whale optimization algorithm, which is based on the concepts of chaos initialization, nonlinear convergence factor and mutation. By maintaining a balance between exploration and exploitation, the problem of slow or early convergence is overcome to a certain extent. To evaluate its performance more accurately, the proposed algorithm was first tested on a set of standard benchmarks. After, simulations were performed using the real quality of web service dataset. Experimental results show that the proposed algorithm is better than the original version and other meta-heuristic algorithms on average, as well as verifies the feasibility and stability of web service composition optimization. [ABSTRACT FROM AUTHOR]

Millimeter-wave (mmWave) communication is considered a promising technology for fifth-generation (5G) wireless communications systems since it can greatly improve system throughput. Unfortunately, because of extremely high frequency, mmWave transmission suffers from the signal blocking problem, which leads to the deterioration of transmission performance. In this paper, we solve this problem by the combination of ultra-dense network (UDN) and user-centric virtual cell architecture. The deployment of dense small base stations (SBSs) in UDN can reduce transmission distance of signals. The user-centric virtual cell architecture mitigates and exploits interference to improve throughput by using coordinated multipoint (CoMP) transmission technology. Nonetheless, the backhaul burden is heavy and interbeam interference still severe. Therefore, we propose a novel iterative backhaul capacity-limited joint user association and power allocation (JUAPA) scheme in ultra-dense mmWave networks under user-centric virtual cell architecture. To mitigate interference and satisfy quality of service (QoS) requirements of users, a nonconvex system throughput optimization problem is formulated. To solve this intractable optimization problem, we divide it into two alternating optimization subproblems, i.e., user association and power allocation. During each iteration, a many-to-many matching algorithm is designed to solve user association. Subsequently, we perform power allocation optimization using a successive convex approximation (SCA) algorithm. The results confirm that the performance of the proposed scheme is close to that of the exhaustive searching scheme, which greatly reduces complexity, and clearly superior to that of traditional schemes in improving system throughput and satisfying QoS requirements. [ABSTRACT FROM AUTHOR]

To solve the problems of low convergence accuracy and easy to fall into local optimum in the optimization process of the original artificial bee colony algorithm, this paper proposed an enhanced artificial bee colony algorithm with strong and weak ties theory (SWT-ABC). Firstly, it defined the strong and weak ties model in a matrix multi-groups structure and stipulated that the strong ties individuals randomly guided the search process from three directions to improve the convergence speed and accuracy. In order to enhance the ability to jump out of the local optimum, SWT-ABC adopted the interaction of weak ties individuals among subgroups to enhance the population diversity. Finally the algorithm added the reverse learning mechanism of scout bees and determined appropriate upper limit of honey source to improve the utilization efficiency of the evaluation times. Through the numerical experiment of benchmark functions and comparisons with 12 improved intelligent optimization algorithms, it shows that the SWT-ABC has high convergence accuracy and good robustness, and also gets good performance in solving high-dimensional optimization problems. [ABSTRACT FROM AUTHOR]

Particle swarm optimisation (PSO) is one of the widely adopted meta-heuristic methods for solving real-life problems. Its practical utility can be further enhanced by improving its performance. In order to acheive this, academics have presented several variants of the original PSO over the past few years, including the quantum PSO (QPSO), bare-bones PSO (BB-PSO), hybrid PSO, fuzzy PSO, etc. In this paper, the performance of PSO is improved by proposing a fragmented swarm optimisation approach known as the PSOα. The PSOα is tested and compared with PSOs over 14 different benchmarking cost functions to validate its efficacy. The analysis is also carried out to see the impact of α on its performance. It is observed that the average value of the cost function over 50 simulations obtained using the fragmented swarm approach is lower than that obtained using the standard PSO in 12 out of 14 benchmark functions. Similarly, the fragmented approach outperforms the standard PSO in 13 out of 14 benchmark functions when compared with the best fitness value achieved out of 50 simulations. Finally, the proposed approach is applied to solve the well-known real-life optimisation problem of load frequency control (LFC) in power systems. A test system comprising both renewable and traditional power sources is considered to evaluate the efficacy of the proposed technique. A fractional order proportional-integral-differential (FOPID) controller is used, whose parameters are optimised using the proposed PSO for achieving the LFC. The proposed fragmentation approach can be applied with other optimisation techniques to improve their performance. [ABSTRACT FROM AUTHOR]

Aiming at the problem of user's task offloading in mobile edge computing and the potential leakage of location privacy during the offloading process, a privacy-preserving computing offloading scheme based on whale optimization algorithm is proposed. Using differential privacy technology to obfuscate the user's location information, the user can make task offloading decisions according to the obfuscated distance. Considering the delay, energy consumption, and their weighted sum, the offloading problem is modeled as a convex optimization problem. Then, the whale optimization algorithm is adopted to solve this optimization problem to achieve a balance between privacy protection and resource consumption. Experiments are conducted to verify the relationship between the degree of privacy leakage, the computation-offloading cost and real distance, privacy-preserving impact factor, the respective weights of time delay and energy consumption The experimental results show that the offloading scheme proposed in this paper has good performance in terms of cost and privacy protection. [ABSTRACT FROM AUTHOR]

This paper considers the distributed cluster optimisation problem of multi-agent systems (MASs). Different from existing optimisation problems, the MASs are divided into several clusters, and each cluster has its own optimisation objective which is the sum of their local objective functions. Firstly, based on communication topology, the distributed optimisation problem with two clusters is considered and a kind of distributed control protocol is proposed. By using the fixed-time stability theory and the convexity of function, it is proved that the MASs can not only achieve cluster consensus in a fixed-time interval, but also solve the optimisation problem asymptotically. Secondly, the MASs with multiple clusters are further considered. We extend the proposed protocol to a more general case and also prove that MASs can achieve cluster consensus in fixed-time and asymptotically reach the optimal solution of the optimisation objective. Finally, some numerical simulations are presented to show the efficacy of the theoretical results. [ABSTRACT FROM AUTHOR]

In this paper, we propose a control framework for intelligent surgical robots under the Remote Center of Motion (RCM). The goal of a surgical robot is to assist surgeons in performing complex surgeries. RCM constraint implies that the surgical tip attached to the end-effector of the surgical robot does not slide away from the point of the incision while performing surgery. Implementation of a control algorithm to comply with RCM constraints is a complicated task because of the nonlinear model of the surgical robots and stringent conditions of accuracy imposed by the patient's safety. This paper proposes an optimization-driven approach to perform the surgical maneuver under RCM constraints. We then applied a bio-inspired optimization algorithm to solve the problem efficiently. For testing the performance of ZNNBAS, we used MATLAB to simulate a surgical procedure. A 7-DOF surgical robot (KUKA LBR IIWA 7) was used as a test bench for running the simulations. The simulation results show that the ZNNBAS is comparable with BAS, PSO, and GA and efficiently and robustly performed the task commanded maneuvers while enforcing the RCM constraints. [ABSTRACT FROM AUTHOR]

The parameter optimization of hybrid electric vehicle is very complex and has always been the focus of research, due to the highly intertwined relationship between powertrain configurations and EMS. In addition, automated powertrain is typical cyber-physics system that contains discrete states, such as modes and gears. Transition between discrete states is a contributing factor that causes discomfort. Therefore, in order to solve the above problems, this paper proposes a multi-objective dynamic optimization algorithm considering mode transition. The algorithm consists of two layers. The first layer optimizes fuel economy and dynamic performance, the second layer optimizes ride comfort and smoothness performance, and the results of the second layer are returned to the first layer for re-optimization in real time. The mode transition frequency is used as the comfort objective function, and the threshold value of the engine high efficiency working area is added to the optimization parameter selection. The results show that the optimization method proposed in this paper realizes the parameter decoupling, and the optimization results achieve the global optimization. Effectively improves the vehicle performance and reduces engine start-stop frequently. [ABSTRACT FROM AUTHOR]

In order to solve the problems of lack of state labels, lack of data samples and unbalanced distribution in equipment life prediction, this paper proposed an improved K-means algorithm based on PSO and a data optimization scheme based on traditional SMOTE. In the process of optimizing K-means algorithm, it combined the characteristics of particle swarm optimization algorithm, and improved the optimization efficiency of particle swarm optimization algorithm by giving the particle generation range of particle swarm optimization algorithm, so as to quickly judge the working state of the equipment. Then, by comparing the mean distance of samples in the same cluster with the distance from the sample to the center, it established an improved SMOTE algorithm, and avoided the calculation error caused by the imbalance of samples by adding the number of minority samples. Finally, this paper used AdaBoost integrated optimization KNN algorithm to improve the classification effect, and by fitting the equipment life curve, it could better predict the equipment health level and future life. The example shows that the proposed model can effectively predict the health status of equipment under small sample unbalanced data. [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]

This paper proposes an improved version of the artificial ecosystem-based optimization (AEO) algorithm called artificial ecosystem-based optimization–opposition-based learning (AEO-OBL), with the aim of improving the performance of the original AEO. In addition, it is utilized for determining the optimal allocation of distributed generation (DG) units in radial distribution networks (RDNs) with the aim of minimizing power and energy losses. The stochastic nature of renewable DGs such as wind turbine and photovoltaic generation is taken in consideration using appropriate probability models. The Loss Sensitivity Index is used to assess the most suitable busses for the integration of DG units in the RDN. AEO is nature-inspired optimization algorithm which imitates the flow of energy in an ecosystem on earth. In the proposed AEO-OBL, the search ability and the balance between the exploration and exploitation phases in the original AEO are enhanced. In the AEO-OBL, five efficient strategies are used to avoid falling on a local optimal: (1) enhanced linear weight coefficient a, (2) production operator, (3) modified consumption operator, (4) modified decomposing operator and (5) opposition-based learning (OBL). The performance of the proposed technique is validated on IEEE 33-bus and 85-bus RDNs. To emphasize the superiority of the proposed technique, the results are compared with the original AEO, Henry gas solubility optimizer (HGSO) and Harris hawks optimization (HHO) algorithm results. Besides, the developed algorithm is compared with other optimization algorithms in literature that solved the same problem. The outcomes indicate a better performance of AEO-OBL relative to other algorithms. Accordingly, AEO-OBL can be a very suitable algorithm in solving the problem of optimal DG allocation in RDNs. [ABSTRACT FROM AUTHOR]

Evolutionary multi-objective optimization (EMO) refers to the domain in which an evolutionary algorithm is applied to tackle an optimization problem with multiple objective functions. The literature is rich with many approaches proposed to solve multi-objective problems including the NSGA-II, MOEA/D, and MOPSO algorithms. The proposed approaches include stand-alone as well as hybrid techniques. One critical aspect of any evolutionary algorithm (EA) is the stopping criterion. The selection of a specific stopping criterion can have a considerable effect on the performance and the final solution provided by the EA. A number of different stopping criteria, specifically designed for EMO, have been proposed in the literature. In this paper, the performance of six different EMO algorithms is tested and compared using four stopping criteria. The experiments are performed using the ZDT, DTLZ, CEC2009, Tanaka and Srivana test functions. Experimental results are analyzed to highlight the proper stopping criteria for different algorithms. [ABSTRACT FROM AUTHOR]